Lexicographically-ordered constraint satisfaction problems
From MaRDI portal
Publication:2267804
DOI10.1007/S10601-009-9069-0zbMATH Open1191.68632OpenAlexW1968469425MaRDI QIDQ2267804FDOQ2267804
Authors: Eugene C. Freuder, Robert Heffernan, Richard J. Wallace, Nic Wilson 
Publication date: 2 March 2010
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-009-9069-0
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicriteria Optimization
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Title not available (Why is that?)
- Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
- Axioms for Lexicographic Preferences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Comparison of Weighting Judgments in Multiattribute Utility Measurement
- Semiring-based constraint satisfaction and optimization
- Title not available (Why is that?)
- Individual Choice when Objects have "Ordinal" Properties
- Constraint Satisfaction
- On graphical modeling of preference and importance
- The computational complexity of dominance and consistency in CP-nets
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Conditional lexicographic orders in constraint satisfaction problems
- Decision-support with preference constraints
- Preference-based search and multi-criteria optimization
- Title not available (Why is that?)
Cited In (19)
- Well-posedness for lexicographic vector quasiequilibrium problems with lexicographic equilibrium constraints
- Title not available (Why is that?)
- Computing leximin-optimal solutions in constraint networks
- Well-Posedness for Lexicographic Vector Equilibrium Problems
- Levitin-Polyak well-posedness for lexicographic vector equilibrium problems
- Boolean lexicographic optimization: algorithms \& applications
- Conditional lexicographic orders in constraint satisfaction problems
- Exact approaches for parameter elicitation in lexicographic ordering
- Recent Advances in Constraints
- Preference-based search and multi-criteria optimization
- Scaling-invariant maximum margin preference learning
- Residuation for soft constraints: lexicographic orders and approximation techniques
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Various types of well-posedness for vector equilibrium problems with respect to the lexicographic order
- Title not available (Why is that?)
- Computational techniques for a simple theory of conditional preferences
- Learning solution preferences in constraint problems
- Semicontinuity and closedness of parametric generalized lexicographic quasiequilibrium problems
- Propagation algorithms for lexicographic ordering constraints
Uses Software
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)
