An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
From MaRDI portal
Publication:1370660
DOI10.1016/S0305-0548(96)00095-0zbMath0914.90225MaRDI QIDQ1370660
Publication date: 26 October 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
lower and upper bounds; constrained two-dimensional cutting problem; branching cuts; one-dimensional bounded knapsacks
90C27: Combinatorial optimization
Related Items
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems, Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization, An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry, Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem, Bun splitting: a practical cutting stock problem, A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem, A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns, A bidirectional building approach for the 2D constrained guillotine knapsack packing problem, Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem, An exact algorithm for generating homogeneous T-shape cutting patterns, Multi-dimensional bin packing problems with guillotine constraints, A recursive algorithm for constrained two-dimensional cutting problems, Exact algorithms for the guillotine strip cutting/packing problem., A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems., Exact algorithms for the two-dimensional guillotine knapsack, An effective quasi-human based heuristic for solving the rectangle packing problem, Exact solution techniques for two-dimensional cutting and packing, A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem, Mathematical modeling and optimal blank generation in glass manufacturing, Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns, An EDA for the 2D knapsack problem with guillotine constraint, Strip generation algorithms for constrained two-dimensional two-staged cutting problems, PackLib\(^{2}\): an integrated library of multi-dimensional packing problems, An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem, Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming, A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces, Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Dynamic programming algorithms for the zero-one knapsack problem
- An and-or-graph approach for two-dimensional cutting problems
- Packing problems
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- An improved version of Wang's algorithm for two-dimensional cutting problems
- Mathematical Methods of Organizing and Planning Production
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- An Algorithm for Two-Dimensional Cutting Problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- The Theory and Computation of Knapsack Functions
- A Graph-Theoretic Approach to a Class of Integer-Programming Problems
- Recursive Computational Procedure for Two-dimensional Stock Cutting
