A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem

DOI10.1007/978-3-642-32147-4_22zbMath1370.90280OpenAlexW79941410MaRDI 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

zbMATH Keywords

Lagrangian relaxationparallel programminglocal branchingmin-degree constrained minimum spanning tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (2)

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

This page was built for publication: A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem