Extended formulation for hop constrained distribution network configuration problems
From MaRDI portal
Publication:1681271
DOI10.1016/j.ejor.2017.08.017zbMath1374.90082OpenAlexW2745506364MaRDI QIDQ1681271
Bernard Fortz, Jérôme de Boeck
Publication date: 23 November 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01665624/file/MMPrev1.1.pdf
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (2)
Layered graph approaches for combinatorial optimization problems ⋮ A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Hop constrained Steiner trees with multiple root nodes
- Connectivity-and-hop-constrained design of electricity distribution networks
- The network design problem with relays
- Optimizing over the first Chvátal closure
- Progress in presolving for mixed integer programming
- The Steiner tree problem with hop constraints
- New formulations and solution procedures for the hop constrained network design problem.
- General network design: a unified view of combined location and network design problems
- A survey of combinatorial optimization problems in multicast routing
- A note on ``Reducing the number of binary variables in cutting stock problems
- On the capacitated concentrator location problem: a reformulation by discretization
- Outline of an algorithm for integer solutions to linear programs
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Hamilton Paths in Grid Graphs
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Extended formulations in combinatorial optimization
This page was built for publication: Extended formulation for hop constrained distribution network configuration problems
