Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation
- Mathijs Barkel ,
Mathijs Barkel
[email protected]https://orcid.org/0000-0003-1276-588X
Department of Econometrics and Operations Research, Tilburg University, 5037 AB Tilburg, Netherlands
- Maxence Delorme ,
Corresponding Author
Maxence Delorme
[email protected]https://orcid.org/0000-0003-3730-0894
Department of Econometrics and Operations Research, Tilburg University, 5037 AB Tilburg, Netherlands
- Enrico Malaguti ,
Enrico Malaguti
[email protected]https://orcid.org/0000-0002-5884-9360
Dipartimento di Ingegneria dell’Energia Elettrica e dell’Informazione “Guglielmo Marconi”, Università di Bologna, 40136 Bologna, Italy
- Michele Monaci
Michele Monaci
[email protected]https://orcid.org/0000-0001-9978-7613
Dipartimento di Ingegneria dell’Energia Elettrica e dell’Informazione “Guglielmo Marconi”, Università di Bologna, 40136 Bologna, Italy
Mathijs Barkel
[email protected]https://orcid.org/0000-0003-1276-588X
Department of Econometrics and Operations Research, Tilburg University, 5037 AB Tilburg, Netherlands
Corresponding Author
Maxence Delorme
[email protected]https://orcid.org/0000-0003-3730-0894
Department of Econometrics and Operations Research, Tilburg University, 5037 AB Tilburg, Netherlands
Enrico Malaguti
[email protected]https://orcid.org/0000-0002-5884-9360
Dipartimento di Ingegneria dell’Energia Elettrica e dell’Informazione “Guglielmo Marconi”, Università di Bologna, 40136 Bologna, Italy
Michele Monaci
[email protected]https://orcid.org/0000-0001-9978-7613
Dipartimento di Ingegneria dell’Energia Elettrica e dell’Informazione “Guglielmo Marconi”, Università di Bologna, 40136 Bologna, Italy

