The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
From MaRDI portal
Publication:496663
DOI10.1016/J.DAM.2011.08.008zbMATH Open1321.05046OpenAlexW1981354702MaRDI QIDQ496663FDOQ496663
Authors: Leonardo Conegundes Martinez, Alexandre Salles da Cunha 
Publication date: 22 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.08.008
Recommendations
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
combinatorial optimizationbranch-and-cutinteger programming formulationsmin-degree constrained minimum spanning tree problem
Trees (05C05) Combinatorial optimization (90C27) Extremal problems in graph theory (05C35) Integer programming (90C10)
Cites Work
- Solving Steiner tree problems in graphs to optimality
- On the shortest spanning subtree of a graph and the traveling salesman problem
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
- md-MST is NP-hard for \(d\geq 3\)
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
- Integer Programming Formulation of Traveling Salesman Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
- A Lagrangean approach to the degree-constrained minimum spanning tree problem
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Strong lower bounds for the prize collecting Steiner problem in graphs
- Using Lagrangian dual information to generate degree constrained spanning trees
- A branch and cut method for the degree-constrained minimum spanning tree problem
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- Trees and Cuts
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Topological design of centralized computer networks—formulations and algorithms
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
- Variable neighborhood search
- Title not available (Why is that?)
- Lagrangean relaxation. (With comments and rejoinder).
- The multi-weighted Steiner tree problem: A reformulation by intersection
- Title not available (Why is that?)
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Edge exchanges in the degree-constrained minimum spanning tree problem
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
- Reformulation by intersection method on the MST problem with lower bound on the number of leaves
Cited In (24)
- Reformulation by intersection method on the MST problem with lower bound on the number of leaves
- A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem
- New genetic algorithm approach for the MIN-degree constrained minimum spanning tree
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
- The cable trench problem: Combining the shortest path and minimum spanning tree problems
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
- A branch and bound algorithm for the capacitated minimum spanning tree problem
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
- The generalized dependency constrained spanning tree problem
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
- An exact and heuristic approach for the \(d\)-minimum branch vertices problem
- Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem
- A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem
- Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
- A branch and cut method for the degree-constrained minimum spanning tree problem
- A unifying model for locally constrained spanning tree problems
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
- On solving bi-objective constrained minimum spanning tree problems
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- A parallel Lagrangian relaxation algorithm for the min-degree constrained minimum spanning tree problem
- A branch and cut algorithm for minimum spanning trees under conflict constraints
Uses Software
This page was built for publication: The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496663)
