Pages that link to "Item:Q2457611"
From MaRDI portal
The following pages link to Propagation algorithms for lexicographic ordering constraints (Q2457611):
Displaying 12 items.
- Filtering algorithms for the multiset ordering constraint (Q835808) (← links)
- Variable symmetry breaking in numerical constraint problems (Q900305) (← links)
- On the analytic representation of the Leximin ordering and its application to flexible constraint propagation (Q1291589) (← links)
- Constraint programming for planning test campaigns of communications satellites (Q1701233) (← links)
- An improved SAT formulation for the social golfer problem (Q1761920) (← links)
- On matrices, automata, and double counting in constraint programming (Q2342587) (← links)
- Lexicographical order in integer programming (Q2405486) (← links)
- Generating custom propagators for arbitrary constraints (Q2453695) (← links)
- Parameterized Complexity Results in Symmetry Breaking (Q3058684) (← links)
- Breaking Symmetry of Interchangeable Variables and Values (Q3523071) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5898793) (← links)
- Automated streamliner portfolios for constraint satisfaction problems (Q6161503) (← links)