Pages that link to "Item:Q1127229"
From MaRDI portal
The following pages link to Packing different-sized circles into a rectangular container (Q1127229):
Displayed 29 items.
- A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
- Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (Q623818) (← links)
- A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396) (← links)
- Simplest optimal guillotine cutting patterns for strips of identical circles (Q927192) (← links)
- Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
- A beam search algorithm for the circular packing problem (Q960400) (← links)
- A dual-response forwarding approach for containerizing air cargoes under uncertainty, based on stochastic mixed 0-1 programming (Q992591) (← links)
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems (Q1029695) (← links)
- Cutting circles and polygons from area-minimizing rectangles (Q1029696) (← links)
- Effective methods for a container packing operation (Q1361222) (← links)
- Approximate algorithms for constrained circular cutting problems (Q1433164) (← links)
- An improved algorithm for the packing of unequal circles within a larger containing circle (Q1847187) (← links)
- A simulated annealing approach for the circular cutting problem (Q1876197) (← links)
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip (Q1877898) (← links)
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach (Q1887860) (← links)
- A family of genetic algorithms for the pallet loading problem (Q1919852) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle (Q2387245) (← links)
- PERM for solving circle packing problem (Q2459405) (← links)
- Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
- New heuristics for packing unequal circles into a circular container (Q2489278) (← links)
- Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors (Q2569094) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- A dynamic adaptive local search algorithm for the circular packing problem (Q2643959) (← links)
- A bi-objective guillotine cutting problem of stamping strips of equal circles (Q3056407) (← links)
- GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID (Q3114612) (← links)
- A model to design recreational boat mooring fields (Q3621925) (← links)
- Applying genetic algorithms and neural networks to the container loading problem (Q4469156) (← links)
- Cylinder packing by simulated annealing (Q5189102) (← links)