Pages that link to "Item:Q3372537"

The following pages link to A note on an <i>L</i>-approach for solving the manufacturer's pallet loading problem (Q3372537):

Displaying 9 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)
• Layer-layout-based heuristics for loading homogeneous items into a single container (Q926048) (← links)
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
• Symmetry-breaking constraints for packing identical rectangles within polyhedra (Q1940443) (← links)
• On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns (Q2351163) (← links)
• Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization (Q2496055) (← links)
• The pallet loading problem: a review of solution methods and computational experiments (Q2803259) (← links)