Approximate packing circles in a rectangular container: valid inequalities and nesting
A problem of packing a limited number of unequal circles in a fixed size rectangular container is considered. The aim is to maximize the (weighted) number of circles placed into the container or minimize the waste. This problem has numerous applications in logistics, including production and packing...
| Autores principales: | , |
|---|---|
| Formato: | Artículo |
| Lenguaje: | inglés |
| Publicado: |
Universidad Nacional Autónoma de México
2014
|
| Acceso en línea: | http://eprints.uanl.mx/29776/7/29782.pdf |