Improved state space relaxation for constrained two-dimensional guillotine cutting problems
type: Item
instance of: scholarly article
title: Improved state space relaxation for constrained two-dimensional guillotine cutting problems
zbMATH Open document ID: 1403.90589
author: André Soares Velasco
author: Eduardo Uchoa
published in: European Journal of Operational Research
publication date: 2018-10-30T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6968046
zbMATH Keywords: cutting
zbMATH Keywords: dynamic programming
zbMATH Keywords: integer programming
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.06.016
OpenAlex ID: W2884579014
cites work: A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
cites work: A recursive algorithm for constrained two-dimensional cutting problems
cites work: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
cites work: Exact algorithms for the two-dimensional guillotine knapsack
cites work: An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
cites work: Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
cites work: Multistage Cutting Stock Problems of Two and More Dimensions
cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting
cites work: Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
cites work: An and-or-graph approach for two-dimensional cutting problems
cites work: A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
cites work: A Minimal Algorithm for the Bounded Knapsack Problem
cites work: Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
cites work: The G4-Heuristic for the Pallet Loading Problem
DOI: 10.1016/J.EJOR.2018.06.016
description: scientific article; zbMATH DE number 6968046