An improvement of viswanathan and bagchi's exact algorithm for constrained two-dimensional cutting stock
Author:
- Mhand HifiMHMhand Hifi
- 1 August 1997
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 24 (8) , 727-736
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- An approximation algorithm for solving unconstrained two-dimensional knapsack problemsEuropean Journal of Operational Research, 1995
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock ProblemsOperations Research, 1993
- Cutting and Packing Problems: A Categorized, Application-Orientated Research BibliographyJournal of the Operational Research Society, 1992
- An and—or-graph approach for two-dimensional cutting problemsEuropean Journal of Operational Research, 1992
- Packing problemsEuropean Journal of Operational Research, 1992
- An improved version of Wang's algorithm for two-dimensional cutting problemsEuropean Journal of Operational Research, 1990
- Algorithms for Unconstrained Two-Dimensional Guillotine CuttingJournal of the Operational Research Society, 1985
- Two Algorithms for Constrained Two-Dimensional Cutting Stock ProblemsOperations Research, 1983
- Dynamic programming algorithms for the Zero-One Knapsack ProblemComputing, 1980
- A Graph-Theoretic Approach to a Class of Integer-Programming ProblemsOperations Research, 1969