Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem

Networks

Volumn 59, Issue 1, 2012, Pages 148-160

  Uchoa, Eduardo ^a   Toffolo, Túlio A M ^b   De Souza, Mauricio C ^c   Martins, Alexandre X ^b   Fukasawa, Ricardo ^d  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b FEDERAL UNIVERSITY OF OURO PRETO   (Brazil)

^c FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^d UNIVERSITY OF WATERLOO   (Canada)

Author keywords

branch and cut; fenchel cuts; MIP based local search; network design

Indexed keywords

BRANCH-AND-CUT; BRANCH-AND-CUT ALGORITHMS; CAPACITATED MINIMUM SPANNING TREE PROBLEM; COMPUTATIONAL EXPERIMENT; FENCHEL CUTS; HIGH QUALITY; LOCAL SEARCH; LOWER BOUNDS; MULTI-LEVEL; NETWORK DESIGN; NUMERICAL RESULTS; OPTIMALITY; POSSIBLE SOLUTIONS; SUB-PROBLEMS; UPPER BOUND;

ALGORITHMS; OPTIMIZATION; PARALLEL ARCHITECTURES; SEPARATION;

DECISION TREES;

EID: 83555173593     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20485     Document Type: Article

References (25)

1. R. K. Ahuja, J. B. Orlin, and, D. Sharma, Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem, Math Prog 91 (2001), 71-97. (Pubitemid 33758908)
2. R. K. Ahuja, J. B. Orlin, and, D. Sharma, A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem, Oper Res Lett 31 (2003), 185-194.
3. A. Amberg, W. Domschke, and, S. Voss, Capacitated minimum spanning tree: Algorithms using intelligent search, Comb Optim Theory Pract 1 (1996), 9-40.
4. D. Applegate, R. Bixby, V. Chvátal, and, W. Cook, "TSP cuts which do not conform to the template paradigm", Computational combinatorial optimization, Springer, Berlin, 2001, pp. 261-303.
5. P. Avella, M. Boccia, and, I. Vasilyev, A computational study of exact knapsack separation for the generalized assignment problem, Comput Optim Appl 45 (2010), 543-555.
6. E. A. Boyd, Generating Fenchel cutting planes for knapsack polyhedra, SIAM J Optim 3 (1993), 734-750.
7. E. A. Boyd, Fenchel cutting planes for integer programs, Oper Res 41 (1994), 53-64.
8. S. Dash, R. Fukasawa, and, O. Günlük, On a generalization of the master cyclic group polyhedron, Math Prog 125 (2010), 1-30.
9. L. R. Esau, and, K. C. Williams, On teleprocessing system design, IBM Syst J 5 (1966), 142-147.
10. P. Festa, and, M. G. C. Resende, An annotated bibliography of GRASP. Part II: Applications, Int Trans Oper Res 16 (2009), 131-172.
11. R. Fukasawa, and, M. Goycoolea, On the exact separation of mixed-integer knapsack cuts, Math Prog 128 (2011), 19-41.
12. I. Gamvros, B. L. Golden, and, S. Raghavan, The multi-level capacitated minimum spanning tree, INFORMS J Comput 18 (2006), 348-365. (Pubitemid 44371776)
13. I. Gamvros, S. Raghavan, and, B. L. Golden, "An evolutionary approach for the multi-level capacitated minimum spanning tree", Telecommunications network design and management, G. Anandalingam, and, S. Raghavan, (Editors), Kluwer Academic Publishers, 2003, pp. 99-124.
14. L. Gouveia, A 2n formulation for the capacitated minimal spanning tree problem, Oper Res 43 (1995), 130-141.
15. L. Gouveia, and, P. Martins, A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem, Networks 35 (2000), 1-16.
16. L. Gouveia, and, P. Martins, The capacitated minimum spanning tree problem: revisiting hop-indexed formulations, Comput Oper Res 32 (2005), 2435-2452. (Pubitemid 40114323)
17. L. Hall, Experience with a cutting plane approach for the capacitated spanning tree problem, INFORMS J Comput 8 (1996), 219-234. (Pubitemid 126681513)
18. P. Martins, Enhanced second order algorithm applied to the capacitated minimum spanning tree problem, Comput Oper Res 34 (2007), 2495-2519. (Pubitemid 46073436)
19. A. X. Martins, M. C. de Souza, M. J. F. Souza, and, T. A. M. Toffolo, GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem, J Heuristics 15 (2009), 133-151.
20. M. Ramos, Solving capacitated facility location problems by Fenchel cutting planes, J Oper Res Soc 56 (2005), 297-306. (Pubitemid 40359699)
21. H. Santos, E. Uchoa, L. Ochi, and, N. Maculan, Strong bounds with cut and column generation for class-teacher timetabling, Ann Oper Res, online first since 18 Feb 2010.
22. Y. Sharaiha, M. Gendreau, G. Laporte, and, I. Osman, A tabu search algorithm for the capacitated shortest spanning tree problem, Networks 29 (1997), 161-171. (Pubitemid 127362102)
23. M. C. de Souza, C. Duhamel, and, C. C. Ribeiro, "A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy", Metaheuristics: computer decision-making, M. G. C. Resende, and, J. P. De Sousa, (Editors), Kluwer Academic Publishers, Norwell, MA, 2003, pp. 627-657.
24. E. Uchoa, R. Fukasawa, J. Lysgaard, A. Pessoa, M. Poggi de Aragão, and, D. Andrade, Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation, Math Prog 112 (2008), 443-472. (Pubitemid 350202448)
25. S. Voss, "Capacitated minimum spanning trees", Encyclopedia of optimization, Vol. 1, C. A. Floudas, and, P. M. Pardalos, (Editors), Springer, Berline, 2008, pp. 225-235.