Cargando…
Exact solutions for the 2d-strip packing problem using the positions-and-covering methodology
We use the Positions and Covering methodology to obtain exact solutions for the two-dimensional, non-guillotine restricted, strip packing problem. In this classical NP-hard problem, a given set of rectangular items has to be packed into a strip of fixed weight and infinite height. The objective cons...
Autores principales: | Cid-Garcia, Nestor M., Rios-Solis, Yasmin A. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7808675/ https://www.ncbi.nlm.nih.gov/pubmed/33444394 http://dx.doi.org/10.1371/journal.pone.0245267 |
Ejemplares similares
-
Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem
por: Cid-Garcia, Nestor M., et al.
Publicado: (2020) -
Exact solution of the robust knapsack problem()
por: Monaci, Michele, et al.
Publicado: (2013) -
Ultrafast adiabatic quantum algorithm for the NP-complete exact cover problem
por: Wang, Hefeng, et al.
Publicado: (2016) -
Two methods for the exact solution of diffraction problems
por: Alzofon, Frederick E
Publicado: (2003) -
Exact solutions for the collaborative pickup and delivery problem
por: Gansterer, Margaretha, et al.
Publicado: (2017)