Approximation Algorithms for Generalized Plant Location

DOI10.1007/978-3-642-40313-2_69MaRDI QIDQ2849962zbMATH OpenOpenAlexFDO

Authors Alexander Souza

Publication date 20 September 2013

Published in Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40313-2_69

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Recommendations

• A plant location guide for the unsure: approximation algorithms for min-Max location problems
• Fast bounding procedures for large instances of the simple plant location problem
• scientific article; zbMATH DE number 1670526
• Approximation algorithms for the capacitated plant allocation problem
• scientific article; zbMATH DE number 4010185
• On the exact solution of large-scale simple plant location problems
• A separation algorithm for the simple plant location problem
• Approximation algorithms for bounded facility location problems
• scientific article; zbMATH DE number 1559542
• An aggressive reduction scheme for the simple plant location problem

Cited in

(1)

• scientific article; zbMATH DE number 1823835 (Why is no real title available?)

This page was built for publication: Approximation Algorithms for Generalized Plant Location

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