Mathematical models and exact algorithms for the Colored Bin Packing Problem

This paper focuses on exact approaches for the Colored Bin Packing Problem (CBPP), a generalization of the classical one-dimensional Bin Packing Problem in which each item has, in addition to its length, a color, and no two items of the same color can appear consecutively in the same bin. To simplif...

Full description

Bibliographic Details

Published in:	Computers & operations research Vol. 164; p. 106527
Main Authors:	Borges, Yulle G.F., Schouery, Rafael C.S., Miyazawa, Flávio K.
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01-04-2024
Subjects:	Arc flow Bin Packing Problem Mixed integer linear programming VRPSolver Arc flow Mixed integer linear programming VRPSolver Bin Packing Problem
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!