On formulations and methods for the hop-constrained minimum spanning tree problem
From MaRDI portal
Recommendations
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
Cited in
(32)- Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem
- Container shipping service selection and cargo routing with transshipment limits
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach
- A polyhedral study of the diameter constrained minimum spanning tree problem
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- Stronger column generation bounds for the minimum cost hop-and-root constrained forest problem
- An exact algorithm for the Steiner tree problem with delays
- Optimal relay node placement in delay constrained wireless sensor network design
- Hop constrained Steiner trees with multiple root nodes
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
- Optimal network design with end-to-end service requirements
- scientific article; zbMATH DE number 1420487 (Why is no real title available?)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- A complete characterization of jump inequalities for the hop-constrained shortest path problem
- On Hop-Constrained Steiner Trees in Tree-Like Metrics
- 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
- The cable trench problem: Combining the shortest path and minimum spanning tree problems
- A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints
- Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
- Network design with vulnerability constraints and probabilistic edge reliability
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
- Characterization of facets of the hop constrained chain polytope via dynamic programming
- Routing of uncertain traffic demands
- Combined route capacity and route length models for unit demand vehicle routing problems
This page was built for publication: On formulations and methods for the hop-constrained minimum spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5294063)
