Airports and railways: facility location meets network design

DOI10.4230/LIPICS.STACS.2016.6MaRDI QIDQ4601855zbMATH OpenOpenAlexFDO

Authors Anna Adamaszek, Antonios Foivos Antoniadis, Tobias Mömke

Publication date 24 January 2018

Full work available at URL http://dx.doi.org/10.4230/LIPIcs.STACS.2016.6

zbMATH Keywords

approximation algorithmsfacility locationnetwork designPTASgeometric approximation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Recommendations

• Approximating airports and railways
• Locating depots for capacitated vehicle routing
• Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
• Locating depots for capacitated vehicle routing
• Eulerian location problems

Cited in

(2)

• Approximating airports and railways
• Airports and railways with unsplittable demand

This page was built for publication: Airports and railways: facility location meets network design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601855)