Multi-dimensional bin packing problems with guillotine constraints
type: Item
instance of: scholarly article
title: Multi-dimensional bin packing problems with guillotine constraints
zbMATH Open document ID: 1188.90206
author: David Pisinger
author: Rasmus Resen Amossen
published in: Computers \& Operations Research
publication date: 2010-06-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5720298
zbMATH Keywords: packing
zbMATH Keywords: cutting
zbMATH Keywords: constraint programming
describes a project that uses: Algorithm 864
MaRDI profile type: Publication
full work available at URL: j.cor.2010.01.017
OpenAlex ID: W2043649866
Wikidata QID: Q58826403
cites work: A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
cites work: Q4475645
cites work: Sweep synchronization as a global propagation mechanism
cites work: One-dimensional relaxations and LP bounds for orthogonal packing
cites work: A survey of dual-feasible and superadditive functions
cites work: A new constraint programming approach for the orthogonal packing problem
cites work: An analytical model for the container loading problem
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: Decomposition Principle for Linear Programs
cites work: A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
cites work: An Exact Algorithm for Higher-Dimensional Orthogonal Packing
cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints
cites work: An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
cites work: Exact algorithms for the guillotine strip cutting/packing problem.
cites work: The Three-Dimensional Bin Packing Problem
cites work: A comparative numerical analysis for the guillotine two-dimensional cutting problem
cites work: The two-dimensional bin packing problem with variable bin sizes and costs
cites work: Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
cites work: Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
cites work: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
DOI: 10.1016/J.COR.2010.01.017
DBLP publication ID: journals/cor/AmossenP10
description: scientific article; zbMATH DE number 5720298