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...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
De Gruyter
2021
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/88c9fcae61b14dd6a4799716260dacce |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|