Reformulation descent applied to circle packing problems

DOI10.1016/j.cor.2004.03.010zbMath1066.90092OpenAlexW2058582911WikidataQ57254153 ScholiaQ57254153MaRDI QIDQ1772872

Nenad Mladenović, Frank Plastria, Dragan Urošević

Publication date: 21 April 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2004.03.010

zbMATH Keywords

Global optimization Metaheuristics Circle packing Minos Reformulation descent

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Dense packing of congruent circles in free-form non-convex containers, Graph colouring approaches for a satellite range scheduling problem, Variable neighbourhood search for bandwidth reduction, Adaptive simulated annealing with greedy search for the circle bin packing problem, A formulation space search heuristic for packing unequal circles in a fixed size circular container, A dynamic adaptive local search algorithm for the circular packing problem, An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, New and improved results for packing identical unitary radius circles within triangles, rectangles and strips, Evolutionary computation solutions to the circle packing problem, A literature review on circle and sphere packing problems: models and methodologies, Variable neighborhood search for metric dimension and minimal doubly resolving set problems, Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches, In memory of Professor Nenad Mladenović (1951--2022), Spreading points using gradient and tabu, Iterated dynamic neighborhood search for packing equal circles on a sphere, Variable neighborhood search: the power of change and simplicity, A heuristic for the circle packing problem with a variety of containers, Variable neighborhood search: basics and variants, A note on solving MINLP's using formulation space search, Solving circle packing problems by global optimization: numerical results and industrial applications, PERM for solving circle packing problem, Adaptive beam search lookahead algorithms for the circular packing problem, Minimizing the object dimensions in circle and sphere packing problems, Variable space search for graph coloring, Solving the maximum min-sum dispersion by alternating formulations of two different problems, A beam search algorithm for the circular packing problem, Adaptive and restarting techniques-based algorithms for circular packing problems, A new local search for continuous location problems, 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, Variable neighbourhood search: methods and applications, Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization, Reformulations in Mathematical Programming: Definitions and Systematics, Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)], Variable neighbourhood search: Methods and applications, Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times, 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, A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure

Uses Software

MINOS

Cites Work