On Direct Methods for Lexicographic Min-Max Optimization
From MaRDI portal
Publication:3600166
DOI10.1007/11751595_85zbMath1172.90487OpenAlexW1834040419MaRDI QIDQ3600166
Tomasz Śliwiński, Włodzimierz Ogryczak
Publication date: 10 February 2009
Published in: Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11751595_85
Related Items (12)
On the lexicographic centre of multiple objective optimization ⋮ A guide to formulating fairness in an optimization model ⋮ Phragmén's voting methods and justified representation ⋮ Balanced flows for transshipment problems ⋮ An optimization and simulation approach to emergency stations relocation ⋮ A lexicographic minimax approach to the vehicle routing problem with route balancing ⋮ Semi-fair design of emergency service system with failing centers ⋮ Efficient incrementing heuristics for generalized \(p\)-location problems ⋮ Security games over lexicographic orders ⋮ Combining leximax fairness and efficiency in a mathematical programming model ⋮ An approximation algorithm for the facility location problem with lexicographic minimax objective ⋮ Fair optimization and networks: a survey
This page was built for publication: On Direct Methods for Lexicographic Min-Max Optimization
