A new heuristic for rectangular stock-cutting problem

DOI10.1504/IJOR.2011.043549zbMATH Open1301.90101OpenAlexW2006671747MaRDI QIDQ646775

Maghsud Solimanpur, Faraz Baradarani

Publication date: 17 November 2011

Published in: International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijor.2011.043549

zbMATH Keywords

heuristicspackingoptimisationcutting

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27)

Related Items (1)

A hybrid heuristic to reduce the number of different patterns in cutting stock problems

This page was built for publication: A new heuristic for rectangular stock-cutting problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646775)