A parallel lagrangian relaxation algorithm for the min-degree constrained minimum spanning tree problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7422 LNCS, Issue , 2012, Pages 237-248

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

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

Author keywords

Lagrangian Relaxation; Local Branching; Min Degree Constrained Minimum Spanning Tree Problem; Parallel Programming

Indexed keywords

CONSTRAINED MINIMUM SPANNING TREE; LAGRANGIAN DUAL; LAGRANGIAN HEURISTICS; LAGRANGIAN RELAXATION; LINEAR PROGRAMMING SOLVERS; LOCAL BRANCHING; LOWER BOUNDS; MINIMUM COST SPANNING TREE; POSITIVE INTEGER D; SUBGRADIENT METHODS; UPPER AND LOWER BOUNDS; WEIGHTED UNDIRECTED GRAPH;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; PARALLEL PROGRAMMING;

LAGRANGE MULTIPLIERS;

EID: 84865272907     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32147-4_22     Document Type: Conference Paper

References (14)

1. Akgún, I., Tansel, B.C.: Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints. Computers and Operations Research 37(1), 72-82 (2010)
2. Almeida, A.M., Martins, P., de Souza, M.C.: Min-Degree Constrained Minimum Spanning Tree Problem: Complexity, proprieties and formulations. Centro de Investigação Operacional, Universidade de Lisboa (June 2006)
3. Almeida, A.M., Martins, P., de Souza, M.C.: md-MST is NP-hard for d ≥ 3. Electronic Notes in Discrete Mathematics 36, 9-15 (2010)
4. Beasley, J.E.: Lagrangean Relaxation. In: Modern Heuristic Techniques, Collin Reeves. Blackwell Scientific Press, Oxford (1993)
5. Camerini, P.M., Fratta, L., Maffioli, F.: On improving relaxation methods by modified gradient techniques. Mathematical Programming Study 3, 26-34 (1975)
6. Fischetti, M., Lodi, A.: Local branching. In: Mathematical Programming, vol. 98, pp. 23-47. Springer, Heidelberg (2003)
7. Gouveia, L., Telhada, J.: The multi-weighted Steiner Tree problem: A reformulation by intersection. Computers and Operations Research 35, 3599-3611 (2008)
8. Kruskal, J.B.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. American Mathematical Society 7, 48-50 (1956)
9. Magnanti, T.L., Wolsey, L.: Optimal Trees. In: Handbooks in OR and MS, vol. 7, pp. 503-615. North-Holland (1995)
10. Martinez, L.C., da Cunha, A.S.: Finding Min-degree Constrained Spanning Trees faster with a Branch-and-cut algorithm. Electronic Notes in Discrete Mathematics 36, 311-318 (2010)
11. Martinez, L.C., da Cunha, A.S.: The Min-Degree Constrained Minimum Spanning Tree Problem: Formulations and Branch-and-cut algorithm. Discrete Applied Mathematics (2011) (in press), doi:10.1016/j.dam.2011.08.008
12. Martins, P., de Souza, M.C.: VNS and second order heuristics for the min-degree constrained minimum spanning tree problem. Computers and Operations Research 36(11), 2669-2982 (2009)
13. Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulations and travelling salesman problems. Journal of the Association of Computing Machinery 7, 326-329 (1960)
14. OpenMp Architecture Review Board, http://www.openmp.org