Pages that link to "Item:Q499146"
From MaRDI portal
The following pages link to Packing circular-like objects in a rectangular container (Q499146):
Displaying 26 items.
- Cutting circles and polygons from area-minimizing rectangles (Q1029696) (← links)
- Packing different-sized circles into a rectangular container (Q1127229) (← links)
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
- Integer programming formulations for approximate packing circles in a rectangular container (Q1718120) (← links)
- Best packing of rods into boxes (Q1896361) (← links)
- Optimized packing multidimensional hyperspheres: a unified approach (Q1979535) (← links)
- Optimized filling of a given cuboid with spherical powders for additive manufacturing (Q2059194) (← links)
- A support tool for planning classrooms considering social distancing between students (Q2065002) (← links)
- Parallel computing technologies for solving optimization problems of geometric design (Q2174043) (← links)
- Packing ellipsoids in an optimized cylinder (Q2183847) (← links)
- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches (Q2184044) (← links)
- Packing ellipses in an optimized convex polygon (Q2274890) (← links)
- Irregular packing problems: a review of mathematical models (Q2286866) (← links)
- Optimized packing clusters of objects in a rectangular container (Q2298400) (← links)
- On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container (Q2299015) (← links)
- Optimized ellipse packings in regular polygons (Q2329677) (← links)
- Packing non-identical circles within a rectangle with open length (Q2392114) (← links)
- Minimizing the object dimensions in circle and sphere packing problems (Q2468491) (← links)
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
- Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting (Q4634978) (← links)
- Decomposition Algorithm for Irregular Placement Problems (Q5117305) (← links)
- Packing Convex 3D Objects with Special Geometric and Balancing Conditions (Q5117307) (← links)
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem (Q5117310) (← links)
- Proportional packing of circles in a circular container (Q6160555) (← links)
- The concept of modeling packing and covering problems using modern computational geometry software (Q6160558) (← links)
- A skyline-based heuristic for orthogonal packing rectangles in a circle (Q6568481) (← links)