Pages that link to "Item:Q2884497"
From MaRDI portal
The following pages link to Representations of the all\_different predicate of constraint satisfaction in integer programming (Q2884497):
Displaying 15 items.
- Cardinality constraints and systems of restricted representatives (Q266031) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Solving house allocation problems with risk-averse agents (Q836964) (← links)
- On the system of two all different\(\_\)predicates (Q1041730) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- A short convex-hull proof for the all-different system with the inclusion property (Q1785324) (← links)
- Graph coloring inequalities from all-different systems (Q2342600) (← links)
- Submodularity and its application to some global constraints (Q2364363) (← links)
- Matrices with lexicographically-ordered rows (Q2414107) (← links)
- A polyhedral approach to the \textit{alldifferent} system (Q2429475) (← links)
- Parsimonious binary-encoding in integer programming (Q2581315) (← links)
- (Q4253834) (← links)
- Polytope of two at-least predicates (Q5224725) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5713885) (← links)
- Coloring distance graphs on the plane (Q6046170) (← links)