Formulation Space Search for Circle Packing Problems.

Autor: Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Pandu Rangan, C., Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Stützle, Thomas, Birattari, Mauro, H. Hoos, Holger, Mladenović, Nenad, Plastria, Frank
Zdroj: Engineering Stochastic Local Search Algorithms. Designing, Implementing & Analyzing Effective Heuristics; 2007, p212-216, 5p
Abstrakt: 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. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index