Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm

Electronic Notes in Discrete Mathematics

Volumn 36, Issue C, 2010, Pages 311-318

  Conegundes Martinez, Leonardo ^a   da Cunha, Alexandre Salles ^a  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

Author keywords

Branch and cut; Min degree Constrained Minimum Spanning Tree Problem

Indexed keywords

EID: 77954951091     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2010.05.040     Document Type: Article

References (7)

1. Cunha A.S., Lucena A. Lower and upper bounds for the Degree-constrained Minimum Spanning Tree Problem. Networks 2007, 50:55-66.
2. A. M. de Almeida, P. Martins, and M.C. de Souza. "Min-Degree Constrained Minimum Spanning Tree Problem: Complexity, proprieties and formulations". Technical Report 6/2006, Centro de Investigação Operacional, Universidade de Lisboa, 2006.
3. Akgún I., Tansel B.C. Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints. Computers and Operations Research 2009, 10.1016/j.cor.2009.03.006.
4. Koch T., Martin A. Solving Steiner Tree Problems in Graphs to Optimality. Networks 1998, 32:207-232.
5. Magnanti T.L., Wolsey L. Optimal Trees. Handbooks in OR and MS 1995, vol. 7:503-615. North-Holland. O. Ball (Ed.).
6. Martins P., de Souza M.C. VNS and second order heuristics for the min-degree constrained minimum sp anning tree problem. Computers and Operations Research 2009, 36:2669-2982.
7. Narula S.C., Ho C.A. Degree-constrained minimum spanning tree. Computers and Operations Research 1980, 7:239-249.