Pages that link to "Item:Q1253663"
From MaRDI portal
The following pages link to Packing the maximum number of \(m\times n\) tiles in a large \(p\times q\) rectangle (Q1253663):
Displaying 18 items.
- Network flows and non-guillotine cutting patterns (Q795062) (← links)
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
- Determining an upper bound for a class of rectangular packing problems (Q1086163) (← links)
- How to use structural constraints to compute an upper bound for the pallet loading problem (Q1127224) (← links)
- Minimum cost partitions of a rectangle (Q1159208) (← links)
- Simply-transitive homothety groups (Q1177046) (← 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)
- How many \(1\times 2\times 4\) bricks can you get into an odd box? (Q1336686) (← links)
- An exact algorithm for the pallet loading problem (Q1820701) (← links)
- Algebraic theory of brick packing. II (Q1836392) (← links)
- Best packing of rods into boxes (Q1896361) (← links)
- Solving the pallet loading problem (Q2384612) (← links)
- The pallet loading problem: a review of solution methods and computational experiments (Q2803259) (← links)
- Determining the best shipper sizes for sending products to customers (Q2803267) (← links)
- Upper bounds for the homogeneous case of a two-dimensional packing problem (Q3352854) (← 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)
