5624 search results - page 187 / 1125 » On Conditional Covering Problem |
167
click to vote
COCOON
2008
Springer
15 years 8 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...
192
click to vote
MP
2006
15 years 6 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...
189
click to vote
APPROX
2009
Springer
16 years 1 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...
166
click to vote
IJLIT
2010
15 years 5 months ago
2010
Whereas abandonment of detailed regulation is widely asserted to be the true way along with the fluctuations of the business models and emergence of IP-based services, there are s...
151
click to vote
JCIT
2010
15 years 1 months ago
2010
This review paper presents an overview of the current state of the art in Problem Solving Environments (PSE). PSE provides integrated human-friendly innovative computational servi...