Exact algorithms for the two-dimensional guillotine knapsack
type: Item
instance of: scholarly article
title: Exact algorithms for the two-dimensional guillotine knapsack
zbMATH Open document ID: 1251.90237
author: Mohammad Dolatabadi
author: Andrea Lodi
author: Michele Monaci
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6107441
zbMATH Keywords: two-dimensional knapsack
zbMATH Keywords: guillotine packing
zbMATH Keywords: exact algorithm
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.cor.2010.12.018
OpenAlex ID: W2082836978
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: New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
cites work: On the two-dimensional knapsack problem
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: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: A new exact algorithm for general orthogonal d-dimensional knapsack problems
cites work: An Exact Algorithm for Higher-Dimensional Orthogonal Packing
cites work: A new upper bound for unconstrained two-dimensional cutting and packing
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
cites work: Exact algorithms for large-scale unconstrained two and three staged cutting problems
cites work: Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
cites work: An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
cites work: Q5501261
cites work: Integer linear programming models for 2-staged two-dimensional knapsack problems
cites work: Arc-flow model for the two-dimensional guillotine cutting stock problem
cites work: Q3993418
cites work: Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
cites work: Models and algorithms for three-stage two-dimensional bin packing
cites work: A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
cites work: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
cites work: An improved typology of cutting and packing problems
DOI: 10.1016/J.COR.2010.12.018
description: scientific article; zbMATH DE number 6107441