Approximating airports and railways
From MaRDI portal
Publication:3304099
Recommendations
- Airports and railways: facility location meets network design
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Approximation algorithms for a facility location problem with service capacities
- Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
- Automata, Languages and Programming
Cites work
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Airports and railways: facility location meets network design
- Approximation Algorithms for Problems Combining Facility Location and Network Design
- Approximation algorithms for a facility location problem with service capacities
- Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
- Approximation schemes for capacitated geometric network design
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Network flows. Theory, algorithms, and applications.
- New approximation algorithms for the unsplittable capacitated facility location problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Cited in
(3)
This page was built for publication: Approximating airports and railways
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304099)