An approximative lexicographic MIN-MAX approach to the discrete facility location problem

DOI10.1007/978-3-319-28697-6_11zbMATH Open1342.90089OpenAlexW2340634996MaRDI QIDQ2806896FDOQ2806896

Authors: 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

Recommendations

• An approximation algorithm for the facility location problem with lexicographic minimax objective
• On the lexicographic minimax approach to location problems
• Site location with lexicographic minimization of three objectives
• A discretizing algorithm for location problems
• A bi-objective approach to discrete cost-bottleneck location problems

zbMATH Keywords

min-max approachdiscrete facility location

Mathematics Subject Classification ID

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

Cites Work

• A column generation approach to capacitated \(p\)-median problems
• On the lexicographic minimax approach to location problems
• Solving large \(p\)-median problems with a radius formulation

Uses Software

• TSPLIB

This page was built for publication: An approximative lexicographic MIN-MAX approach to the discrete facility location problem

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