Exact approaches for designing multifacility buy-at-bulk networks
From MaRDI portal
Publication:5131690
Communication networks in operations research (90B18) Management decision making, including multiple objectives (90B50) Discrete location and assignment (90B80) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Approximation algorithms for a combined facility location buy-at-bulk network design problem
- A polyhedral study for the buy-at-bulk facility location problem
- LP-based approximation algorithms for facility location in buy-at-bulk network design
- LP-based approximation algorithms for facility location in buy-at-bulk network design
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
Cites work
- A constant factor approximation for the single sink edge installation problem
- A note on finding the bridges of a graph
- A stabilized structured Dantzig-Wolfe decomposition method
- Algorithm Theory - SWAT 2004
- Approximating the single-sink link-installation problem in network design
- Approximation algorithms for a capacitated network design problem
- Approximation Algorithms for Problems Combining Facility Location and Network Design
- Benders decomposition for local access network design with two technologies
- Decomposition Principle for Linear Programs
- Emergence of Scaling in Random Networks
- Exact approaches to the single-source network loading problem
- scientific article; zbMATH DE number 1757956 (Why is no real title available?)
- scientific article; zbMATH DE number 2086941 (Why is no real title available?)
- scientific article; zbMATH DE number 1445375 (Why is no real title available?)
- LP-based approximation algorithms for facility location in buy-at-bulk network design
- Network design via core detouring for problems without a core
- On cut-based inequalities for capacitated network design polyhedra
- On non-uniform multicommodity buy-at-bulk network design
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- SCIP: solving constraint integer programs
- Simpler and better approximation algorithms for network design
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- Solving the capacitated local access network design problem
Cited in
(2)
This page was built for publication: Exact approaches for designing multifacility buy-at-bulk networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131690)
