The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
From MaRDI portal
Publication:4458720
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
Cites work
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- A new approach to the maximum-flow problem
- A note on the generalized Steiner tree polytope
- Class Steiner trees and VLSI-design
- Generalized spanning trees
- Matroids and the greedy algorithm
- Network flows. Theory, algorithms, and applications.
- On generalized minimum spanning trees
- On the facial structure of set packing polyhedra
- On the generalized minimum spanning tree problem
- On the spanning tree polyhedron
- TSPLIB—A Traveling Salesman Problem Library
- The class Steiner minimal tree problem: A lower bound and test problem generation
- The symmetric generalized traveling salesman polytope
Cited in
(25)- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- The prize-collecting generalized minimum spanning tree problem
- Continuous approximation formulas for location problems
- A tabu search heuristic for the generalized minimum spanning tree problem
- Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- Generalized network design polyhedra
- 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
- The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms
- A two-level metaheuristic for the all colors shortest path problem
- scientific article; zbMATH DE number 5621997 (Why is no real title available?)
- A two-level solution approach for solving the generalized minimum spanning tree problem
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- Improving on branch-and-cut algorithms for generalized minimum spanning trees
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
- scientific article; zbMATH DE number 2201897 (Why is no real title available?)
- scientific article; zbMATH DE number 2037815 (Why is no real title available?)
- The generalized minimum spanning tree: polyhedra and branch-and-cut
- scientific article; zbMATH DE number 5876375 (Why is no real title available?)
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
- scientific article; zbMATH DE number 2090612 (Why is no real title available?)
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
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)
