Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation
Mathijs Barkel, Maxence Delorme, Enrico Malaguti, Michele Monaci
| Year of publication: |
2025
|
|---|---|
| Authors: | Barkel, Mathijs ; Delorme, Maxence ; Malaguti, Enrico ; Monaci, Michele |
| Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 320.2025, 1 (1.1.), p. 57-68
|
| Subject: | Color fragmentation | Computational experiments | Lower bounds | Packing | Tabu search | Heuristik | Heuristics | Algorithmus | Algorithm | Packproblem | Packing problem | Graphentheorie | Graph theory | Operations Research | Operations research | Experiment | Mathematische Optimierung | Mathematical programming |
freely available
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.ejor.2024.08.007 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10015085085