Pages that link to "Item:Q3002543"
From MaRDI portal
The following pages link to Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543):
Displaying 12 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)
- A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396) (← 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)
- Adaptive algorithms for circular cutting/packing problems (Q1040631) (← 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)
- Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
- A dynamic adaptive local search algorithm for the circular packing problem (Q2643959) (← links)
- Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608) (← links)
- A filtered beam search based heuristic algorithm for packing unit circles into a circular container (Q6568430) (← links)