Sciweavers

172 search results - page 4 / 35
» Program generation for the all-pairs shortest path problem
Sort
View
HEURISTICS
2002
62views more  HEURISTICS 2002»
13 years 7 months ago
Soft Constraint Logic Programming and Generalized Shortest Path Problems
Stefano Bistarelli, Ugo Montanari, Francesca Rossi
CATA
2004
13 years 9 months ago
Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
Fred J. Rispoli, Steven Cosares
HEURISTICS
2002
155views more  HEURISTICS 2002»
13 years 7 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz
ASIAMS
2007
IEEE
14 years 1 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