Volume 32, Number 4, November 1994

SPECIAL ISSUE
KNAPSACK, PACKING AND CUTTING
PART II: MULTIDIMENSIONAL KNAPSACK AND CUTTING STOCK PROBLEMS

GUEST EDITOR, SILVANO MARTELLO

Editorial

Y. Crama and J. B. Mazzola
On the Stength of Relaxations of Multi-Dimensional Knapsack Problems

J.Thiel and S. Voss
Some Experiences on Solving Multiconstraint Zero-One Knapsack Problems with Genetic Algorithms

J. M. v. De carvalho and A. J. G. Rodrigues
A Computer Based Interactive Approach to a Two-stage Cutting Stock Problem

F. Chauny, and R. Loulou
LP-Based Method for the Multi-Sheet Cutting Stock Problem

A. El-bouri, N. Pooolewell, S. Balakrishnan and A. S. Alfa
A Search-Based Heuristic for the Two-Dimensional Bin-Packing Problem

A. G. Tarnowski, J. Terno and G. Scheithauer
A Polynomial Time Algorithm for the Guillotine Pallet Loading Problem

REGULAR CONTRIBUTED PAPERS

E. Yannopoulos and A. S. Alfa
A Simple and Quick Approximation Algorithm for Tandem, Split and Merge Queueing Networks With Blocking

Book Review

Publications Plan 1995-1996

Index 1994

 


Copyright 1992-2007 University of Toronto Press Incorporated except where otherwise noted. For guidelines on use of material on this site see Legal Notice. Every effort has been made to contact copyright holders of material included in this site. If your article appears here without your permission, please let us know and we will remove it. Contact Anne Marie Corrigan.