Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems
From MaRDI portal
Publication:2971170
DOI10.1007/978-3-319-51741-4_16zbMath1484.68333OpenAlexW2568965545MaRDI QIDQ2971170
Felix J. L. Willamowski, Andreas Bley
Publication date: 4 April 2017
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-51741-4_16
Stochastic programming (90C15) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Approximation Algorithms for Problems Combining Facility Location and Network Design
- Capacitated arc routing problems
- Local Search Heuristics for k-Median and Facility Location Problems
- Analytical approach to parallel repetition
- Improved Combinatorial Algorithms for Facility Location Problems
- Steiner Tree Approximation via Iterative Randomized Rounding
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Integer Programming and Combinatorial Optimization
This page was built for publication: Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems
