Metaheuristic algorithms for one-dimensional bin-packing problems: A survey of recent advances and applications

The bin-packing problem (BPP) is an age-old NP-hard combinatorial optimization problem, which is defined as the placement of a set of different-sized items into identical bins such that the number of containers used is optimally minimized. Besides, different variations of the problem do exist in pra...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Munien Chanaleä, Ezugwu Absalom E.
Formato: article
Lenguaje:EN
Publicado: De Gruyter 2021
Materias:
Q
Acceso en línea:https://doaj.org/article/88c9fcae61b14dd6a4799716260dacce
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares