Disk Packing in a Square: A New Global Optimization Approach
From MaRDI portal
Publication:2901032
DOI10.1287/ijoc.1080.0263zbMath1243.90084OpenAlexW2095937663MaRDI QIDQ2901032
Bernardetta Addis, Fabio Schoen, Marco Locatelli
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/48ccf0b734681255381fb30487aefae15d1ba109
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Combinatorial aspects of packing and covering (05B40)
Related Items
Uniformity of Point Samples in Metric Spaces Using Gap Ratio, Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container, Differential evolution methods based on local searches, An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container, Computational investigation of simple memetic approaches for continuous global optimization, A literature review on circle and sphere packing problems: models and methodologies, Local search based heuristics for global optimization: atomic clusters and beyond, Greedy vacancy search algorithm for packing equal circles in a square, Spreading points using gradient and tabu, Assessing Basin Identification Methods for Locating Multiple Optima, Iterated dynamic neighborhood search for packing equal circles on a sphere, A heuristic approach for packing identical rectangles in convex regions, Feasibility in reverse convex mixed-integer programming, Efficiently packing unequal disks in a circle, A new quasi-human algorithm for solving the packing problem of unit equilateral triangles, Damped Arrow-Hurwicz algorithm for sphere packing, A global optimization method for the design of space trajectories, Global optimization method for finding dense packings of equal circles in a circle, Solving the problem of packing equal and unequal circles in a circular container, Orientational variable-length strip covering problem: a branch-and-price-based algorithm, Clustering methods for large scale geometrical global optimization, Iterated dynamic thresholding search for packing equal circles into a circular container, Global Optimization Approaches for Optimal Trajectory Planning
Uses Software
