Pages that link to "Item:Q843379"
From MaRDI portal
The following pages link to Beam search and non-linear programming tools for the circular packing problem (Q843379):
Displaying 11 items.
- Solving the circular open dimension problem by using separate beams and look-ahead strategies (Q502428) (← 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)
- A beam search algorithm for the circular packing problem (Q960400) (← links)
- A local search-based method for sphere packing problems (Q1634289) (← links)
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts (Q1754728) (← links)
- Evolutionary computation solutions to the circle packing problem (Q2402110) (← 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)
- Packing unit spheres into a cube using VNS (Q2840774) (← links)
- Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543) (← links)