A mixed integer linear formulation for the minimum label spanning tree problem

DOI10.1016/j.cor.2009.02.003zbMath1162.90575OpenAlexW2051100691MaRDI QIDQ1025265

Marta M. B. Pascoal, Joao Carlos Namorado Climaco, Maria Eugénia Captivo

Publication date: 18 June 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.02.003

zbMATH Keywords

spanning treecolorlabelmixed integer formulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Deterministic network models in operations research (90B10)

Related Items (11)

Complexity and approximation results on the shared transportation problem ⋮ Carousel greedy: a generalized greedy algorithm with applications in optimization ⋮ On the bicriterion - minimal cost/minimal label - spanning tree problem ⋮ Improved approaches to solve the one-to-one skewgram problem ⋮ Finding minimum label spanning trees using cross‐entropy method ⋮ Solving the minimum label spanning tree problem by mathematical programming techniques ⋮ A hybrid metaheuristic for the minimum labeling spanning tree problem ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ OMEGA one multi ethnic genetic approach ⋮ A polyhedral approach to the generalized minimum labeling spanning tree problem ⋮ An exact reduction technique for the k-colour shortest path problem

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• The minimum labeling spanning trees
• On the minimum label spanning tree problem
• 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 mixed integer linear formulation for the minimum label spanning tree problem