Solving the minimum label spanning tree problem by mathematical programming techniques
DOI10.1155/2011/143732zbMATH Open1236.90134OpenAlexW2001366300WikidataQ58655016 ScholiaQ58655016MaRDI QIDQ666399FDOQ666399
Authors: Andreas M. Chwatal, Günther R. Raidl 
Publication date: 8 March 2012
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2011/143732
Recommendations
- A mixed integer linear formulation for the minimum label spanning tree problem
- A polyhedral approach to the generalized minimum labeling spanning tree problem
- The minimum labeling spanning trees
- On the minimum label spanning tree problem
- An efficient mixed integer linear programming model for the minimum spanning tree problem
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cites Work
- Integer Programming Formulation of Traveling Salesman Problems
- Solving matching problems with linear programming
- Title not available (Why is that?)
- On the minimum label spanning tree problem
- On implementing the push-relabel method for the maximum flow problem
- On the 0,1 facets of the set covering polytope
- Title not available (Why is that?)
- The minimum labeling spanning trees
- Variable neighbourhood search for the minimum labelling Steiner tree problem
- Local search for the minimum label spanning tree problem with bounded color classes.
- Obtaining optimal \(k\)-cardinality trees fast
- Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
- 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
- A note on the minimum label spanning tree.
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates
Cited In (10)
- An improved flow-based formulation and reduction principles for the minimum connectivity inference problem
- An efficient mixed integer linear programming model for the minimum spanning tree problem
- A hybrid metaheuristic for the minimum labeling spanning tree problem
- On the shared transportation problem: computational hardness and exact approach
- Complexity and approximation results on the shared transportation problem
- Finding minimum label spanning trees using cross‐entropy method
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- A polyhedral approach to the generalized minimum labeling spanning tree problem
- A mixed integer linear formulation for the minimum label spanning tree problem
Uses Software
This page was built for publication: Solving the minimum label spanning tree problem by mathematical programming techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666399)
