Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
From MaRDI portal
(Redirected from Publication:733522)
Recommendations
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- A Lagrangean approach to the degree-constrained minimum spanning tree problem
- A branch and cut method for the degree-constrained minimum spanning tree problem
- An analytical comparison of different formulations of the travelling salesman problem
- Comparison of algorithms for the degree constrained minimum spanning tree
- Edge exchanges in the degree-constrained minimum spanning tree problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Integer Programming Formulation of Traveling Salesman Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Network flows. Theory, algorithms, and applications.
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
- On the shortest spanning subtree of a graph and the traveling salesman problem
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- Using Lagrangian dual information to generate degree constrained spanning trees
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
Cited in
(17)- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem
- 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
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
- The generalized dependency constrained spanning tree problem
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
- Exact solution approaches for the multi-period degree constrained minimum spanning tree problem
- An exact and heuristic approach for the d-minimum branch vertices problem
- On the weight-constrained minimum spanning tree problem
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
- Lower and upper bounds for the spanning tree with minimum branch vertices
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
- A strong symmetric formulation for the min-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
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
This page was built for publication: Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733522)
