In this work, we investigate the equal circle packing problem on a sphere (ECPOS), which
consists in packing N equal non-overlapping circles on a unit sphere such that the radius of …

The weighted circles packing (WCP) problem typically aims for arranging some circular
objects into a larger rectangular (or circular) container with the constraint of non …

This paper presents an effective perturbation-based thresholding search for two popular and
challenging packing problems with minimal containers: packing N identical circles in a …

The capacitated electric vehicle routing problem (CEVRP) extends the traditional vehicle
routing problem by simultaneously considering the service order of the customers and the …

The problem of packing equal spheres in a spherical container is a classic global
optimization problem, which has attracted enormous studies in academia and found various …

Continuous p-dispersion problems with and without boundary constraints are NP-hard
optimization problems with numerous real-world applications, notably in facility location and …

The problem of packing equal circles in a circular container is a classic and famous packing
problem, which is well-studied in academia and has a variety of applications in industry. The …

Peptide self-assembly is critical for biomedical and material discovery and production. While
it is costly to experimentally test every possible peptide design, computational assessment …

This paper considers the optimized packing of different spheres into a given spherical
container under non-standard placement conditions. A sphere is considered placed in the …

Given a directed graph G=(V, E), a feedback vertex set is a vertex subset C whose removal
makes the graph G acyclic. The feedback vertex set problem is to find the subset C* whose …