Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation.
Saved in:
| Title: | Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation. |
|---|---|
| Authors: | Barkel, Mathijs1, m.j.barkel@tilburguniversity.edu, Delorme, Maxence1, m.delorme@tilburguniversity.edu, Malaguti, Enrico2, enrico.malaguti@unibo.it, Monaci, Michele2, michele.monaci@unibo.it |
| Source: | INFORMS Journal on Computing; May/Jun2026, Vol. 38 Issue 3, p1016-1031, 16p |
| Database: | Applied Science & Technology Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| ISSN: | 10919856 |
|---|---|
| DOI: | 10.1287/ijoc.2024.0972 |