The rectangle packing problem often appears in encasement and cutting as well as very large-scale integration design. To solve this problem, many algorithms such as genetic algorithm, simulatedâ€¦ (More)

We propose two new heuristics to pack unequal circles into a t wo dimensional circular container. The first one, denoted by A1.0, is a basic heurisitc wh ich selects the next circle to placeâ€¦ (More)

Given an undirected graph G=(V ,E), the Graph Coloring Problem (GCP) consists in assigning a color to each vertex of the graph G in such a way t h t any two adjacent vertices are assigned differentâ€¦ (More)

In this paper, a global optimization method is presented to determine the global-minimum structures of atomic clusters, where several already existing techniques are combined, such as the dynamicâ€¦ (More)

Proceedings of 2011 International Conference onâ€¦

2011

This paper studies the Arbitrary Sized Circle Packing Problem (ACP) which concerns how to pack a number of arbitrary sized circles into a circular container without overlap. As a classical NP-hardâ€¦ (More)

In this paper, an efficient heuristic algorithm for geometry optimization of bimetallic clusters is proposed. The algorithm is mainly composed of three ingredients: the monotonic basin-hopping methodâ€¦ (More)

The arbitrary sized circle packing problem (ACP) is concerned about how to pack a number of arbitrary sized circles into a smallest possible circular container without overlapping. As a classicalâ€¦ (More)

We propose a two-level search strategy to solve a two dimensional circle packing problem. At the first level, a good enough packing algorithm called A1.0 uses a simple heuristic to select the nextâ€¦ (More)