MPQ-trees for orthogonal packing problem
type: Item
instance of: scholarly article
title: MPQ-trees for orthogonal packing problem
zbMATH Open document ID: 1237.90003
author: C. Joncour
author: Arnaud Pêcher
author: Petru Valicov
published in: Electronic Notes in Discrete Mathematics
publication date: 2012-05-13T00:00:00Z
Mathematics Subject Classification ID: 90-04
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6033952
zbMATH Keywords: orthogonal packing problem
zbMATH Keywords: interval graph
zbMATH Keywords: MP Q-tree
MaRDI profile type: Publication
full work available at URL: j.endm.2010.05.054
OpenAlex ID: W2089327004
cites work: A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Q3875975
cites work: On the two-dimensional knapsack problem
cites work: New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
cites work: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
cites work: A new exact method for the two-dimensional orthogonal packing problem
cites work: A new constraint programming approach for the orthogonal packing problem
cites work: An Exact Algorithm for Higher-Dimensional Orthogonal Packing
cites work: An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
DOI: 10.1016/J.ENDM.2010.05.054
Recommended article: MPQ-trees for the orthogonal packing problem
Recommended article: Efficient algorithms for orthogonal packing problems
Recommended article: Q3838010
Recommended article: Approximation algorithms for orthogonal packing problems for hypercubes
Recommended article: A new constraint programming approach for the orthogonal packing problem
Recommended article: An Exact Algorithm for Higher-Dimensional Orthogonal Packing
Recommended article: LP bounds in various constraint programming approaches for orthogonal packing
Recommended article: Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
Recommended article: Approximating the Orthogonal Knapsack Problem for Hypercubes
Recommended article: A new search procedure for the two-dimensional orthogonal packing problem
description: scientific article; zbMATH DE number 6033952