30 search results - page 1 / 6 » Comparison of the Exact and Approximate Algorithms in the Ra... |
IFIP
2007
Springer
15 years 9 months ago
2007
Springer
150
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
111
click to vote
ICCSA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
142
click to vote
NETWORKS
2008
15 years 2 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
140
click to vote
ESA
2000
Springer
15 years 6 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...