The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
DOI10.1002/NET.10105zbMATH Open1069.68114OpenAlexW2167459401MaRDI QIDQ4458720FDOQ4458720
Martine Labbé, G. Laporte, Corinne Feremans
Publication date: 15 March 2004
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10105
Recommendations
- The generalized minimum spanning tree: polyhedra and branch-and-cut
- On the generalized minimum spanning tree problem
- New models of the generalized minimum spanning tree problem
- Improving on branch-and-cut algorithms for generalized minimum spanning trees
- Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
network designtelecommunicationsbranch-and-cut algorithmpolyhedral analysistabu search heuristicgeneralized minimum spanning tree
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)
Cites Work
- Title not available (Why is that?)
- TSPLIB—A Traveling Salesman Problem Library
- The symmetric generalized traveling salesman polytope
- On the facial structure of set packing polyhedra
- A new approach to the maximum-flow problem
- Class Steiner trees and VLSI-design
- Generalized spanning trees
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- On the generalized minimum spanning tree problem
- Matroids and the greedy algorithm
- On generalized minimum spanning trees
- On the spanning tree polyhedron
- A note on the generalized Steiner tree polytope
- The class Steiner minimal tree problem: A lower bound and test problem generation
Cited In (22)
- The generalized minimum spanning tree: polyhedra and branch-and-cut
- A two-level metaheuristic for the all colors shortest path problem
- Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
- Title not available (Why is that?)
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
- Title not available (Why is that?)
- The generalized minimum branch vertices problem: properties and polyhedral analysis
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- Title not available (Why is that?)
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
- A two-level solution approach for solving the generalized minimum spanning tree problem
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
- Title not available (Why is that?)
- Continuous approximation formulas for location problems
- A tabu search heuristic for the generalized minimum spanning tree problem
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- Improving on branch-and-cut algorithms for generalized minimum spanning trees
- Title not available (Why is that?)
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- The prize-collecting generalized minimum spanning tree problem
- Generalized network design polyhedra
Uses Software
This page was built for publication: The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458720)
