Approximation algorithms for a capacitated network design problem
From MaRDI portal
Recommendations
- Publication:2753737
- Approximability of capacitated network design
- Approximability of capacitated network design
- Approximation Algorithms for a Network Design Problem
- Approximation algorithms for network design problems
- Approximation schemes for capacitated geometric network design
- Approximation schemes for capacitated geometric network design
- Approximation Algorithms for Network Design Problems on Bounded Subsets
- Approximation algorithms for prize-collecting capacitated network design problems
- Publication:4263723
Cited in
(38)- Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing
- A 2-approximation algorithm for the network substitution problem
- Approximating the \(k\)-splittable capacitated network design problem
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Approximating capacitated tree-routings in networks
- Complexity and Approximation of the Continuous Network Design Problem
- Algorithms and extended formulations for one and two facility network design
- scientific article; zbMATH DE number 1670539 (Why is no real title available?)
- Capacitated network design on undirected graphs
- On the approximation of the generalized capacitated tree-routing problem
- Approximation schemes for capacitated geometric network design
- Single-sink fractionally subadditive network design
- Approximation schemes for capacitated geometric network design
- On the approximability of some network design problems
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing
- Solving the capacitated local access network design problem
- A branch-and-cut algorithm for capacitated network design problems
- Algorithms for the non-bifurcated network design problem
- scientific article; zbMATH DE number 1003253 (Why is no real title available?)
- Risk based optimization of electronics manufacturing supply chains
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
- Network design with a discrete set of traffic matrices
- Approximating Capacitated Tree-Routings in Networks
- Approximation to the Minimum Cost Edge Installation Problem
- Exact approaches for designing multifacility buy-at-bulk networks
- Approximation Algorithms for a Network Design Problem
- scientific article; zbMATH DE number 4100921 (Why is no real title available?)
- On fixed cost \(k\)-flow problems
- Approximation algorithms for prize-collecting capacitated network design problems
- Approximating the Generalized Capacitated Tree-Routing Problem
- Improved approximation for fractionally subadditive network design
- Approximating the \(k\)-splittable capacitated network design problem
- On the approximability of some network design problems
- Approximating some network design problems with node costs
- Algorithms for a network design problem with crossing supermodular demands
- Automata, Languages and Programming
- An approximation algorithm for network design problems with downwards-monotone demand functions
This page was built for publication: Approximation algorithms for a capacitated network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879243)
