Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 12 of 13 found articles
 
 
  Solving a Segregated Storage Problem Using Branch-and-Bound and Extreme Point Ranking Methods
 
 
Title: Solving a Segregated Storage Problem Using Branch-and-Bound and Extreme Point Ranking Methods
Author: White, John a.
Francis, Richard L.
Appeared in: IIE transactions
Paging: Volume 3 (1971) nr. 1 pages 37-44
Year: 1971-03-01
Contents: The problem of storing products in compartments is treated under the restriction that only one type product be stored in a given compartment. Instances of segregated storage problems are cited. The segregated storage problem is formulated as a transportation problem with additional nonlinear constraints. The problem is solved using branch-and-bound and extreme point ranking procedures. An example problem is solved using both solution procedures and the two procedures are compared.
Publisher: Taylor & Francis
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 12 of 13 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands