On the lexicographic minimax approach to location problems

DOI10.1016/S0377-2217(96)00154-3zbMath0921.90106OpenAlexW2007208809MaRDI QIDQ1278138

Włodzimierz Ogryczak

Publication date: 18 May 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00154-3

zbMATH Keywords

efficiencylocation problemsmultiple criteriaequityPareto-optimalitylexicographic minimax solutionminimax solution concept

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

Equitable aggregations and multiple criteria analysis ⋮ On the lexicographic centre of multiple objective optimization ⋮ Computing leximin-optimal solutions in constraint networks ⋮ Ordered median problem with demand distribution weights ⋮ Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria ⋮ Proportional and maxmin fairness for the sensor location problem with chance constraints ⋮ Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands ⋮ A lexicographic maximin approach to the selective assessment routing problem ⋮ Phragmén's voting methods and justified representation ⋮ Extensions of dynamic programming for multi-stage combinatorial optimization ⋮ Fair resource allocation for different scenarios of demands ⋮ A game-theoretic optimisation approach to fair customer allocation in oligopolies ⋮ Optimality conditions for distributive justice ⋮ Equitable bandwidth allocation in content distribution networks ⋮ Balanced flows for transshipment problems ⋮ A multicriteria facility location model for municipal solid waste management in North Greece ⋮ Lexicographicα-robustness: an application to the 1-median problem ⋮ Multiple criteria facility location problems: a survey ⋮ Exact lexicographic scheduling and approximate rescheduling ⋮ A lexicographic minimax approach to the vehicle routing problem with route balancing ⋮ An Approximative Lexicographic Min-Max Approach to the Discrete Facility Location Problem ⋮ A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane ⋮ On solving linear programs with the ordered weighted averaging objective. ⋮ Inequality measures and equitable locations ⋮ Geometric methods to solve max-ordering location problems ⋮ Inequality measures and equitable approaches to location problems ⋮ Editorial. Fair optimization and networks: models, algorithms, and applications ⋮ An approximation algorithm for the facility location problem with lexicographic minimax objective ⋮ Fair optimization and networks: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reducibility of minimax to minisum 0-1 programming problems
• Lexicographic bottleneck problems
• A lexicographic minimax algorithm for multiperiod resource allocation
• The general nucleolus and the reduced game property
• Lexicographic optimality in the multiple objective linear programming: The nucleolar solution
• Equity measurement in facility location analysis: A review and framework
• Multiobjective analysis of facility location decisions
• The Nucleolus of a Matrix Game and Other Nucleoli
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• The Nucleolus of a Characteristic Function Game

This page was built for publication: On the lexicographic minimax approach to location problems