Airports and railways with unsplittable demand
From MaRDI portal
Publication:6663529
DOI10.1016/j.ipl.2024.106538MaRDI QIDQ6663529
Shamisa Nematollahi, Hossein Jowhari
Publication date: 14 January 2025
Published in: Information Processing Letters (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- New approximation algorithms for the unsplittable capacitated facility location problem
- An approximation algorithm for the generalized assignment problem
- Approximation algorithms for the multiple knapsack problem with assignment restrictions
- Flexible allocation on related machines with assignment restrictions
- The truck dispatching problem
- Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
- Assignment problem in content distribution networks
- Approximating Airports and Railways
- Bounds and Heuristics for Capacitated Routing Problems
- Analysis of a Local Search Heuristic for Facility Location Problems
- Airports and Railways: Facility Location Meets Network Design
- A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering
- Paths, Trees, and Flowers
- Maximum matching and a polyhedron with 0,1-vertices
- Improving the approximation ratio for capacitated vehicle routing
- A PTAS for Capacitated Vehicle Routing on Trees
This page was built for publication: Airports and railways with unsplittable demand
