MPQ-trees for the Orthogonal Packing Problem

ISSN： 1570-1166

Source： Journal of Mathematical Modelling and Algorithms, Vol.11, Iss.1, 2012-03, pp. : 3-22

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Fuzzy bin packing problem

By Kim J.-K. Lee-Kwang H. W. Yoo S.

Fuzzy Sets and Systems, Vol. 120, Iss. 3, 2001-06 ,pp. : 429-434

Elsevier

Access to resources Recommend Favorite

A Note on a Packing Problem in Transitive Tournaments

By Görlich Agnieszka Pilśniak Monika Woźniak Mariusz

Graphs and Combinatorics, Vol. 22, Iss. 2, 2006-06 ,pp. : 233-239

Springer Publishing Company

Access to resources Recommend Favorite

Packing algorithms for arborescences (and spanning trees) in capacitated graphs

By Gabow H.N. Manu K.S.

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 83-109

Elsevier

Access to resources Recommend Favorite

A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems

By Fekete Sándor P.

Mathematical Methods of Operations Research, Vol. 60, Iss. 2, 2004-10 ,pp. : 311-329

Springer Publishing Company

Access to resources Recommend Favorite

Consecutive Ones Matrices for Multi-dimensional Orthogonal Packing Problems

By Joncour Cédric

Journal of Mathematical Modelling and Algorithms, Vol. 11, Iss. 1, 2012-03 ,pp. : 23-44

Springer Publishing Company

Access to resources Recommend Favorite