Computing leximin-optimal solutions in constraint networks

DOI10.1016/j.artint.2008.10.010zbMath1178.90301OpenAlexW2009648484MaRDI QIDQ835811

Sylvain Bouveret, Michel Lemaître

Publication date: 31 August 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2008.10.010

zbMATH Keywords

fairnessmultiobjective optimizationconstraint programmingleximin

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach ⋮ Filtering algorithms for the multiset ordering constraint ⋮ Computing leximin-optimal solutions in constraint networks ⋮ Constrained global optimization for wine blending ⋮ Leximax minimum solution of addition-min fuzzy relation inequalities ⋮ A lexicographic maximin approach to the selective assessment routing problem ⋮ Exact lexicographic scheduling and approximate rescheduling ⋮ A lexicographic minimax approach to the vehicle routing problem with route balancing

Uses Software

• Choco
• SLIDE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient bounds consistency algorithm for the global cardinality constraint
• Filtering algorithms for the multiset ordering constraint
• Computing leximin-optimal solutions in constraint networks
• Principles and practice of constraint programming -- CP 2005. 11th international conference, CP 2005, Sitges, Spain, October 1--5, 2005. Proceedings
• The general nucleolus and the reduced game property
• Constraint satisfaction using constraint logic programming
• On the lexicographic minimax approach to location problems
• On the analytic representation of the Leximin ordering and its application to flexible constraint propagation
• Computing improved optimal solutions to max-min flexible constraint satisfaction problems
• A permutation-based approach for solving the job-shop problem
• Multicriteria optimization
• On solving linear programs with the ordered weighted averaging objective.
• Networks of constraints: Fundamental properties and applications to picture processing
• Optimal narrowing of a block of sortings in optimal time
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• The Nucleolus of a Matrix Game and Other Nucleoli
• Equity and the Informational Basis of Collective Choice
• On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
• Principles and Practice of Constraint Programming – CP 2003
• Algorithm for optimal winner determination in combinatorial auctions