An approximation algorithm for the facility location problem with lexicographic minimax objective

DOI10.1155/2014/562373zbMath1442.90114OpenAlexW2170115558WikidataQ59053536 ScholiaQ59053536MaRDI QIDQ2336537

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

Publication date: 19 November 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/562373

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

Robust facility location in reverse logistics ⋮ Semi-fair design of emergency service system with failing centers ⋮ Fair optimization and networks: a survey

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The impact of client choice on preventive healthcare facility network design
• Foundations of location analysis
• Equitable service by a facility: minimizing the Gini coefficient
• The gravity \(p\)-median model
• To be fair or efficient or a bit of both
• Multiple criteria facility location problems: a survey
• Inequality measures and equitable locations
• Optimal location with equitable loads
• Reducibility of minimax to minisum 0-1 programming problems
• On the lexicographic minimax approach to location problems
• Geometric methods to solve max-ordering location problems
• Equity measurement in facility location analysis: A review and framework
• The traveling salesman. Computational solutions for RSP applications
• The mathematics of internet congestion control
• A column generation approach to capacitated \(p\)-median problems
• The minimum equitable radius location problem with continuous demand
• Max-min fairness in multi-commodity flows
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
• Solving Large p-Median Problems with a Radius Formulation
• The Price of Fairness
• Rate control for communication networks: shadow prices, proportional fairness and stability
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• On Direct Methods for Lexicographic Min-Max Optimization
• Optimal flows in networks with multiple sources and sinks
• A good algorithm for lexicographically optimal flows in multi-terminal networks
• On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems