A filtered beam search based heuristic algorithm for packing unit circles into a circular container
From MaRDI portal
Publication:6568430
DOI10.1016/J.COR.2024.106636MaRDI QIDQ6568430
Xicheng Peng, Mao Chen, Yajing Yang, Xiangyang Tang, Zeyu Zeng, Sannuya Liu
Publication date: 8 July 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Packing congruent hyperspheres into a hypersphere
- Global optimization method for finding dense packings of equal circles in a circle
- A literature review on circle and sphere packing problems: models and methodologies
- Combinatorial configurations in balance layout optimization problems
- Solving circle packing problems by global optimization: numerical results and industrial applications
- A beam search algorithm for the circular packing problem
- Solving the problem of packing equal and unequal circles in a circular container
- Unsolved problems in geometry
- The densest packing of 19 congruent circles in a circle
- Densest packings of eleven congruent circles in a circle
- Dense packings of congruent circles in a circle
- The densest packing of 12 congruent circles in a circle
- Improving dense packings of equal disks in a square
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
- Integer programming formulations for approximate packing circles in a rectangular container
- Reformulation descent applied to circle packing problems
- Job shop scheduling with beam search
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Optimized packing multidimensional hyperspheres: a unified approach
- Iterated dynamic thresholding search for packing equal circles into a circular container
- Linear models for the approximate solution of the problem of packing equal circles into a given domain
- New heuristics for packing unequal circles into a circular container
- Adaptive beam search lookahead algorithms for the circular packing problem
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Greedy algorithms for packing unequal circles into a rectangular container
- Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten
- Discrete and Computational Geometry
This page was built for publication: A filtered beam search based heuristic algorithm for packing unit circles into a circular container
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568430)
