One‐dimensional relaxations and LP bounds for orthogonal packing

International Transactions in Operational Research, 2009 - Wiley Online Library
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 …

[PDF][PDF] One-Dimensional Relaxations and LP Bounds for Orthogonal Packing

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 …

One-dimensional relaxations and LP bounds for orthogonal packing.

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 …

[PDF][PDF] One-Dimensional Relaxations and LP Bounds for Orthogonal Packing

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 …

[PDF][PDF] One-dimensional relaxations and LP bounds for orthogonal packing

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 …

One-dimensional relaxations and LP bounds for orthogonal packing

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 …

[引用][C] One-dimensional relaxations and LP bounds for orthogonal packing

G Belov, H Rohling, G Scheithauer… - … Transactions in Operational …, 2009 - elibrary.ru

[PDF][PDF] One-Dimensional Relaxations and LP Bounds for Orthogonal Packing

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 …

[PDF][PDF] One-Dimensional Relaxations and LP Bounds for Orthogonal Packing

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 …