Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem

DOI10.1016/j.cor.2014.07.013zbMath1348.90608OpenAlexW2002184897MaRDI QIDQ337245

Jean-François Cordeau, Bernard Gendron, Babacar Thiongane

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.07.013

zbMATH Keywords

Lagrangean relaxationformulationsnonbifurcated hop-constrained multicommodity network design problemrelaxations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

Revisiting Lagrangian relaxation for network design, Design of survivable networks with vulnerability constraints

Cites Work

• 0-1 reformulations of the multicommodity capacitated network design problem
• Hop-constrained node survivable network design: An application to MPLS over WDM
• Multicommodity flow models for spanning trees with hop constraints
• The Steiner tree problem with hop constraints
• On the directed hop-constrained shortest path problem
• Notes on polyhedra associated with hop-constrained paths
• The simple plant location problem: Survey and synthesis
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• Backbone Network Design Tools with Economic Tradeoffs
• Using a Hop-Constrained Model to Generate Alternative Communication Network Design
• On the Complexity of Timetable and Multicommodity Flow Problems
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
• Routing Through Virtual Paths in Layered Telecommunication Networks
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
• 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
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item