Pages that link to "Item:Q2267804"

The following pages link to Lexicographically-ordered constraint satisfaction problems (Q2267804):

Displaying 16 items.

• Well-posedness for lexicographic vector quasiequilibrium problems with lexicographic equilibrium constraints (Q262318) (← links)
• Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
• Computational techniques for a simple theory of conditional preferences (Q646519) (← links)
• Computing leximin-optimal solutions in constraint networks (Q835811) (← links)
• Conditional lexicographic orders in constraint satisfaction problems (Q846134) (← links)
• On the analytic representation of the Leximin ordering and its application to flexible constraint propagation (Q1291589) (← links)
• Preference-based search and multi-criteria optimization (Q1876530) (← links)
• Residuation for soft constraints: lexicographic orders and approximation techniques (Q2055790) (← links)
• Propagation algorithms for lexicographic ordering constraints (Q2457611) (← links)
• Scaling-invariant maximum margin preference learning (Q2658026) (← links)
• (Q3677521) (← links)
• Levitin-Polyak well-posedness for lexicographic vector equilibrium problems (Q4631855) (← links)
• Well-Posedness for Lexicographic Vector Equilibrium Problems (Q5745756) (← links)
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5898793) (← links)
• Semicontinuity and closedness of parametric generalized lexicographic quasiequilibrium problems (Q5964639) (← links)
• Various types of well-posedness for vector equilibrium problems with respect to the lexicographic order (Q6159694) (← links)