Distance transformation for network design problems
From MaRDI portal
Recommendations
- Strong formulations for network design problems with connectivity requirements
- Extended formulation for hop constrained distribution network configuration problems
- Hop-level flow formulation for the survivable network design with hop constraints problem
- Strong lower bounds for a survivable network design problem
- Strong Formulations for 2-Node-Connected Steiner Network Problems
Cites work
- A dual ascent approach for steiner tree problems on a directed graph
- A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
- A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems
- An integer linear programming approach to the steiner problem in graphs
- Hop constrained Steiner trees with multiple root nodes
- Hop-level flow formulation for the survivable network design with hop constraints problem
- Improved algorithms for the Steiner problem in networks
- Integer programming formulations for the two 4-hop-constrained paths problem
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Multicommodity flow models for spanning trees with hop constraints
- Strong formulations for network design problems with connectivity requirements
- Stronger MIP formulations for the Steiner forest problem
- The k edge-disjoint 3-hop-constrained paths polytope
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- The Steiner tree problem. II: Properties and classes of facets
- The two-level diameter constrained spanning tree problem
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
Cited in
(5)- Extended formulation for hop constrained distribution network configuration problems
- scientific article; zbMATH DE number 5669750 (Why is no real title available?)
- scientific article; zbMATH DE number 270113 (Why is no real title available?)
- Extended formulation and branch-and-cut-and-price algorithm for the two connected subgraph problem with disjunctive constraints
- Approximation algorithms for hop constrained and buy-at-bulk network design via hop constrained oblivious routing
This page was built for publication: Distance transformation for network design problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5231681)
