Maximizing the number of mixed packages subject to variety constraints

We develop a polynomial-time algorithm to optimise a variant of the one-dimensional bin-packing problem with side constraints. We also develop a pseudo-polynomial procedure to actually implement that optimal solution. The specific application is the allocation of excess of a population of various ty...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 26; no. 13; pp. 1323 - 1333
Main Authors:	Robb, David J., Trietsch, Dan
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier Ltd 01.11.1999 Elsevier Science Pergamon Press Inc
Subjects:	Algorithms Applied sciences Bin packing Christmas Exact sciences and technology Greeting cards Mathematical programming Operational research and scientific management Operational research. Management science Operations research Packaging Polynomial algorithm Pseudo-polynomial Seasonal products Studies Style goods Seasonal products Bin packing Style goods Polynomial algorithm Pseudo-polynomial Integer programming Maximization Constraint Optimal solution Bin packing problem Variety Polynomial time
ISSN:	0305-0548, 1873-765X, 0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!