A beam search algorithm for the circular packing problem
From MaRDI portal
Recommendations
- Adaptive beam search lookahead algorithms for the circular packing problem
- Beam search and non-linear programming tools for the circular packing problem
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- A dynamic adaptive local search algorithm for the circular packing problem
- Adaptive algorithms for circular cutting/packing problems
Cites work
- A beam search algorithm for the load sequencing of outbound containers in port container terminals
- A dynamic adaptive local search algorithm for the circular packing problem
- A new upper bound for the cylinder packing problem
- A simulated annealing approach for the circular cutting problem
- Adaptive algorithms for circular cutting/packing problems
- Adaptive and restarting techniques-based algorithms for circular packing problems
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- An improved algorithm for the packing of unequal circles within a larger containing circle
- An improved typology of cutting and packing problems
- Approximate algorithms for constrained circular cutting problems
- Curved hexagonal packings of equal disks in a circle
- Disk packing for the estimation of the size of a wire bundle
- Greedy algorithms for packing unequal circles into a rectangular container
- Job shop scheduling with beam search
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Minimizing the object dimensions in circle and sphere packing problems
- New heuristics for packing unequal circles into a circular container
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Packing different-sized circles into a rectangular container
- Reformulation descent applied to circle packing problems
- Repeated patterns of dense packings of equal disks in a square
Cited in
(19)- A dynamic adaptive local search algorithm for the circular packing problem
- Solving the circular open dimension problem by using separate beams and look-ahead strategies
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
- Approximation schemes for covering and packing problems in image processing and VLSI
- Adaptive and restarting techniques-based algorithms for circular packing problems
- Beam search and non-linear programming tools for the circular packing problem
- Adaptive beam search lookahead algorithms for the circular packing problem
- A memetic algorithm to pack unequal circles into a square
- Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
- 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
- Solving a large cutting problem in the glass manufacturing industry
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- A literature review on circle and sphere packing problems: models and methodologies
- A filtered beam search based heuristic algorithm for packing unit circles into a circular container
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
- Adaptive algorithms for circular cutting/packing problems
- Adaptive simulated annealing with greedy search for the circle bin packing problem
This page was built for publication: A beam search algorithm for the circular packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960400)
