Polytopes, graphs and optimisation
Polytopes, graphs and optimisation
The OPL optimization programming language
The OPL optimization programming language
Mixed Global Constraints and Inference in Hybrid CLP–IP Solvers
Annals of Mathematics and Artificial Intelligence
On the Sum Constraint: Relaxation and Applications
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Branch and Infer: a Unifying Framework for Integer and Finite Domain Constraint Programming
INFORMS Journal on Computing
Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming
INFORMS Journal on Computing
Constraint Processing
Neural network-based heuristic algorithms for hypergraph coloring problems with applications
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
A scheme for unifying optimization and constraint satisfaction methods
The Knowledge Engineering Review
Constraint and Integer Programming: Toward a Unified Methodology (Operations Research/Computer Science Interfaces", 27)
Integrated Methods for Optimization (International Series in Operations Research & Management Science)
Simultaneous matchings: Hardness and approximation
Journal of Computer and System Sciences
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The Polytope of Context-Free Grammar Constraints
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
On the system of two all_different predicates
Information Processing Letters
An Integrated Solver for Optimization Problems
Operations Research
Constraint integer programming: a new approach to integrate CP and MIP
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
A totally unimodular description of the consistent value polytope for binary constraint programming
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A polyhedral approach to the alldifferent system
Mathematical Programming: Series A and B
Graph coloring facets from all-different systems
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hi-index | 0.00 |
We study the facial structure of the alldifferent system, i.e., the polytope (namely, $P_{I}$) defined as the convex hull of integer vectors satisfying such a system. We derive classes of facets for $P_{I}$ by examining induced subgraphs of the associated constraint graph. Some of these graphic structures (for example, odd holes, webs, etc.) are well known to induce facets of the set packing polytope, namely, $P_{S}$. This is a rather surprising result, given that $P_{S}$ is defined in terms of binary variables whereas $P_{I}$ is defined in terms of integer variables receiving values from a discrete domain. As a consequence, the resulting facet-defining inequalities are different for $P_{I}$ and $P_{S}$. Furthermore, we show that the families of facet-defining graphic structures for $P_{I}$ and $P_{S}$ do not coincide as we exhibit such a structure yielding facets for $P_{I}$ but not for $P_{S}$. We also prove that the facets of $P_{I}$ come in pairs of the form $(\alpha x\geq\beta,\alpha x\leq\delta)$ and show that the separation of the first implies that of the second (and vice versa). In addition, we provide the complete linear description of $P_{I}$ when the constraint graph of the alldifferent system is of degree 2.