Lexicographically-ordered constraint satisfaction problems
From MaRDI portal
Publication:2267804
Recommendations
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Conditional lexicographic orders in constraint satisfaction problems
- Computing leximin-optimal solutions in constraint networks
- On the analytic representation of the Leximin ordering and its application to flexible constraint propagation
- Learning solution preferences in constraint problems
Cites work
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Axioms for Lexicographic Preferences
- Comparison of Weighting Judgments in Multiattribute Utility Measurement
- Conditional lexicographic orders in constraint satisfaction problems
- Constraint Satisfaction
- Decision-support with preference constraints
- Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
- scientific article; zbMATH DE number 3833720 (Why is no real title available?)
- scientific article; zbMATH DE number 4174344 (Why is no real title available?)
- scientific article; zbMATH DE number 3972536 (Why is no real title available?)
- scientific article; zbMATH DE number 3769296 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 3339023 (Why is no real title available?)
- scientific article; zbMATH DE number 2209466 (Why is no real title available?)
- scientific article; zbMATH DE number 2209473 (Why is no real title available?)
- scientific article; zbMATH DE number 2209474 (Why is no real title available?)
- scientific article; zbMATH DE number 2243357 (Why is no real title available?)
- Individual Choice when Objects have "Ordinal" Properties
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Multicriteria Optimization
- On graphical modeling of preference and importance
- Preference-based search and multi-criteria optimization
- Semiring-based constraint satisfaction and optimization
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- The computational complexity of dominance and consistency in CP-nets
Cited in
(20)- On the analytic representation of the Leximin ordering and its application to flexible constraint propagation
- Preference-based search and multi-criteria optimization
- Residuation for soft constraints: lexicographic orders and approximation techniques
- Propagation algorithms for lexicographic ordering constraints
- Well-posedness for lexicographic vector quasiequilibrium problems with lexicographic equilibrium constraints
- Scaling-invariant maximum margin preference learning
- Exact approaches for parameter elicitation in lexicographic ordering
- scientific article; zbMATH DE number 3898622 (Why is no real title available?)
- Boolean lexicographic optimization: algorithms \& applications
- Learning solution preferences in constraint problems
- scientific article; zbMATH DE number 2084756 (Why is no real title available?)
- Levitin-Polyak well-posedness for lexicographic vector equilibrium problems
- Well-Posedness for Lexicographic Vector Equilibrium Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Recent Advances in Constraints
- Semicontinuity and closedness of parametric generalized lexicographic quasiequilibrium problems
- Various types of well-posedness for vector equilibrium problems with respect to the lexicographic order
- Computational techniques for a simple theory of conditional preferences
- Computing leximin-optimal solutions in constraint networks
- Conditional lexicographic orders in constraint satisfaction problems
This page was built for publication: Lexicographically-ordered constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267804)
