Pages that link to "Item:Q4717141"
From MaRDI portal
The following pages link to The G4-Heuristic for the Pallet Loading Problem (Q4717141):
Displayed 36 items.
- A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem (Q296576) (← links)
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
- The multiple container loading cost minimization problem (Q635154) (← links)
- Logistic constraints in container loading problems: the impact of complete shipment conditions (Q828763) (← 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)
- Computing stable loads for pallets (Q992703) (← links)
- 4-block heuristic for the rectangle packing problem (Q1296784) (← links)
- The cutting stock problem in a hardboard industry: A case study. (Q1406647) (← links)
- An efficient approach for the multi-pallet loading problem (Q1569940) (← links)
- Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles (Q1580968) (← 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)
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems (Q1991111) (← links)
- Grids for cutting and packing problems: a study in the 2D knapsack problem (Q2025135) (← links)
- Practical constraints in the container loading problem: comprehensive formulations and exact algorithm (Q2027076) (← links)
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem (Q2099494) (← links)
- The exact solutions of several types of container loading problems (Q2301942) (← links)
- Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns (Q2351163) (← 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)
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts (Q2675700) (← 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)
- The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← 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)
- A fast algorithm for two-dimensional pallet loading problems of large size (Q5945208) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
- Exact approaches for the unconstrained two-dimensional cutting problem with defects (Q6068735) (← links)
- The static stability of support factor‐based rectangular packings: an assessment by regression analysis (Q6092535) (← links)
- The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids (Q6094360) (← links)