Noname manuscript No. (will be inserted by the editor) On the Weber facility location problem with limited distances and side constraints Isaac F. Fernandes · Daniel Aloise ·

Source URL: www.lix.polytechnique.fr

Robust Facility Location Problem for Hazardous Waste Transportation Paul G. Berglund Operations Research Analyst, IEOR, Norfolk Southern Corporation, Atlanta, GA Changhyun Kwon∗

Source URL: www.chkwon.net

PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡

Source URL: users.eecs.northwestern.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• NP-complete problems
• Operations research
• Approximation algorithms
• Combinatorial optimization
• Set cover problem
• Linear programming relaxation
• Greedy algorithm
• Facility location problem
• Reduction

Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen  Department of Mathematical Sciences Johns Hopkins University Baltimore, MD 21218

Source URL: www.cs.tufts.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• NP-complete problems
• Operations research
• Set cover problem
• Approximation algorithm
• Facility location problem
• Dominating set
• Combinatorial optimization
• Reduction
• Algorithm

Approximation Algorithms for Single and Multi-Commodity Connected Facility Location Fabrizio Grandoni & Thomas Rothvoß Department of Mathematics, M.I.T.

Source URL: www.math.washington.edu

• NP-complete problems
• Approximation algorithms
• Operations research
• Facility location problem
• Combinatorial optimization
• Steiner tree problem
• APX
• Draft:Sub-linear time algorithm
• Planar separator theorem

Enabling E-Mobility: Facility Location for Battery Loading Stations Sabine Storandt Stefan Funke Albert-Ludwigs-Universit¨at Freiburg

Source URL: ad-publications.informatik.uni-freiburg.de

• NP-complete problems
• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Edsger W. Dijkstra
• Dominating set
• A* search algorithm
• Optimization problem
• Minimum spanning tree
• Shortest path problem
• Treewidth
• Flow network

Approximating Connected Facility Location Problems via Random Facility Sampling and Core Detouring Thomas Rothvoß Institute of Mathematics ´

Source URL: www.math.washington.edu

• NP-complete problems
• Operations research
• Approximation algorithms
• Steiner tree problem
• Facility location problem
• APX
• Approximation

Approximation Algorithms for Single and Multi-Commodity Connected Facility Location Fabrizio Grandoni1 and Thomas Rothvoß2 1

Source URL: www.math.washington.edu

• Computational complexity theory
• Operations research
• Facility location problem
• Steiner tree problem
• Shortest path problem
• Approximation algorithm
• Low-rank approximation

Facility Location Problem for Emergency and On-Demand Transportation Systems Burak Boyacı Nikolas Geroliminis STRC 2012

Source URL: www.strc.ch

• Probability theory
• Stochastic processes
• Economy
• Business
• Rho
• Queueing theory
• Server

Chapter 8 Facility Location The Metric Facility Location problem was popular in operations research in the 1960s but no constant factor approximation algorithms were known untilThe discovery of these is due to LP

Source URL: www2.informatik.hu-berlin.de