Sciweavers

279 search results - page 2 / 56
» Reduction approaches for robust shortest path problems
Sort
View
AAAI
2004
13 years 6 months ago
Shortest Path Discovery Problems: A Framework, Algorithms and Experimental Results
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
Csaba Szepesvári
ASIAMS
2007
IEEE
13 years 11 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
13 years 8 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
CPAIOR
2009
Springer
13 years 11 months ago
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan