Maximizing the number of mixed packages subject to variety constraints

DOI10.1016/S0305-0548(98)00105-1zbMath0967.90088OpenAlexW2097002837MaRDI QIDQ1819239

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)

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