A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem
From MaRDI portal
Publication:3167628
DOI10.1007/978-3-642-32147-4_22zbMath1370.90280MaRDI QIDQ3167628
Alexandre Salles da Cunha, Leonardo Conegundes Martinez
Publication date: 2 November 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_22
Lagrangian relaxation; parallel programming; local branching; min-degree constrained minimum spanning tree problem
90C35: Programming involving graphs or networks
05C05: Trees
90C11: Mixed integer programming
90C59: Approximation methods and heuristics in mathematical programming
05C85: Graph algorithms (graph-theoretic aspects)
05C22: Signed and weighted graphs
Related Items
A strong symmetric formulation for the min-degree constrained minimum spanning tree problem, Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations