Extended formulation for hop constrained distribution network configuration problems
From MaRDI portal
(Redirected from Publication:1681271)
Recommendations
- Connectivity-and-hop-constrained design of electricity distribution networks
- Hop-level flow formulation for the survivable network design with hop constraints problem
- Distance transformation for network design problems
- A formulation for a hop constrained survivable network design problem
- Multicommodity flow models for spanning trees with hop constraints
Cites work
- A note on ``Reducing the number of binary variables in cutting stock problems
- A survey of combinatorial optimization problems in multicast routing
- Connectivity-and-hop-constrained design of electricity distribution networks
- Extended formulations in combinatorial optimization
- General network design: a unified view of combined location and network design problems
- Hamilton Paths in Grid Graphs
- Hop constrained Steiner trees with multiple root nodes
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Modelling the hop constrained connected facility location problem on layered graphs
- New formulations and solution procedures for the hop constrained network design problem.
- On the capacitated concentrator location problem: a reformulation by discretization
- Optimizing over the first Chvátal closure
- Outline of an algorithm for integer solutions to linear programs
- Progress in presolving for mixed integer programming
- The network design problem with relays
- The Steiner tree problem with hop constraints
- 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
Cited in
(8)- Layered graph approaches for combinatorial optimization problems
- Methods to search for configurations of distribution networks
- Connectivity-and-hop-constrained design of electricity distribution networks
- Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
- Distance transformation for network design problems
- A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints
- A computational study on integer programming formulations for hop-constrained survivable network design
- Approximation algorithms for hop constrained and buy-at-bulk network design via hop constrained oblivious routing
This page was built for publication: Extended formulation for hop constrained distribution network configuration problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1681271)
