A simulated annealing heuristic for the one-dimensional cutting stock problem
type: Item
instance of: scholarly article
title: A simulated annealing heuristic for the one-dimensional cutting stock problem
zbMATH Open document ID: 0912.90236
DOI: 10.1016/0377-2217(95)00102-6
author: Chuen-Lung S. Chen
author: Stephen M. Hart
author: Wai Mui Tham
published in: European Journal of Operational Research
publication date: 1998-10-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1212178
zbMATH Keywords: simulated annealing
zbMATH Keywords: integer linear programming
zbMATH Keywords: one-dimensional cutting stock
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00102-6
OpenAlex ID: W2072445834
cites work: An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Simulated annealing: A tool for operational research
cites work: Approximation solutions for the cutting stock `portfolio' problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: Optimal solutions for the cutting stock problem
cites work: Cutting stock problems and solution procedures
cites work: Cooling Schedules for Optimal Annealing
cites work: Simulated annealing and the mapping problem: A computational study
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Optimization by Simulated Annealing
cites work: Convergence of an annealing algorithm
cites work: Equation of State Calculations by Fast Computing Machines
cites work: A one-dimensional cutting stock problem in the aluminium industry and its solution
cites work: Q3785827
cites work: An LP-based approach to cutting stock problems with multiple objectives
Recommended article: An application of simulated annealing to the cutting stock problem
Recommended article: A heuristic approach to one-dimensional cutting stock problem
Recommended article: A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
Recommended article: Q3589039
Recommended article: A simulated annealing approach for the circular cutting problem
Recommended article: Heuristics for the integer one-dimensional cutting stock problem: A computational study
Recommended article: A residual recombination heuristic for one-dimensional cutting stock problems
Recommended article: Q3741396
Recommended article: Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
Recommended article: Solution for the constrained Guillotine cutting problem by simulated annealing
description: scientific article; zbMATH DE number 1212178