On Direct Methods for Lexicographic Min-Max Optimization
From MaRDI portal
Publication:3600166
DOI10.1007/11751595_85zbMATH Open1172.90487OpenAlexW1834040419MaRDI QIDQ3600166FDOQ3600166
Authors: W. Ogryczak, Tomasz Śliwiński 
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
Recommendations
- Lexicographic optima in the multicriteria discrete optimization problem
- Lexicographic-lexicographical optimization problems with alternative criteria
- scientific article; zbMATH DE number 6123175
- scientific article; zbMATH DE number 1353833
- Some problems of lexicographical optimization with alternative criteria.
Cited In (13)
- A guide to formulating fairness in an optimization model
- On the lexicographic centre of multiple objective optimization
- Balanced flows for transshipment problems
- A lexicographic minimax approach to the vehicle routing problem with route balancing
- Semi-fair design of emergency service system with failing centers
- An optimization and simulation approach to emergency stations relocation
- Efficient incrementing heuristics for generalized \(p\)-location problems
- Security games over lexicographic orders
- An approximation algorithm for the facility location problem with lexicographic minimax objective
- Lexicographic local search and the \(p\)-center problem.
- Combining leximax fairness and efficiency in a mathematical programming model
- Fair optimization and networks: a survey
- Phragmén's voting methods and justified representation
This page was built for publication: On Direct Methods for Lexicographic Min-Max Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600166)
