Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
DOI10.1016/J.COR.2014.07.013zbMATH Open1348.90608OpenAlexW2002184897MaRDI QIDQ337245FDOQ337245
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
Recommendations
- Multicommodity flow models for spanning trees with hop constraints
- A combined capacity scaling and local branching matheuristic for the hop-constrained multicommodity network design problem
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- Revisiting Lagrangian relaxation for network design
- LP extreme points and cuts for the fixed-charge network design problem
Lagrangean relaxationformulationsnonbifurcated hop-constrained multicommodity network design problemrelaxations
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- On the Complexity of Timetable and Multicommodity Flow Problems
- The Steiner tree problem with hop 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
- 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 simple plant location problem: Survey and synthesis
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Notes on polyhedra associated with hop-constrained paths
- 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
- On the directed hop-constrained shortest path problem
- Title not available (Why is that?)
- Backbone Network Design Tools with Economic Tradeoffs
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Title not available (Why is that?)
- 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
Cited In (10)
- Revisiting Lagrangian relaxation for network design
- An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- Title not available (Why is that?)
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- 0-1 reformulations of the multicommodity capacitated network design problem
- A computational study on integer programming formulations for hop-constrained survivable network design
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Design of survivable networks with vulnerability constraints
This page was built for publication: Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337245)
