Maximizing the number of mixed packages subject to variety constraints

DOI10.1016/S0305-0548(98)00105-1MaRDI QIDQ1819239zbMATH OpenOpenAlexFDO

Authors Dan Trietsch, David John Robb

Publication date 5 January 2000

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0305-0548(98)00105-1

zbMATH Keywords

polynomial-time algorithmseasonal productsone-dimensional bin-packing problempseudo-polynomial procedurestyle goods

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Cardinality constrained bin-packing problems
• An exact algorithm for the type-constrained and variable sized bin packing problem
• The solution of packing problems with pieces variable length and additional allocation constraints
• scientific article; zbMATH DE number 2081032
• Upper bounds and algorithms for the maximum cardinality bin packing problem.

This page was built for publication: Maximizing the number of mixed packages subject to variety constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1819239)