New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints

DOI10.1016/J.COR.2010.05.003MaRDI QIDQ709141zbMATH OpenOpenAlexFDO

Authors İbrahim Akgün

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

zbMATH Keywords

spanning treesnetwork flowsinteger programminghop constraintsMiller-Tucker-Zemlin constraints

Mathematics Subject Classification ID

Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• On formulations and methods for the hop-constrained minimum spanning tree problem
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

Cites work

• scientific article; zbMATH DE number 3943559 (Why is no real title available?)
• scientific article; zbMATH DE number 4010182 (Why is no real title available?)
• scientific article; zbMATH DE number 731844 (Why is no real title available?)
• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
• An analytical comparison of different formulations of the travelling salesman problem
• Design of Survivable Networks: A survey
• 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
• Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
• Modeling and solving the rooted distance-constrained minimum spanning tree problem
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
• Multicommodity flow models for spanning trees with hop constraints
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Network flows. Theory, algorithms, and applications.
• New formulations and solution procedures for the hop constrained network design problem.
• On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
• On formulations and methods for the hop-constrained minimum spanning tree problem
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Packet Routing in Telecommunication Networks with Path and Flow Restrictions
• Solution of a Large-Scale Traveling-Salesman Problem
• The 2-hop spanning tree problem
• The Steiner tree problem
• The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• Using a Hop-Constrained Model to Generate Alternative Communication Network Design
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints

Cited in

(12)

• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
• A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints
• Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
• On solving bi-objective constrained minimum spanning tree problems
• On formulations and methods for the hop-constrained minimum spanning tree problem
• Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
• Finding bounded diameter minimum spanning tree in general graphs
• 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
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
• scientific article; zbMATH DE number 1420487 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709141)