Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
From MaRDI portal
(Redirected from Publication:337245)
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
Cites work
- scientific article; zbMATH DE number 3900494 (Why is no real title available?)
- scientific article; zbMATH DE number 3557512 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- 0-1 reformulations of the multicommodity capacitated network design problem
- A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- Backbone Network Design Tools with Economic Tradeoffs
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Hop-constrained node survivable network design: An application to MPLS over WDM
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- Multicommodity flow models for spanning trees with hop constraints
- Notes on polyhedra associated with hop-constrained paths
- On formulations and methods for the hop-constrained minimum spanning tree problem
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the directed hop-constrained shortest path problem
- Routing Through Virtual Paths in Layered Telecommunication Networks
- The Steiner tree problem with hop constraints
- The simple plant location problem: Survey and synthesis
- 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
(13)- A combined capacity scaling and local branching matheuristic for the hop-constrained multicommodity network design problem
- The transit time constrained fixed charge multi-commodity network design problem
- Design of survivable networks with vulnerability constraints
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- On two new formulations for the fixed charge network design problem with shortest path constraints
- A computational study on integer programming formulations for hop-constrained survivable network design
- An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
- 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
- scientific article; zbMATH DE number 1063799 (Why is no real title available?)
- 0-1 reformulations of the multicommodity capacitated network design problem
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Revisiting Lagrangian relaxation for network design
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)
