Decision-support with preference constraints

DOI10.1016/j.ejor.2005.04.016zbMath1109.90071OpenAlexW2056104910MaRDI QIDQ857275

Rémy-Robert Joseph, Georges Weil, Michael Hiroux, Peter Chan

Publication date: 14 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.04.016

zbMATH Keywords

combinatorial optimizationbranch-and-boundconstraint programmingbinary preference relationcompact representation of preferences

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50) Combinatorial optimization (90C27)

Related Items

Lexicographically-ordered constraint satisfaction problems ⋮ Making choices with a binary relation: relative choice axioms and transitive closures

Uses Software

• ABACUS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evaluation and decision models. A critical perspective
• An optimal k-consistency algorithm
• Choice functions: Rationality re-examined
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Introducing global constraints in CHIP
• Multicriteria methodology for decision aiding. Transl. from the French by Mark R. McCord
• Dynamic decision problem structuring
• A Sufficient Condition for Backtrack-Free Search
• Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach
• Maximization and the Act of Choice