SODA

Six ways of integrating symmetries within non-overlapping constraints

Ågren, Magnus and Beldiceanu, Nicolas and Carlsson, Mats and Sbihi, Mohamed and Truchet, Charlotte and Zampelli, Stéphane (2009) Six ways of integrating symmetries within non-overlapping constraints. In: CP-AI-OR 2009, 27-31 May 2009, Pittsburgh, Pennsylvania, USA.

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1007/978-3-642-01929-6_3

Abstract

This paper introduces six ways for handling a chain of lexicographic ordering (lex-chain) constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-rectangles) subject to the fact that they should not pairwise overlap. While the first two ways deal with the integration of a lex-chain constraint within a generic geometric constraint kernel, the four latter ways deal with the conjunction of a lex-chain constraint and a non-overlapping or a cumulative constraint. Experiments on academic two and three dimensional placement problems as well as on industrial problems show the benefit of such a strong integration of symmetry breaking constraints and non-overlapping ones.

Item Type:Conference or Workshop Item (Paper)
ID Code:3655
Deposited By:Magnus Ņgren
Deposited On:01 Sep 2009
Last Modified:18 Nov 2009 16:25

Repository Staff Only: item control page