An Approximative Lexicographic Min-Max Approach to the Discrete Facility Location Problem

DOI10.1007/978-3-319-28697-6_11zbMath1342.90089OpenAlexW2340634996MaRDI QIDQ2806896

L'uboš Buzna, Michal Koháni, Jaroslav Janáček

Publication date: 19 May 2016

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_11

zbMATH Keywords

min-max approachdiscrete facility location

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Discrete location and assignment (90B80)

Uses Software

• TSPLIB

Cites Work

• On the lexicographic minimax approach to location problems
• A column generation approach to capacitated \(p\)-median problems
• Solving Large p-Median Problems with a Radius Formulation

This page was built for publication: An Approximative Lexicographic Min-Max Approach to the Discrete Facility Location Problem