Beam search and non-linear programming tools for the circular packing problem
From MaRDI portal
Recommendations
- A beam search algorithm for the circular packing problem
- Adaptive beam search lookahead algorithms for the circular packing problem
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- A beam search implementation for the irregular shape packing problem
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- Formulation Space Search for Circle Packing Problems
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Mixed-integer DC programming based algorithms for the circular packing problem
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
Cited in
(11)- A dynamic adaptive local search algorithm for the circular packing problem
- A local search-based method for sphere packing problems
- Solving the circular open dimension problem by using separate beams and look-ahead strategies
- Adaptive and restarting techniques-based algorithms for circular packing problems
- Packing unit spheres into a cube using VNS
- A beam search algorithm for the circular packing problem
- Adaptive beam search lookahead algorithms for the circular packing problem
- Evolutionary computation solutions to the circle packing problem
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- A literature review on circle and sphere packing problems: models and methodologies
This page was built for publication: Beam search and non-linear programming tools for the circular packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q843379)
