Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming
From MaRDI portal
Publication:2884497
DOI10.1287/ijoc.13.2.96.10515zbMath1238.90103OpenAlexW2149482683MaRDI QIDQ2884497
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c0ee06af5ad949bd43bc8cf1f3eaf20a20f0e923
Integer programming (90C10) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (11)
Cardinality constraints and systems of restricted representatives ⋮ Constraint programming and operations research ⋮ Submodularity and its application to some global constraints ⋮ Solving house allocation problems with risk-averse agents ⋮ A supernodal formulation of vertex colouring with applications in course timetabling ⋮ Matrices with lexicographically-ordered rows ⋮ Coloring distance graphs on the plane ⋮ A polyhedral approach to the \textit{alldifferent} system ⋮ A short convex-hull proof for the all-different system with the inclusion property ⋮ On the system of two all different\(\_\)predicates ⋮ Graph coloring inequalities from all-different systems
Uses Software
This page was built for publication: Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming
