3678 search results - page 94 / 736 » On the Stable Paths Problem |
119
Voted
JAL
2006
15 years 21 days ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
MICS
2010
14 years 11 months ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
111
Voted
IAT
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we tackle learning in distributed systems and the fact that learning does not necessarily involve the participation of agents directly in the inductive process itse...
110
click to vote
JCO
2007
15 years 19 days ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
104
click to vote
HEURISTICS
2000
15 years 16 days ago
2000
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertice...