Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
DOI10.1007/978-3-319-57586-5_11zbMATH Open1407.68209OpenAlexW2585261962MaRDI QIDQ5283361FDOQ5283361
Authors: Sascha Brauer 
Publication date: 21 July 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_11
Recommendations
- Complexity of single-swap heuristics for metric facility location and related problems
- Approximation Algorithms for Metric Facility Location Problems
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- A heuristic approach to the single facility maximin location problem
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- scientific article; zbMATH DE number 1947060
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
- scientific article; zbMATH DE number 1670526
- Approximation algorithms for multicommodity facility location problems
- scientific article; zbMATH DE number 1559542
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Least squares quantization in PCM
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Greedy Strikes Back: Improved Facility Location Algorithms
- Title not available (Why is that?)
- How easy is local search?
- \(k\)-means requires exponentially many iterations even in the plane
- Simple Local Search Problems that are Hard to Solve
- A new greedy approach for facility location problems
- Local Search Heuristics for k-Median and Facility Location Problems
- A local search approximation algorithm for \(k\)-means clustering
- The complexity of the simplex method
- On Simplex Pivoting Rules and Complexity Theory
- Local search: simple, successful, but sometimes sluggish
- The complexity of the \texttt{k-means} method
Cited In (1)
This page was built for publication: Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283361)
