Formulation space search for circle packing problems

Authors:
Nenad Mladenović;Frank Plastria;Dragan Urošević
Affiliations:
School of Mathematics, Brunel University, West London, UK;Vrije Universiteit Brussel, Brussel, Belgium;Mathematical Instiute SANU, Belgrade, Serbia
Venue:
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Year:
2007

Citing 2
Cited 4

Variable neighborhood search

Computers and Operations Research
Reformulation descent applied to circle packing problems

Computers and Operations Research

A Vector Assignment Approach for the Graph Coloring Problem

Learning and Intelligent Optimization
A probability collectives approach with a feasibility-based rule for constrained optimization

Applied Computational Intelligence and Soft Computing
Packing unequal circles using formulation space search

Computers and Operations Research
Variable Formulation Search for the Cutwidth Minimization Problem

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Circle packing problems were recently solved via reformulation descent (RD) by switching between a cartesian and a polar formulation. Mixed formulations, with circle parameters individually formulated in either coordinate system, lead to local search methods in a formulation space. Computational results with up to 100 circles are included.