1424 search results - page 88 / 285 » The Multi-radius Cover Problem |
106
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
110
Voted
COCOON
2008
Springer
15 years 2 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
121
Voted
MP
2006
15 years 1 months ago
2006
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
123
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
118
Voted
SIROCCO
2004
15 years 2 months ago
2004
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...