Experience with a cutting plane algorithm for the capacitated spanning tree problem

INFORMS Journal on Computing

Volumn 8, Issue 3, 1996, Pages 219-234

  Hall, Leslie ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Cutting plane algorithms; Integer programming; Network design

Indexed keywords

EID: 0000102449     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.8.3.219     Document Type: Article

References (14)

1. A. AMBERG, W. DOMSCHKE, and S. VOSS, 1995. Capacitated Minimum Spanning Trees: Algorithms Using Intelligent Search, Working paper.
2. J.R. ARAQUE G., 1989. Solution of a 48-City Vehicle Routing Problem by Branch-and-Cut, Unpublished manuscript, Department of Applied Mathematics and Statistics, SUNY at Stony Brook, NY.
3. J.R. ARAQUE G., L.A. HALL, and T.L. MAGNANTI, 1990. Capacitated Trees, Capacitated Routing, and Associated Polyhedra, Technical report SOR-90-12, Program in Statistics and Operations Research, Princeton University, Princeton, NJ.
4. J.E. BEASLEY, 1990. OR-Library: Distributing Test Problems by Electronic Mail, Journal of the Operational Research Society 41, 1069-1072.
5. D. BIENSTOCK, Q. DENG, and D. SIMCHI-LEVI, 1994. A Branch-and-Cut Algorithm for the Capacitated Minimum Spanning Tree Problem, Unpublished manuscript.
6. C. BOUSBA and L.A. WOLSEY, 1991. Finding Minimum Cost Directed Trees with Demands and Capacities, in J. MacGregor Smith and P. Winter (eds.), Annals of Operations Research, Volume 33: Topological Network Design, J.C. Baltzer, Basel, 285-303.
7. K.M. CHANDY and T. LO, 1973. The Capacitated Minimal Spanning Tree, Networks 3, 173-182.
8. K.M. CHANDY and R.A. RUSSEL, 1972. The Design of Multipoint Linkages in a Teleprocessing Tree Network, IEEE Transactions on Computers C-21, 1062-1066.
9. N. CHRISTOFIDES, A. MINGOZZI, P. TOTH, and C. SANDI (EDS.), 1979. Combinatorial Optimization, Wiley and Sons, New York.
10. G. CORNUÉJOLS and F. MARCHE, 1993. Polyhedral Study of the Capacitated Vehicle Routing Problem, Mathematical Programming 60, 21-52.
11. H. CROWDER, E. JOHNSON, and M. PADBERG, 1983. Solving Large-Scale Zero-One Linear Programming Problems, Operations Research 31, 803-834.
12. H.P. CROWDER and M.W. PADBERG, 1980. Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality, Management Science 26, 495-509.
13. S. EILON, C.D.T. WATSON-GANDY, and N. CHRISTOFIDES, 1971. Distribution Management: Mathematical Modelling and Practical Analysis, Hafner, New York, 240 pages.
14. D. ELIAS and M.J. FERGUSON. Topological Design of Multipoint Teleprocessing Networks, IEEE Transactions on Communications Com-22, 1753-1762.