Pages that link to "Item:Q1040631"
From MaRDI portal
The following pages link to Adaptive algorithms for circular cutting/packing problems (Q1040631):
Displaying 6 items.
- A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396) (← links)
- A beam search algorithm for the circular packing problem (Q960400) (← links)
- Approximate algorithms for constrained circular cutting problems (Q1433164) (← links)
- Adaptive large neighborhood search for solving the circle bin packing problem (Q2027009) (← links)
- A dynamic adaptive local search algorithm for the circular packing problem (Q2643959) (← links)
- Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543) (← links)