Packing unequal circles using formulation space search
From MaRDI portal
Publication:502435
DOI10.1016/j.cor.2012.11.022zbMath1352.90085OpenAlexW2110602201MaRDI QIDQ502435
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
Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items
Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container, A formulation space search heuristic for packing unequal circles in a fixed size circular container, An action-space-based global optimization algorithm for packing circles into a square container, An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container, 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, A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints, Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches, Integer programming formulations for approximate packing circles in a rectangular container, A note on solving MINLP's using formulation space search, Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting, Packing circular-like objects in a rectangular container, Iterated dynamic thresholding search for packing equal circles into a circular container, Packing a fixed number of identical circles in a circular container with circular prohibited areas
