Pages that link to "Item:Q2459405"
From MaRDI portal
The following pages link to PERM for solving circle packing problem (Q2459405):
Displaying 16 items.
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528) (← links)
- A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← links)
- An action-space-based global optimization algorithm for packing circles into a square container (Q337511) (← links)
- Quasi-physical global optimization method for solving the equal circle packing problem (Q350865) (← links)
- A new heuristic algorithm for the circular packing problem with equilibrium constraints (Q350917) (← links)
- Global optimization method for finding dense packings of equal circles in a circle (Q541690) (← links)
- A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
- A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396) (← 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)
- A new quasi-human algorithm for solving the packing problem of unit equilateral triangles (Q1723821) (← links)
- Adaptive large neighborhood search for solving the circle bin packing problem (Q2027009) (← links)
- Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
- Adaptive simulated annealing with greedy search for the circle bin packing problem (Q2147115) (← links)
- Solving circle permutation packing problem (Q2860983) (← links)
- Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608) (← links)
