A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems

From MaRDI portal
Publication:4679787

DOI10.1057/palgrave.jors.2601829zbMath1104.90040OpenAlexW2017917958MaRDI QIDQ4679787

Ramón Alvarez-Valdés, José Manuel Tamarit, Francisco Parreño

Publication date: 21 June 2005

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

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601829




Related Items (19)

TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problemA tabu search algorithm for a two-dimensional non-guillotine cutting problemAn EDA for the 2D knapsack problem with guillotine constraintAn introduction to the two‐dimensional rectangular cutting and packing problemA MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defectsA NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEMMaximizing revenue with allocation of multiple advertisements on a Web bannerA heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defectsReactive GRASP for the strip-packing problemHeuristic approaches for the two- and three-dimensional knapsack packing problemA least wasted first heuristic algorithm for the rectangular packing problemAn efficient deterministic heuristic for two-dimensional rectangular packingQueue-constrained packing: a vehicle ferry case studyHeuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windowsThe maximum diversity assortment selection problemThe stochastic trim-loss problemA genetic algorithm for the two-dimensional knapsack problem with rectangular piecesHeuristics for container loading of furnitureNew and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems







This page was built for publication: A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems