Change search
ReferencesLink to record
Permanent link

Direct link
Six ways of integrating symmetries within non-overlapping constraints
Show others and affiliations
Number of Authors: 6
2009 (English)Report (Other academic)
Abstract [en]

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
Keyword [en]
Global Constraints, Placement Problems, Symmetry Breaking, Non-Overlapping, Lexicographic ordering
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-15134OAI: diva2:1036428
Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(398 kB)4 downloads
File information
File name FULLTEXT01.pdfFile size 398 kBChecksum SHA-512
Type fulltextMimetype application/pdf
fulltext(826 kB)1 downloads
File information
File name FULLTEXT02.psFile size 826 kBChecksum SHA-512
Type fulltextMimetype application/postscript

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 5 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link