The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
From MaRDI portal
(Redirected from Publication:496663)
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
Cites work
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Lagrangean approach to the degree-constrained minimum spanning tree problem
- A branch and cut method for the degree-constrained minimum spanning tree problem
- Edge exchanges in the degree-constrained minimum spanning tree problem
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Integer Programming Formulation of Traveling Salesman Problems
- Lagrangean relaxation. (With comments and rejoinder).
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Reformulation by intersection method on the MST problem with lower bound on the number of leaves
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
- Solving Steiner tree problems in graphs to optimality
- Strong lower bounds for the prize collecting Steiner problem in graphs
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The multi-weighted Steiner tree problem: A reformulation by intersection
- Topological design of centralized computer networks—formulations and algorithms
- Trees and Cuts
- Using Lagrangian dual information to generate degree constrained spanning trees
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
- Variable neighborhood search
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- md-MST is NP-hard for \(d\geq 3\)
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
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
- New genetic algorithm approach for the MIN-degree constrained minimum spanning tree
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
- The cable trench problem: Combining the shortest path and minimum spanning tree problems
- 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
- A branch and cut method for the degree-constrained minimum spanning tree problem
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
- 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
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- On solving bi-objective constrained minimum spanning tree problems
- 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
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)
