Pages that link to "Item:Q1919852"
From MaRDI portal
The following pages link to A family of genetic algorithms for the pallet loading problem (Q1919852):
Displaying 12 items.
- A joint replenishment problem considering multiple trucks with shipment and resource constraints (Q342455) (← links)
- Nature inspired genetic algorithms for hard packing problems (Q610991) (← links)
- Packing different-sized circles into a rectangular container (Q1127229) (← links)
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem (Q1592734) (← 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)
- Metaheuristics: A bibliography (Q1919858) (← links)
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity (Q2404356) (← links)
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem (Q2566944) (← links)
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems (Q2569035) (← 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)