Computing leximin-optimal solutions in constraint networks-Reference-Cited by-同舟云学术

Computing leximin-optimal solutions in constraint networks

Published:2009-02 Issue:2 Volume:173 Page:343-364
ISSN:0004-3702
Container-title:Artificial Intelligence
language:en
Short-container-title:Artificial Intelligence

Author:

Bouveret Sylvain,Lemaître Michel

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference49 articles.

1. Auctions for the safe, efficient and equitable allocation of airspace system resources;Ball,2006

2. N. Beldiceanu, M. Carlsson, Revisiting the cardinality operator and introducing cardinality-path constraint family, in: Proceedings of the 17th International Conference on Logic Programming (ICLP-01), Paphos, Cyprus, 2001

3. Constraint propagation;Bessière,2006

4. C. Bessière, E. Hebrard, B. Hnich, Z. Kiziltan, T. Walsh, SLIDE: A useful special case of the CARDPATH Constraint, in: Proceedings of the 18th European Conference on Artificial Intelligence (ECAI-08), Patras, Greece, 2008

5. Narrowing a block of sortings in quadratic time;Bleuzen-Guernalec,1997

Cited by 33 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A lexicographic maximin approach to the selective assessment routing problem;OR Spectrum;2022-07-13

2. Minimising inequality in multiagent resource allocation;Annals of Mathematics and Artificial Intelligence;2022-03-23

3. A Bi-Objective Field-Visit Planning Problem for Rapid Needs Assessment under Travel-Time Uncertainty;Sustainability;2022-03-04

4. Exact lexicographic scheduling and approximate rescheduling;European Journal of Operational Research;2021-04

5. On Solving the Multi-Objective Software Package Upgradability Problem;Research Anthology on Usage and Development of Open Source Software;2021