Sciweavers

NETWORKS
2007
15 years 25 days ago
Metaheuristics for the vehicle routing problem with loading constraints
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
Karl F. Doerner, Guenther Fuellerer, Richard F. Ha...
NETWORKS
2007
15 years 25 days ago
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
Luigi De Giovanni, Roberto Tadei
NETWORKS
2007
15 years 25 days ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
103
Voted
NETWORKS
2007
15 years 25 days ago
Incremental flow
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
Jeff Hartline, Alexa Sharp
72
Voted
NETWORKS
2007
15 years 25 days ago
Approximability of the k-server disconnection problem
Sung-Pil Hong, Byung-Cheon Choi
69
Voted
NETWORKS
2007
15 years 25 days ago
Heuristic solutions for general concave minimum cost network flow problems
Dalila B. M. M. Fontes, José Fernando Gon&c...