A multi-exchange local search algorithm for the capacitated facility location problem

DOI10.1007/978-3-540-25960-2_17MaRDI QIDQ5712455zbMATH OpenOpenAlexFDO

Authors Bo Chen, Yinyu Ye, Jiawei Zhang

Publication date 23 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b97946

zbMATH Keywords

approximation algorithmcapacitated facility locationlocal search algorithm

Mathematics Subject Classification ID

Search theory (90B40) Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59)

Cited in

(13)

• From stars to comets: improved local search for universal facility location
• An approximation algorithm for a facility location problem with stochastic demands and inventories
• New approximation algorithms for the unsplittable capacitated facility location problem
• Integrality gaps for strengthened linear relaxations of capacitated facility location
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
• Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning
• On Min-Max r-Gatherings
• A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
• AI 2005: Advances in Artificial Intelligence
• On min-max \(r\)-gatherings
• Local search algorithms for the red-blue median problem
• Improved approximation algorithm for capacitated facility location with uniform facility cost
• Approximation algorithms for facility location problems with a special class of subadditive cost functions

This page was built for publication: A multi-exchange local search algorithm for the capacitated facility location problem

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