Pages that link to "Item:Q711396"
From MaRDI portal
The following pages link to A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396):
Displaying 11 items.
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528) (← links)
- Solving the circular open dimension problem by using separate beams and look-ahead strategies (Q502428) (← links)
- Beam search and non-linear programming tools for the circular packing problem (Q843379) (← links)
- A beam search algorithm for the circular packing problem (Q960400) (← links)
- A beam search implementation for the irregular shape packing problem (Q964846) (← links)
- Adaptive algorithms for circular cutting/packing problems (Q1040631) (← 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 beam search approach to solve the convex irregular bin packing problem with guillotine guts (Q1754728) (← links)
- Adaptive large neighborhood search for solving the circle bin packing problem (Q2027009) (← links)
- Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543) (← links)