Decision-support with preference constraints

European Journal of Operational Research

Volumn 177, Issue 3, 2007, Pages 1469-1494

  Joseph, Rémy Robert ^a   Chan, Peter ^b   Hiroux, Michael ^a,b   Weil, Georges ^a,b  

^a UNIV GRENOBLE ALPES   (France)

^b Equitime SA   (France)

Author keywords

Binary preference relation; Branch and bound; Combinatorial optimization; Compact representation of preferences; Constraint programming

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; DECISION MAKING; GENETIC ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING;

BINARY PREFERENCE RELATION; BRANCH-AND-BOUND; COMBINATORIAL OPTIMIZATION; COMPACT REPRESENTATION OF PREFERENCES; CONSTRAINT PROGRAMMING;

DECISION SUPPORT SYSTEMS;

EID: 33751219588     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.04.016     Document Type: Article

References (40)

1. N. Beldiceanu, Global constraints as graph properties on structured network of elementary constraints of the same type, Technical Report T2000-01, Swedish Institute of Computer Science, 2000. Reprinted in: Lecture Notes in Computer Science, vol. 1894, 2000, pp. 52-66.
2. Beldiceanu N., and Contejean E. Introducing global constraints in CHIP. Mathematical Computing and Modelling 20 12 (1994) 97-123
3. Bistarelli S., Montanari U., Rossi F., Schiex T., Verfaillie G., and et Fargier H. Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints: An International Journal 4 3 (1999) 199-240
4. Bouyssou D., Marchant T., Perny P., Pirlot M., Tsoukiàs A., and Vincke P. Evaluation and Decision Models: A Critical Perspective (2000), Kluwer Academic, Dordrecht Chapter 2
5. P. Chan, T. Zemmouri, G. Weil, Annualized multiple-skilled employee timetabling is a wicked problem, in: 14th Mini Euro Conference, HCP'2003, Luxembourg, 2003, pp. 31-32.
6. Cooper M.C. An optimal k-consistency algorithm. AI 41 (1989) 89-95
7. Corner J., Buchanan J., and Henig M. Dynamic decision problem structuring. Journal of Multi-Criteria Decision Analysis 10 (2001) 129-141
8. Ehrgott M., and Gandibleux X. An annotated bibliography of multiobjective combinatorial optimization. OR Spektrum 22 (2000) 425-460
9. Fodor J., and Roubens M. Fuzzy Preference Modelling and Multicriteria Decision Support (1994), Kluwer Academic, Dordrecht
10. Freuder E.C. A sufficient condition for backtrack-free search. Journal of the ACM 29 1 (1982) 24-32
11. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company, New York
12. M. Gavanelli, Interactive constraint satisfaction problems for artificial vision, Ph.D. thesis of the University of Ferrara, Italy, 2002.
13. M. Gavanelli, An implementation of Pareto optimality in CLP (FD), in: Proceedings of CP-AI-OR'02, 2002, pp. 49-64.
14. Ghoshal J., Laskar R., and Pillone D. Topics on domination in directed graphs. In: Haynes T., Hedetniemi S., and Slater P.J. (Eds). Domination in Graphs: Advanced Topics. coll. Monographs and Textbooks in Pure and Applied Mathematics vol. 209 (1998), Marcel Dekker, New York 401-437 Chapter 15
15. Jaulin L., Kieffer M., Didrit O., and Walter E. Applied Interval Analysis, with Examples in Parameter and State Estimation, Robust Control and Robotics (2001), Springer-Verlag
16. R.-R. Joseph, P. Chan, M. Hiroux, G. Weil, Preference Constraints: New global soft constraints dedicated to preference binary relations, in: Proceedings of the 2nd Workshop on Modelling and Reformulating Constraint Satisfaction Problems, CP'03, 2003, pp. 104-109.
17. Keeney R.L. Structuring objectives for problems of public interest. Operations Research 36 3 (1988) 396-405
18. Keeney R.L., and Raïffa H. Decisions with Multiple Objectives: Preferences and Value Tradeoffs (1976), John Wiley & Sons, New York
19. Lang J. From preference representation to combinatorial vote. Proceedings of the 8th International Conference of Principles of Knowledge Representation and Reasoning (KR2002) (2002), Morgan Kaufmann 277-288
20. P. Perny, O. Spanjaard, Preference-based search in state space graphs, in: Proceedings of the AAAI'2002 Conference, Edmonton, Canada, 2002, pp. 751-756.
21. Régin J.-C. A filtering algorithm for constraints of difference in CSPs. American Association for Artificial Intelligence (AAAI'94), Proceedings of the 12th National Conference on Artificial Intelligence (1994), AAAI Press/MIT Press, Cambridge 362-367
22. Régin J.C., Petit T., Bessière C., and Puget J.F. New lower bounds of constraints violations for over-constrained problems. Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 2239 (2001), Springer-Verlag, Berlin 332-345
23. Régin J.-C., and Rueher M. A global constraint combining a sum constraint and difference constraints. Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 1894 (2000), Springer-Verlag, Berlin 384-395
24. Roy B. Multicriteria Methodology for Decision Support (1996), Kluwer Academic Publishers, Dordrecht
25. B. Roy, D. Bouyssou, Aide Multicritère à la Décision: Méthodes et Cas, Economica, coll. Gestion, Paris, 1993.
26. Sam-Haroud D., and Faltings B. Consistency techniques for continuous constraints. Constraints, An International Journal 1 1-2 (1996) 85-118
27. Sen A.K. Collective Choice and Social Welfare. Series in Advanced Textbooks in Economics vol. 11 (1970), Elsevier Science Publishers, Netherlands
28. Sen A.K. Social choice theory. In: Arrow K.J., and Intriligator M.D. (Eds). Handbook of Mathematical Economics vol. 3 (1986), Elsevier Science Pub., North-Holland 1073-1181
29. Sen A.K. Maximization of the act of choice. Econometrica 65 4 (1997) 745-779
30. Solnon C. Cooperation of LP solvers for solving MILPs. International Conference on Tools for Artificial Intelligence (ICTAI) (1997), IEEE Computer Society Press 240-247
31. Subiza B., and Peris J.E. Choice functions: Rationality re-examined. Theory and Decision 48 (2000) 287-304
32. Suzumura K. Rational Choice, Collective Decisions and Social Welfare (1983), Cambridge University Press, Cambridge
33. S. Thienel, ABACUS-A Branch-And-CUt System, Ph.D. thesis of the Köln University, Germany, 1995. Available from: .
34. van Hentenryck P. Constraint Satisfaction in Logic Programming. coll. Logic Programming Series (1989), MIT Press, London; Cambridge (Mass)
35. van Hentenryck P., and Deville Y. The cardinality operator: A new logical connective for constraint logic programming. Proceedings of ICLP'91 (1991), MIT Press 745-759
36. W.J. van Hoeve, The all different constraint: A survey, in: Proceedings of the Sixth Annual Workshop of the ERCIM Working Group on Constraints, 2001. Available from: .
37. G. Verfaillie, D. Martinez, C. Bessière, A generic customizable framework for inverse local consistency, in: Proc. of the 16th National Conf. on Artificial Intelligence and 11th Conf. on Innovative Applications of Artificial Intelligence, Orlando, Florida.
38. Vincke P. Multicriteria Decision-Aid (1992), John Wiley & Sons
39. Warner D.M. Scheduling nursing personnel according to nursing preference: A mathematical programming approach. Operations Research 24 5 (1976) 842-856
40. W. Zhang, Branch-and-Bound search algorithms and their computational complexity, Research report no. ISI-RR- 96-44318, South-Carolina University, USA, May 1996, 31 p.