A polyhedral approach to the generalized minimum labeling spanning tree problem

DOI10.1007/S13675-018-0099-5MaRDI QIDQ2329708zbMATH OpenOpenAlexFDO

Authors Thiago Gouveia da Silva, Serigne Gueye, Luiz S. Ochi, Philippe Michelon, Lucidio dos Anjos Formiga Cabral

Publication date 18 October 2019

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

edge-labeled graphfacetspolyhedral studyspanning tree

Mathematics Subject Classification ID

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

Recommendations

• A hybrid metaheuristic for the minimum labeling spanning tree problem
• A mixed integer linear formulation for the minimum label spanning tree problem
• The minimum labeling spanning trees
• New models of the generalized minimum spanning tree problem
• scientific article; zbMATH DE number 1788251

Cites work

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

Cited in

(10)

• A mixed integer linear formulation for the minimum label spanning tree problem
• A hybrid metaheuristic for the minimum labeling spanning tree problem
• Local search for the minimum label spanning tree problem with bounded color classes.
• Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
• On the bicriterion - minimal cost/minimal label - spanning tree problem
• Polyhedral studies for minimum‐span graph labelling with integer distance constraints
• Finding minimum label spanning trees using cross‐entropy method
• Solving the minimum label spanning tree problem by mathematical programming techniques
• Solving the minimum labeling global cut problem by mathematical programming
• Solving a k-node minimum label spanning arborescence problem to compress fingerprint templates

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329708)