.png){kind=icon}
Return
AN ALGORITHM FOR THE SEGREGATED STORAGE PROBLEM
.png){kind=icon}
PRE
AI
DOI：10.1002/nav.3800230304.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
AbstractThe segregated storage problem involves the optimal distribution of products among compartments with the restriction that only one product may be stored in each compartment. The storage capacity of each compartment, the storage demand for each product, and the linear cost of storing one unit of a product in a given compartment are specified. The problem is reformulated as a large set‐packing problem, and a column generation scheme is devised to solve the associated linear programming problem. In case of fractional solutions, a branch and bound procedure is utilized. Computational results are presented.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available