11371 search results - page 128 / 2275 » The network inhibition problem |
156
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
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...
183
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
This paper deals with the design of improved construction heuristics and iterated local search for the Routing and Wavelength Assignment problem (RWA). Given a physical network and...
171
click to vote
JAL
2006
15 years 6 months ago
2006
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
204
click to vote
MOR
2000
15 years 6 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
215
click to vote
OR
2007
Springer
15 years 6 months ago
2007
Springer
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhan...