Pages that link to "Item:Q3157744"
From MaRDI portal
The following pages link to A simple and effective recursive procedure for the manufacturer's pallet loading problem (Q3157744):
Displayed 17 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)
- A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (Q1847196) (← links)
- Optimization of the distribution of small scale linear Fresnel reflectors on roofs of urban buildings (Q2295861) (← 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)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- The pallet loading problem: a review of solution methods and computational experiments (Q2803259) (← links)
- A two-stage packing problem procedure (Q2968485) (← links)
- The pinwheel pattern and its application to the manufacturer's pallet-loading problem (Q3401334) (← links)
- Um método heurístico baseado em relaxação Lagrangiana para o problema de carregamento de paletes do produtor (Q5189098) (← links)
- Analysis of upper bounds for the pallet loading problem (Q5939589) (← links)
- Exact approaches for the unconstrained two-dimensional cutting problem with defects (Q6068735) (← links)