Pages that link to "Item:Q1086163"
From MaRDI portal
The following pages link to Determining an upper bound for a class of rectangular packing problems (Q1086163):
Displayed 13 items.
- A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem (Q296576) (← links)
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
- Ein neuer Ansatz zur Bestimmung theoretischer Obergrenzen für das zweidimensionale orthogonale homogene Packproblem. (A new approach to the determination of theoretical upper bounds for the two-dimensional orthogonal homogeneous packing problem) (Q1182229) (← links)
- Packing problems (Q1197916) (← links)
- A branch-and-cut algorithm for the pallet loading problem (Q1781574) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- A simulated annealing approach to the nesting problem in the textile manufacturing industry (Q1897378) (← links)
- Solving the pallet loading problem (Q2384612) (← links)
- The pallet loading problem: a review of solution methods and computational experiments (Q2803259) (← links)
- Upper bounds for the homogeneous case of a two-dimensional packing problem (Q3352854) (← links)
- The pinwheel pattern and its application to the manufacturer's pallet-loading problem (Q3401334) (← 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)