A local search approach for two-dimensional irregular cutting

DOI10.1007/BF01719251zbMath0843.90095OpenAlexW1973273776MaRDI QIDQ1908994

R. Walkowiak, Jacek Błażewicz

Publication date: 19 August 1996

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01719251

zbMATH Keywords

simulated annealingtabu searchtwo-dimensional irregular cutting problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming, Fast neighborhood search for two- and three-dimensional nesting problems, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, Metaheuristics: A bibliography

Cites Work

• Future paths for integer programming and links to artificial intelligence
• Using a tabu search approach for solving the two-dimensional irregular cutting problem
• Tabu Search—Part I
• Tabu Search—Part II
• `` Strong NP-Completeness Results
• Unnamed Item