Projections of the capacitated network loading problem

European Journal of Operational Research

Volumn 122, Issue 3, 2000, Pages 534-560

  Mirchandani, Prakash ^a  

^a UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; INTEGER PROGRAMMING; PROBLEM SOLVING;

CAPACITATED NETWORK DESIGNS; MULTICOMMODITY FLOW;

OPERATIONS RESEARCH;

EID: 0033908229     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00083-1     Document Type: Article

References (26)

1. Balas E., Ceria S., Cornuéjols G. A lift- and project-cutting plane algorithm for mixed 0-1 programs. Mathematical Programming. 58:1993;295-324.
2. Balas E., Pulleyblank E. The perfectly matchable subgraph polytope of a bipartite graph. Networks. 13:1983;486-516.
3. Balas E., Pulleyblank W. The perfectly matchable subgraph polytope of an arbitrary graph. Combinatorica. 9:1989;321-337.
4. Ball, M.O., Liu W.G., Pulleyblank, W.R., 1987. Two terminal Steiner tree polyhedra. Working paper series MS/S 87-021, University of Maryland, MD, 1987.
5. Barany I., Van Roy T.J., Wolsey L.A. Strong formulations for multi-item capacitated lot-sizing. Management Science. 30:1984;1256-1261.
6. Goemans M.X. The Steiner tree polytope and related polyhedra. Mathematical Programming. 63:1994;15-182.
7. Hu T.C. Multicommodity network flows. Operations research. 11:1966;344-360.
8. Iri M. On an extension of the maximum-flow minimum-cut theorem to multicommodity flows. Journal of Operations Research Society of Japan. 13:1971;129-135.
9. Lomonosov, M.V., 1978. On the systems of flows in a network. Probl. Per. Inf. 14 (1978) 60-73 (in Russian); English Translation: Problems of Inf. Transmission 14 pp. 280-290.
10. Lomonosov, M.V., 1978. On the systems of flows in a network. Probl. Per. Inf. 14 (1978) 60-73 (in Russian); English Translation: Problems of Inf. Transmission 14 pp. 280-290.
11. Lovász, L., Schrijver, A., 1898. Projections of Polyhedra and Matrix Cuts. Seminar (May 1989), MIT, Cambridge, MA.
12. Magnanti T.L., Mirchandani P., Vachani R. Modeling and solving the two-facility capacitated network loading problem. Operations Research. 43:1995;142-157.
13. Magnanti T.L., Mirchandani P. Shortest paths, network design and associated polyhedra. Networks. 23:1993;103-121.
14. Magnanti T.L., Mirchandani P., Vachani R. The convex hull of two core capacitated network design problems. Mathematical Programming. 60:1993;233-250.
15. Mirchandani, P., 1989. Polyhedral structure of the capacitated network design problem with an application to the telecommunication industry. Unpublished Ph.D. Dissertation, MIT, Cambridge, MA.
16. Pulleyblank, W.R., 1989. Polyhedral Combinatorics. In: Nemhauser G.L. (Ed.), Optimization. Handbooks in Operations Research and Management Science, vol. 1, North-Holland, New York, pp. 529-572.
17. Okamura H., Seymour P.D. Multicommodity flows in planar graphs. Journal of Combinatorial Theory (B). 31:1981;75-81.
18. Papernov, B.A., 1976. Feasibility of multicommodity flows. In: Fridman, A.A. (Ed.), Studies in discrete optimization. Idzat. "Nauka", Moscow, pp. 230-261 (in Russian).
19. Pochet Y., Wolsey L.A. Lot-size models with backlogging: strong reformulations and cutting planes. Mathematical Programming. 40:1988;317-335.
20. Schrijver, A., 1982. Min-max results in combinatorial optimization. In: Bachem, A. (Ed.), Mathematical programming - The state of the art, Springer, New York, pp. 439-500.
21. Seymour P.D. Four terminus flows. Networks. 10:1980;79-86.
22. Seymour P.D. Matroids and multicommodity flows. European Journal of Combinatorics. 2:1981;257-290.
23. Sherali H., Adams W. A hierarchy of relaxations and convex hull representations for zero-one programming problems. SIAM Journal of Discrete Mathematics. 3:1990;411-430.
24. VandeVate J.H. The path set polytope of an acyclic, directed graph with an application to machine scheduling. Networks. 5:1989;607-614.
25. Wolsey, L.A., 1988. Uncapacitated lot-sizing problems with start-up costs. CORE, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.
26. Wolsey L.A. Strong formulations for mixed-integer programming: A survey. Mathematical Programming B. 45:1989;173-191.