Formulation Space Search for Circle Packing Problems

DOI10.1007/978-3-540-74446-7_20zbMath1134.90477OpenAlexW1544872009MaRDI QIDQ5429303

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

Publication date: 29 November 2007

Published in: Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74446-7_20

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Variable neighbourhood search for bandwidth reduction, A formulation space search heuristic for packing unequal circles in a fixed size circular container, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, 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, A heuristic for the circle packing problem with a variety of containers, Packing equal circles into a circle with circular prohibited areas, Solving the maximum min-sum dispersion by alternating formulations of two different problems, Variable neighbourhood search: methods and applications, Variable neighbourhood search: Methods and applications, Less is more approach in optimization: a road to artificial intelligence, Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times, 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