Heuristic methods for gang-rip saw arbor design.
From MaRDI portal
Publication:1420446
DOI10.1016/S0377-2217(02)00796-8zbMath1053.90113MaRDI QIDQ1420446
Publication date: 2 February 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Near-optimal solutions to one-dimensional cutting stock problems
- A two-phase roll cutting problem
- The cutting stock problem in the canvas industry
- Application of Mathematical Programming to the Plywood Design and Manufacturing Problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Technical Note—Forest Outturn Optimization by Dantzig-Wolfe Decomposition and Dynamic Programming Column Generation
- Polynomial Complete Consecutive Information Retrieval Problems
- A column generation procedure for gang-rip saw arbor design and scheduling