Referenze Bibliografiche
[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