The Co-Printing Problem: A Packing Problem with a Color Constraint

DOI10.1287/opre.1040.0112zbMath1165.90335OpenAlexW2163859474MaRDI QIDQ5321739

Zeger Degraeve, Marc Peeters

Publication date: 14 July 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1040.0112

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Inventory, storage, reservoirs (90B05)

Related Items (5)

Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation ⋮ VNS matheuristic for a bin packing problem with a color constraint ⋮ An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ The class constrained bin packing problem with applications to video-on-demand ⋮ A note on dual approximation algorithms for class constrained bin packing problems

Uses Software

• LINDO

This page was built for publication: The Co-Printing Problem: A Packing Problem with a Color Constraint