New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
From MaRDI portal
Publication:709141
DOI10.1016/j.cor.2010.05.003zbMath1231.90363OpenAlexW1965140713MaRDI QIDQ709141
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.05.003
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Finding bounded diameter minimum spanning tree in general graphs ⋮ On solving bi-objective constrained minimum spanning tree problems ⋮ Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
- An analytical comparison of different formulations of the travelling salesman problem
- The Steiner tree problem
- Multicommodity flow models for spanning trees with hop constraints
- The 2-hop spanning tree problem
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- New formulations and solution procedures for the hop constrained network design problem.
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- Integer Programming Formulation of Traveling Salesman Problems
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Packet Routing in Telecommunication Networks with Path and Flow Restrictions
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- Design of Survivable Networks: A survey
- Solution of a Large-Scale Traveling-Salesman Problem
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
This page was built for publication: New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
