A polyhedral approach to the generalized minimum labeling spanning tree problem

DOI10.1007/s13675-018-0099-5zbMath1431.90128OpenAlexW2806976001MaRDI QIDQ2329708

Luiz Satoru Ochi, Serigne Gueye, Thiago Gouveia da Silva, Philippe Yves Paul Michelon, Lucidio dos Anjos Formiga Cabral

Publication date: 18 October 2019

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-018-0099-5

zbMATH Keywords

spanning treefacetspolyhedral studyedge-labeled graph

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (1)

Finding minimum label spanning trees using cross‐entropy method

Cites Work

• Solving the minimum label spanning tree problem by mathematical programming techniques
• Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates
• A mixed integer linear formulation for the minimum label spanning tree problem
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• The minimum labeling spanning trees
• On the minimum label spanning tree problem
• Local search for the minimum label spanning tree problem with bounded color classes.
• A note on the minimum label spanning tree.
• Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem

This page was built for publication: A polyhedral approach to the generalized minimum labeling spanning tree problem