Packing unequal circles using formulation space search
From MaRDI portal
Publication:502435
DOI10.1016/J.COR.2012.11.022zbMATH Open1352.90085OpenAlexW2110602201MaRDI QIDQ502435FDOQ502435
Authors: C. O. López, J. E. Beasley 
Publication date: 5 January 2017
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.11.022
Recommendations
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- A heuristic for the circle packing problem with a variety of containers
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- New heuristics for packing unequal circles into a circular container
- An improved algorithm for the packing of unequal circles within a larger containing circle
Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Cited In (27)
- New heuristics for packing unequal circles into a circular container
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- Integer programming formulations for approximate packing circles in a rectangular container
- Title not available (Why is that?)
- Variable neighborhood formulation space search for circle packing
- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
- A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints
- A memetic algorithm to pack unequal circles into a square
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Iterated dynamic thresholding search for packing equal circles into a circular container
- Greedy algorithms for packing unequal circles into a rectangular container
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- An action-space-based global optimization algorithm for packing circles into a square container
- Formulation Space Search for Circle Packing Problems
- A heuristic for the circle packing problem with a variety of containers
- Approximate packing: integer programming models, valid inequalities and nesting
- Efficiently packing unequal disks in a circle
- Title not available (Why is that?)
- Solving the problem of packing equal and unequal circles in a circular container
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Packing circular-like objects in a rectangular container
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
- Packing non-identical circles within a rectangle with open length
- Quasi-human seniority-order algorithm for unequal circles packing
- A note on solving MINLP's using formulation space search
- Packing unequal circles into a strip of minimal length with a jump algorithm
This page was built for publication: Packing unequal circles using formulation space search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q502435)
