Il problema dell'allocazione di capacità su rete
Bollettino dell'Unione Matematica Italiana (2005)
- Volume: 8-A, Issue: 3-1, page 585-588
- ISSN: 0392-4041
Access Full Article
top
How to cite
topMattia, Sara. " Il problema dell'allocazione di capacità su rete." Bollettino dell'Unione Matematica Italiana 8-A.3-1 (2005): 585-588. <http://eudml.org/doc/289477>.
@article{Mattia2005,
author = {Mattia, Sara},
journal = {Bollettino dell'Unione Matematica Italiana},
language = {ita},
month = {12},
number = {3-1},
pages = {585-588},
publisher = {Unione Matematica Italiana},
title = { Il problema dell'allocazione di capacità su rete},
url = {http://eudml.org/doc/289477},
volume = {8-A},
year = {2005},
}
TY - JOUR
AU - Mattia, Sara
TI - Il problema dell'allocazione di capacità su rete
JO - Bollettino dell'Unione Matematica Italiana
DA - 2005/12//
PB - Unione Matematica Italiana
VL - 8-A
IS - 3-1
SP - 585
EP - 588
LA - ita
UR - http://eudml.org/doc/289477
ER -
References
top- AHUJa, R.K., MAGNANTI, T.L., ORLIN, J.B., Network Flows. Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, New Jersey (1993). Zbl1201.90001
- ATAMTURK, A., On Capacitated Network Desing Cut-Set Polyhedra, Mathematical Programming Ser. B, 92 (2002), 425-437. Zbl1008.90003
- ATAMTURK, A., RAJAN, D., On Splittable and Unsplittable Flow Capacitated Network Desing Arc-Set Polyhedra, Mathematical Programming, 92 (2002), 315-333. Zbl1094.90005
- BALAKRISHNAN, A., MAGNANTI, T.L., MIRCHANDANI, P., Network Design, capitolo 18 in Annotated Bibliographies in Combinatorial Optimization Dell'Amico M., Maffioli F., Martello S. (Eds.). John Wiley & Sons (1997), 311-334. Zbl1068.90503
- BARAHONA, F., Network Design Using Cut Inequalities, SIAM J. Optim, 6 (1996), 823-837. Zbl0856.90112
- BIENSTOCK, D., CHOPRA, S., GÜNLÜK, O., TSAI, C., Minimum Cost Capacity Installation for Multicommodity Network Flows, Mathematical Programming, 81 (1998), 177-199. Zbl0922.90064
- CRAINIC, T.G., GENDREAU, M., FARVOLDEN, J.M., A Simplex-based Tabu Search for Capacitated Network Design, INFORMS Journal on Computing, 12(3) (2000), 223-236.
- HOLMBERG, K., YUAN, D., A Lagrangean Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem, Operations Research, 48(3) (2000), 461-481. Zbl1106.90381
- IRi, M., On an Extension of the Max-Flow Min-Cut Theorem to Multicommodity Flows, Journal of the Operations Research Society of Japan, 13 (1971), 129-135. Zbl0223.90010
- MAGNANTI, T.L., MIRCHANDANI, P., VACHANI, R., The Convex Hull of two Core Capacitated Network Design Problems, Mathematical Programming, 60 (1993), 233-250. 588 SARA MATTIA Zbl0788.90071
- ONAGA, K., KAKUSHO, O., On Feasibility Conditions of Multicommodity Flows in Network, IEEE Trans. Circuit Theory, 18(4) (1971), 425-429.
- STOER, M., DAHL, G., A Polyhedral Approach to Multicommodity Network Design, Numerische Mathematik, 68 (1994), 149-167. Zbl0809.65068
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.