67 search results - page 3 / 14 » Solving Shortest Capacitated Path Problem Using a Bi-Objecti... |
TON
2008
13 years 5 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
JCM
2007
13 years 5 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
W2GIS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
CAV
2001
Springer
13 years 10 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
IPCO
2007
13 years 7 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...