G Belov, V Kartak, H Rohling, G Scheithauer - 2009 - Citeseer
We consider the feasibility problem in d-dimensional orthogonal packing (d≥ 2), called Orthogonal Packing Problem (OPP): given a set of ddimensional rectangular items, decide …
G Belov, V Kartak, H Rohling… - International …, 2009 - search.ebscohost.com
We consider the feasibility problem in d-dimensional orthogonal packing (d⩾ 2), called the Orthogonal Packing Problem (OPP): given a set of d-dimensional rectangular items, decide …
G Belov, V Kartak, H Rohling, G Scheithauer - 2009 - researchgate.net
We consider the feasibility problem in d-dimensional orthogonal packing (d≥ 2), called Orthogonal Packing Problem (OPP): given a set of ddimensional rectangular items, decide …
G Belova, V Kartakb, H Rohlinga, G Scheithauera - 2009 - academia.edu
We consider the feasibility problem in d-dimensional orthogonal packing (dX2), called the Orthogonal Packing Problem (OPP): given a set of d-dimensional rectangular items, decide …
G Belov, V Kartak, H Rohling… - International …, 2009 - research.monash.edu
We consider the feasibility problem in d-dimensional orthogonal packing (d2), called the Orthogonal Packing Problem (OPP): given a set of d-dimensional rectangular items, decide …
G Belov, V Kartak, H Rohling, G Scheithauer - 2009 - Citeseer
We consider the feasibility problem in d-dimensional orthogonal packing (d≥ 2), called Orthogonal Packing Problem (OPP): given a set of ddimensional rectangular items, decide …
G Belov, V Kartak, H Rohling, G Scheithauer - 2009 - researchgate.net
We consider the feasibility problem in d-dimensional orthogonal packing (d≥ 2), called Orthogonal Packing Problem (OPP): given a set of ddimensional rectangular items, decide …