Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-01929-6_3 | CPAIOR |
Keywords | Field | DocType |
generic geometric constraint kernel,non-overlapping constraints,lex-chain constraint,latter ways deal,cumulative constraint,industrial problem,strong integration,ways deal,dimensional placement problem,integrating symmetries,identical orthotopes,cumulant,lexicographic order,symmetry breaking,three dimensional | Kernel (linear algebra),Pairwise comparison,Discrete mathematics,Mathematical optimization,Symmetry breaking,Computer science,Constraint (mathematics),Lexicographical order,Constraint logic programming,Homogeneous space,Binary constraint | Conference |
Volume | ISSN | Citations |
5547 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 4 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Magnus Ågren | 1 | 72 | 8.03 |
| Nicolas Beldiceanu | 2 | 547 | 51.14 |
| Mats Carlsson | 3 | 975 | 79.24 |
| Mohamed Sbihi | 4 | 0 | 0.34 |
| Charlotte Truchet | 5 | 63 | 11.48 |
| Stéphane Zampelli | 6 | 44 | 3.37 |