Pages that link to "Item:Q4661079"

The following pages link to An <i>L</i>-approach for packing (<i>ℓ</i>, <i>w</i>)-rectangles into rectangular and <i>L</i>-shaped pieces (Q4661079):

Displaying 16 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 best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
• Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
• Three-dimensional container loading models with cargo stability and load bearing constraints (Q1761946) (← links)
• A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
• Phorma: perfectly hashable order restricted multidimensional arrays (Q1827865) (← links)
• Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
• On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns (Q2351163) (← links)
• Solving the pallet loading problem (Q2384612) (← links)
• Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization (Q2496055) (← 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)
• The pinwheel pattern and its application to the manufacturer's pallet-loading problem (Q3401334) (← links)
• Exact approaches for the unconstrained two-dimensional cutting problem with defects (Q6068735) (← links)