A simulated annealing heuristic for the one-dimensional cutting stock problem
From MaRDI portal
Publication:1268138
DOI10.1016/0377-2217(95)00102-6zbMath0912.90236OpenAlexW2072445834MaRDI QIDQ1268138
Stephen M. Hart, Wai Mui Tham, Chuen-Lung S. Chen
Publication date: 18 October 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00102-6
Related Items (5)
A branch-and-price-and-cut algorithm for the pattern minimization problem ⋮ Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets ⋮ The stochastic trim-loss problem ⋮ New lower bounds based on column generation and constraint programming for the pattern minimization problem ⋮ An effective solution for a real cutting stock problem in manufacturing plastic rolls
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Simulated annealing: A tool for operational research
- Cutting stock problems and solution procedures
- Simulated annealing and the mapping problem: A computational study
- Approximation solutions for the cutting stock `portfolio' problem
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- An LP-based approach to cutting stock problems with multiple objectives
- Optimal solutions for the cutting stock problem
- A Linear Programming Approach to the Cutting-Stock Problem
- An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Convergence of an annealing algorithm
- Cooling Schedules for Optimal Annealing
- Equation of State Calculations by Fast Computing Machines
- A Linear Programming Approach to the Cutting Stock Problem—Part II
This page was built for publication: A simulated annealing heuristic for the one-dimensional cutting stock problem
