𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Accelerative Enumeration Algorithm for the Bottle Combination Problem and the Menu Planning Problem

✍ Scribed by Harukazu Tsuruta; Noriaki Ikeda; Toshiro Sato

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
513 KB
Volume
26
Category
Article
ISSN
0010-4809

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An implicit enumeration scheme for the b
An implicit enumeration scheme for the batch selection problem
✍ A. Agnetis; F. Rossi; S. Smriglio πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 135 KB

## Abstract An important problem arising in the management of logistic networks is the following: given a set of activities to be performed, each requiring a set of resources, select the optimal set of resources compatible with the system capacity constraints. This problem is called Batch Selection

AN ALGORITHM FOR THE SEGREGATED STORAGE
AN ALGORITHM FOR THE SEGREGATED STORAGE PROBLEM
✍ A. W. Neebe; M. R. Rao πŸ“‚ Article πŸ“… 1976 πŸ› John Wiley and Sons 🌐 English βš– 717 KB

## 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

An algorithm for the discrete bilevel pr
An algorithm for the discrete bilevel programming problem
✍ Jonathan F. Bard; James T. Moore πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 915 KB

The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting