Pages that link to "Item:Q5939589"

The following pages link to Analysis of upper bounds for the pallet loading problem (Q5939589):

Displaying 12 items.

• A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem (Q296576) (← links)
• The minimum size instance of a Pallet Loading Problem equivalence class (Q858408) (← links)
• Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
• A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
• The geometry of nesting problems: a tutorial (Q2384608) (← links)
• Solving the pallet loading problem (Q2384612) (← links)
• Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem (Q2566944) (← links)
• The pallet loading problem: a review of solution methods and computational experiments (Q2803259) (← links)
• One-dimensional relaxations and LP bounds for orthogonal packing (Q3401330) (← links)
• The pinwheel pattern and its application to the manufacturer's pallet-loading problem (Q3401334) (← links)
• A global optimization approach for solving three-dimensional open dimension rectangular packing problems (Q3453421) (← links)
• MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS (Q5291406) (← links)