The Generalized Minimum Spanning Tree Problem: Polyhedral Analysis and Branch-and-Cut Algorithm

Networks

Volumn 43, Issue 2, 2004, Pages 71-86

  Feremans, Corinne ^a,b   Labbé, Martine ^a   Laporte, Gilbert ^c  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b MAASTRICHT UNIVERSITY   (Netherlands)

^c Ecl Hautes Etud Comml ^*  (Canada)

Author keywords

Branch and cut algorithm; Generalized minimum spanning tree; Network design; Polyhedral analysis; Tabu search heuristic; Telecommunications

Indexed keywords

ALGORITHMS; CARRIER COMMUNICATION; LINEAR PROGRAMMING; NUMERICAL METHODS; RANDOM PROCESSES; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

BRANCH AND CUT ALGORITHM; GENERALIZED MINIMUM SPANNING TREE; LINEAR PROGRAMMING FORMULATION; NETWORK DESIGN; POLYHEDRAL ANALYSIS; TABU SEARCH HEURISTIC;

PROBLEM SOLVING;

EID: 2042512359     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10105     Document Type: Article

References (26)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms, and applications, Prentice-Hall, Engle-wood Cliffs, NJ, 1993.
2. S. Chopra, On the spanning tree polyhedron, Oper Res Lett 8 (1989), 25-29.
3. M. Dror, M. Haouari, and J. Chaouachi, Generalized spanning trees, Eur J Oper Res 120 (2000), 583-592.
4. J. Edmonds, "Submodular functions, matroids and certain polyhedra," Combinatorial structures and their applications, Gordon and Breach, London, 1970.
5. J. Edmonds, Matroids and the greedy algorithm, Math Program 1 (1971), 127-136.
6. U. Faigle, W. Kern, P.C. Pop, and G. Still, The generalized minimum spanning tree problem, Working paper, Department of Operations Research and Mathematical Programming, University of Twente, 2000, http://www.math.utwente. nl/dos/ormp/preprints.htm.
7. C. Feremans, M. Labbé, and G. Laporte, On generalized minimum spanning trees, Eur J Oper Res 134 (2001), 457-458.
8. C. Feremans, M. Labbé, and G. Laporte, A comparative analysis of several formulations for the generalized minimum spanning tree problem, Networks 39 (2002), 29-34.
9. M. Fischetti, J.J. Salazar, and P. Toth, The symmetric generalized traveling salesman polytope, Networks 26 (1995), 113-123.
10. M. Fischetti, J.J. Salazar, and P. Toth, A branch-and-cut algorithm for the symmetric generalized traveling salesman problem, Oper Res 45 (1997), 378-394.
11. P. Gillard and B. Yang, The class Steiner minimal tree problem: A lower bound and test problem generation, Acta Info 37 (2000), 193-211.
12. A.V. Goldberg and R.E. Tarjan, A new approach to the maximum flow problem, J Assoc Comput Mach 35 (1988), 921-940.
13. B. Golden, S. Raghavan, and D. Stanojević, Heuristic search for the generalized minimum spanning tree problem, Working paper, Robert H. Smith School of Business, University of Maryland, 2003.
14. M. Grötschel and O. Holland, Solution of large-scale symmetric traveling salesman problems, Math Program 51 (1991), 141-202.
15. M. Grötschel, L. Lovász, and A. Schrijver, Geometric algorithms and combinatorial optimization, Springer-Verlag, Berlin, 1988.
16. E. Ihler, G. Reich, and P. Widmayer, Class Steiner trees and VLSI-design, Discr Appl Math 90 (1999), 173-194.
17. ILOG CPLEX 7.0, 2000.
18. T.L. Magnanti and L.A. Wolsey, Optimal trees, Handbooks in Operations Research and Management Science, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Editors), Elsevier, Amsterdam, 1995, Vol. 7, Chapter 9, pp. 503-615.
19. Y.S. Myung, C.H. Lee, and D.W. Tcha, On the generalized minimum spanning tree problem, Networks 26 (1995), 231-241.
20. M. Padberg, On the facial structure of set packing polyhedra, Math Program 5 (1973), 199-215.
21. P.C. Pop, W. Kern, and G.J. Still, An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size, Working paper, Departement of Operations Research and Mathematical Programming, University of Twente, 2001, http://www.math.utwente.nl/dos/ormp/preprints.htm.
22. G. Reinelt, TSPLIB - A traveling salesman problem library, ORSA J Comput 3 (1991), 376-384.
23. J.J. Salazar, A note on the generalized Steiner tree polytope, Discr Appl Math 100 (2000), 137-144.
24. S. Thienel, ABACUS, A branch-and-cut system, Ph.D. dissertation, Universität zu Köln, 1995.
25. Universität zu Köln and Universität Heidelberg, OREAS (Optimization Research and Software), ABACUS, A Branch-And-CUt System, Version 2.3, User's Guide and Reference Manual, Köln, 1999.
26. H.P. Williams, Model solving in mathematical programming, Wiley, Chichester, 1992.