Pages that link to "Item:Q1433164"
From MaRDI portal
The following pages link to Approximate algorithms for constrained circular cutting problems (Q1433164):
Displaying 27 items.
- A knowledge-based heuristic particle swarm optimization approach with the adjustment strategy for the weighted circle packing problem (Q316266) (← links)
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528) (← links)
- An anchorage planning strategy with safety and utilization considerations (Q337616) (← links)
- High density packings of equal circles in rectangles with variable aspect ratio (Q339540) (← links)
- 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)
- 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 local search-based method for sphere packing problems (Q1634289) (← links)
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container (Q1651580) (← links)
- A memetic algorithm to pack unequal circles into a square (Q1651582) (← links)
- Adaptive large neighborhood search for solving the circle bin packing problem (Q2027009) (← links)
- Adaptive simulated annealing with greedy search for the circle bin packing problem (Q2147115) (← links)
- Convex maximization formulation of general sphere packing problem (Q2307930) (← links)
- Packing non-identical circles within a rectangle with open length (Q2392114) (← links)
- Valid constraints for the Point Packing in a Square problem (Q2446880) (← links)
- Packing unequal circles into a strip of minimal length with a jump algorithm (Q2448172) (← links)
- PERM for solving circle packing problem (Q2459405) (← links)
- Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors (Q2460106) (← 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)
- 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)
- Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary (Q5090167) (← links)
