Network design using cut inequalities

SIAM Journal on Optimization

Volumn 6, Issue 3, 1996, Pages 823-837

  Barahona, Francisco ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Cut condition; Network loading problem

Indexed keywords

EID: 0030303863     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623494279134     Document Type: Article

References (25)

1. F. BARAHONA, Separating from the dominant of the spanning tree polytope, Oper. Res. Lett., 12 (1992), pp. 201-204.
2. _, Magnetization of ground states of Ising spin glasses, Phys. Rev. B (3), 49 (1994), pp. 12864-12867.
3. F. BARAHONA, M. GRÖTSCHEL, M. JÜNGER, AND G. REINELT, An application of combinatorial optimization to statistical physics and circuit layout design, Oper. Res., 36 (1988), pp. 493-513.
4. F. BARAHONA AND E. MACCIONI, On the exact ground-states of three-dimensional Ising spin glasses, J. Phys. A, 15 (1982), pp. L611-L615.
5. F. BARAHONA AND A. R. MAHJOUB, On 2-connected subgraph polytopes, Discrete Math., 147 (1995), pp. 19-34.
6. D. BIENSTOCK AND O. GÜNLÜK, Capacitated Network Design-Polyhedral Structure and Computation, Tech. report, Columbia University, New York, 1994.
7. _, Computational experience with a difficult multicommodity flow problem, Math. Programming, 68 (1995), pp. 213-237.
8. R. S. CAHN, P. CHANG, P. KERMANI, AND A. KERSHENBAUM, A Study of Network Clustering Algorithms, Research report RC 16046, IBM T. J. Watson Research Center, Yorktown Heights, NY, 1990.
9. _, INTREPID: An integrated network tool for routing, evaluation of performance, and interactive design, IEEE Communications Magazine, 29 (1991), pp. 40-47.
10. S. CHOPRA, On the spanning tree polyhedron, Oper. Res. Lett., 8 (1989), pp. 25-29.
11. IBM CORPORATION, Optimization subroutine library: Guide and reference, 1991.
12. J. EDMONDS, Submodular functions, matroids, and certain polyhedra, in Combinatorial Structures and their Applications, R. K. Guy, E. Milner, and N. Sauer, eds., Gordon and Breach, New York, 1970, pp. 69-87.
13. B. GAVISH AND K. ALTINKEMER, Backbone network design tools with economic tradeoffs, ORSA J. Comput., 2 (1990), pp. 236-252.
14. R. E. GOMORY AND T. C. HU, Multi-terminal networks flows, J. SIAM, 9 (1961), pp. 551-570.
15. M. GRÖTSCHEL, C. L. MONMA, AND M. STOER, Facets for polyhedra arising in the design of communication networks with low-connectivity constraints, SIAM J. Optim., 2 (1992), pp. 474-504.
16. T. C. HU, Optimum communication spanning trees, SIAM J. Comput., 3 (1974), pp. 188-195.
17. M. JÜNGER AND W. R. PULLEYBLANK, New Primal and Dual Matching Heuristics, Report 91.105, Institut für Informatik, Universität zu Köln, 1991.
18. A. KERSHENBAUM, Telecomunications Network Design Algorithms, McGraw-Hill, New York, 1993.
19. A. KERSHENBAUM, P. KERMANI. AND G. A. GROVER, MENTOR: An algorithm for mesh network topological optimization and routing, IEEE Trans. Comm., 39 (1991), pp. 503-513.
20. T. L. MAGNANTI, P. MIRCHANDANI, AND R. VACHANI, Modeling and solving the capacitated network loading problem, Oper. Res., 43 (1995), pp. P142-157.
21. _, The convex hull of two core capacitated network design problems, Math. Programming, 60 (1993), pp. 233-250.
22. C. S. J. A. NASH-WILLIAMS, Edge-disjoint spanning trees of finite graphs, J. London Math. Soc., 36 (1961), pp. 445-450.
23. C. C. PALMER AND A. KERSHENBAUM, Representing Trees in Genetic Algorithms, Research report RC 19718, IBM T. J. Watson Research Center, Yorktown Heights, NY, 1994.
24. M. W. P. SAVELSBERGH AND G. L. NEMHAUSER, Functional Description of MINTO, A Mixed Integer Optimizer, Tech. report, Georgia Institute of Technology, School of Industrial and Systems Engineering, Atlanta, GA, 1993.
25. W. T. TUTTE, On the problem of decomposing a graph into n connected factors, J. London Math. Soc., 36 (1961), pp. 221-230.