Il problema dell'allocazione di capacità su rete
Mattia, Sara
Bollettino dell'Unione Matematica Italiana, Tome 8-A (2005), p. 585-588 / Harvested from Biblioteca Digitale Italiana di Matematica
Access to full text
Full (PDF)
Full (DjVu)
Publié le : 2005-12-01
@article{BUMI_2005_8_8A_3-1_585_0,
     author = {Sara Mattia},
     title = { Il problema dell'allocazione di capacit\`a su rete},
     journal = {Bollettino dell'Unione Matematica Italiana},
     volume = {8-A},
     year = {2005},
     pages = {585-588},
     language = {it},
     url = {http://dml.mathdoc.fr/item/BUMI_2005_8_8A_3-1_585_0}
}

Mattia, Sara.  Il problema dell'allocazione di capacità su rete. Bollettino dell'Unione Matematica Italiana, Tome 8-A (2005) pp. 585-588. http://gdmltest.u-ga.fr/item/BUMI_2005_8_8A_3-1_585_0/

[1] Ahuja, R.K., Magnanti, T.L., Orlin, J.B., Network Flows. Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, New Jersey (1993). | Zbl 1201.90001

[2] Atamturk, A., On Capacitated Network Desing Cut-Set Polyhedra, Mathematical Programming Ser. B, 92 (2002), 425-437. | Zbl 1008.90003

[3] Atamturk, A., Rajan, D., On Splittable and Unsplittable Flow Capacitated Network Desing Arc-Set Polyhedra, Mathematical Programming, 92 (2002), 315-333. | Zbl 1094.90005

[4] 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. | Zbl 1068.90503

[5] Barahona, F., Network Design Using Cut Inequalities, SIAM J. Optim, 6 (1996), 823-837. | Zbl 0856.90112

[6] Bienstock, D., Chopra, S., Günlük, O., Tsai, C., Minimum Cost Capacity Installation for Multicommodity Network Flows, Mathematical Programming, 81 (1998), 177-199. | Zbl 0922.90064

[7] 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.

[8] 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. | Zbl 1106.90381

[9] 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. | Zbl 0223.90010

[10] 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 | Zbl 0788.90071

[11] Onaga, K., Kakusho, O., On Feasibility Conditions of Multicommodity Flows in Network, IEEE Trans. Circuit Theory, 18(4) (1971), 425-429.

[12] Stoer, M., Dahl, G., A Polyhedral Approach to Multicommodity Network Design, Numerische Mathematik, 68 (1994), 149-167. | Zbl 0809.65068