Two-dimensional packing with conflicts

Author： Epstein Leah   Levin Asaf   Stee Rob  

Publisher： Springer Publishing Company

ISSN： 0001-5903

Source： Acta Informatica, Vol.45, Iss.3, 2008-05, pp. : 155-175

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

Related content

An effective heuristic for the two-dimensional irregular bin packing problem

By López-Camacho Eunice  

Annals of Operations Research, Vol. 206, Iss. 1, 2013-07 ,pp. : 241-264

Springer Publishing Company

Access to resources Recommend Favorite

An Efficient Processor Allocation Algorithm Using Two-Dimensional Packing

By Hwang I.  

Journal of Parallel and Distributed Computing, Vol. 42, Iss. 1, 1997-04 ,pp. : 75-81

Academic Press

Access to resources Recommend Favorite

Two-dimensional on-line bin packing problem with rotatable items

By Fujita S.   Hada T.  

Theoretical Computer Science, Vol. 289, Iss. 2, 2002-10 ,pp. : 939-952

Elsevier

Access to resources Recommend Favorite

Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem

By Segredo Eduardo   Segura Carlos   León Coromoto  

Journal of Global Optimization, Vol. 58, Iss. 4, 2014-04 ,pp. : 769-794

Springer Publishing Company

Access to resources Recommend Favorite

Two-Dimensional partitioning problems

By Middendorf M.  

Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. : 73-106

Elsevier

Access to resources Recommend Favorite