Six ways of integrating symmetries within non-overlapping constraints
Number of Authors: 6
2009 (English)Report (Other academic)
This report introduces six ways for handling a chain of lexicographic ordering 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 chain of lexicographic ordering constraint within a generic geometric constraint kernel, the four latter ways deal with the conjunction of a chain of lexicographic ordering 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.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2009, 1. , 52 p.
SICS Technical Report, ISSN 1100-3154 ; 2009:01
Global Constraints, Placement Problems, Symmetry Breaking, Non-Overlapping, Lexicographic ordering
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22946OAI: oai:DiVA.org:ri-22946DiVA: diva2:1042511