A global constraint for nesting problems
Nesting problems are particularly hard combinatorial problems. They involve the positioning of a set of small arbitrarily-shaped pieces on a large stretch of material, without overlapping them. The problem constraints are bidimensional in nature and have to be imposed on each pair of pieces. This al...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | book |
| Idioma: | eng |
| Publicado em: |
2004
|
| Assuntos: | |
| Texto completo: | https://repositorio-aberto.up.pt/handle/10216/91039 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/91039 |