𝔖 Bobbio Scriptorium
✦   LIBER   ✦

AN ALGORITHM FOR THE SEGREGATED STORAGE PROBLEM

✍ Scribed by A. W. Neebe; M. R. Rao

Publisher
John Wiley and Sons
Year
1976
Tongue
English
Weight
717 KB
Volume
23
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The 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.

πŸ“œ SIMILAR VOLUMES

An algorithm for the storage of Condon-S
An algorithm for the storage of Condon-Shortley coefficients
✍ Frank L. Tobin πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 128 KB

An algorithm is presented for the generation and storage of all unique, non-zero Condon-Shortley coefficients. The formulas for retrieving these coefficients in a non-sequential fashion are developed and presented.

An Efficient Algorithm for the Complex R
An Efficient Algorithm for the Complex Roots Problem
✍ C.Andrew Neff; John H. Reif πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 406 KB

Given a univariate polynomial f (z) of degree n with complex coefficients, whose norms are less than 2 m in magnitude, the root problem is to find all the roots of f (z) up to specified precision 2 ΟͺȐ . Assuming the arithmetic model for computation, we provide an algorithm which has complexity O(n l