Pages that link to "Item:Q4933609"
From MaRDI portal
The following pages link to An effective recursive partitioning approach for the packing of identical rectangles in a rectangle (Q4933609):
Displaying 14 items.
- A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem (Q296576) (← links)
- A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
- Minimum tiling of a rectangle by squares (Q1730580) (← links)
- Three-dimensional container loading models with cargo stability and load bearing constraints (Q1761946) (← links)
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (Q1761965) (← links)
- Symmetry-breaking constraints for packing identical rectangles within polyhedra (Q1940443) (← links)
- Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
- Optimization of the distribution of small scale linear Fresnel reflectors on roofs of urban buildings (Q2295861) (← links)
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns (Q2351163) (← links)
- The pallet loading problem: a review of solution methods and computational experiments (Q2803259) (← links)
- A simple and effective recursive procedure for the manufacturer's pallet loading problem (Q3157744) (← links)
- The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers (Q6069766) (← links)
