A branch and cut method for the degree-constrained minimum spanning tree problem

Networks

Volumn 37, Issue 2, 2001, Pages 74-83

  Caccetta, L ^a   Hill, S P ^a  

^a School of Mathematics and Statistics   (Australia)

Author keywords

Branch and cut; Combinatorial optimization; Mixed integer linear programming; Network design; Optimal trees

Indexed keywords

EID: 0035286016     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200103)37:2<74::AID-NET2>3.0.CO;2-E     Document Type: Article

References (21)

1. [1] N.R. Achuthan, L. Caccetta, and S.P. Hill, A new subtour elimination constraint for the vehicle routing problem, Eur J Oper Res 91 (1995), 573-586.
2. [2] N.R. Achuthan, L. Caccetta, and S.P. Hill, An improved branch and cut algorithm for the capacitated vehicle routing problem, submitted for publication.
3. [3] D. Applegate, R. Bixby, V. Chvatal, and W. Cook, On the solution of travelling salesman problems, Doc Math (J Deutsch Mathe-Vereinigung) Int Congr Math (1998), 645-656.
4. [4] P. Augerat, J.M. Belengeur, E. Benavent, A. Corberan, N. Naddef, and G. Rinaldi, Computational results with a branch and cut code for the capacitated vehicle routing problem, Research Report 949-M, Universite Joseph Fourier, Grenoble, France, 1995.
5. [5] L. Caccetta, "Graph theory in network design and analysis," Recent studies in graph theory, V.R. Kulli (Editor), Vishwa International, India, 1989, pp. 29-63.
6. [6] L. Caccetta, B.K. Gan, and S.P. Hill, Heuristics for the degree restricted spanning tree problem, submitted for publication.
7. [7] N. Christofides, A. Mingozzi, and P. Toth, Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, Math Program 20 (1981), 255-282.
8. [8] CPLEX Optimization Inc., Using the CPLEX Callable Library and CPLEX Mixed Integer Library, 930 Tahoe Blvd # 802-297, Incline Village, NV 89451, 1993.
9. [9] E.W. Dijkstra, A note on two problems in connection with graphs, Num Math 1 (1959), 269-271.
10. [10] H.N. Gabow, Z. Gabil, T. Spencer, and R.E. Tarjan, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs, Combinatorica 6(2) (1986), 109-122.
11. [11] M.R. Garey and D.S. Johnson, Computers and interactibility, A guide to the theory of NP-completeness, Freeman, San Francisco, 1979.
12. [12] B. Gavish, Topological design of centralised computer networks - Formulation and algorithms, Networks 12 (1982), 355-377.
13. [13] S.P. Hill, Branch and cut methods for the symmetric capacitated vehicle routing, PhD Thesis, Curtin University of Technology, Perth, Western Australia, 1995.
14. [14] J.B. Kruskal, On the shortest spanning subtree of a graph and the travelling salesman problem, Proc Am Math Soc 7 (1956), 48-50.
15. [15] G. Laporte, Y. Norbert, and M. Desrochers, Optimal routing under capacity and distance restrictions, Oper Res 33 (1985), 1050-1073.
16. [16] S.C. Narula and C.A. Ho, Degree-constrained minimum spanning tree, Comput Oper Res 7 (1980), 239-249.
17. [17] M. Padberg and G. Rinaldi, A branch and cut algorithm for the resolution of large scale travelling salesman problems, SIAM Rev 33 (1991), 60-100.
18. [18] R.C. Prim, Shortest connection networks and some generalizations, BSTJ 36 (1957), 1389-1401.
19. [19] M. Savelsbergh and A. Volgenant, Edge exchange in the degree-constrained minimum spanning tree problem, Comput Oper Res 12 (1985), 341-348.
20. [20] A. Volgenant, A Lagrangean approach to the degree-constrained minimum spanning tree problem, Eur J Oper Res 39 (1989), 325-331.
21. [21] A. Volgenant and R. Jonker, The symmetric travelling salesman problem and edge exchanges in minimal 1-trees, Eur J Oper Res 12 (1983), 394-403.