Airports and railways with unsplittable demand
From MaRDI portal
(Redirected from Publication:6663529)
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cites work
- A fast (2 + 2/7)-approximation algorithm for capacitated cycle covering
- A PTAS for Capacitated Vehicle Routing on Trees
- Airports and railways: facility location meets network design
- An approximation algorithm for the generalized assignment problem
- Analysis of a Local Search Heuristic for Facility Location Problems
- Approximating airports and railways
- Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
- Approximation algorithms for the multiple knapsack problem with assignment restrictions
- Assignment problem in content distribution networks, unsplittable hard-capacitated facility location
- Bounds and Heuristics for Capacitated Routing Problems
- Flexible allocation on related machines with assignment restrictions
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- Improving the approximation ratio for capacitated vehicle routing
- Maximum matching and a polyhedron with 0,1-vertices
- New approximation algorithms for the unsplittable capacitated facility location problem
- Paths, Trees, and Flowers
- The truck dispatching problem
This page was built for publication: Airports and railways with unsplittable demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663529)
