Sciweavers

NETWORKS
2007
13 years 4 months ago
Hardness of robust network design
Chandra Chekuri, F. Bruce Shepherd, G. Oriolo, Mar...
NETWORKS
2007
13 years 4 months ago
The vehicle rescheduling problem: Model and algorithms
Jing-Quan Li, Pitu B. Mirchandani, Denis Borenstei...
NETWORKS
2007
13 years 4 months ago
Survivable IP network design with OSPF routing
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
Luciana S. Buriol, Mauricio G. C. Resende, Mikkel ...
NETWORKS
2007
13 years 4 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...
NETWORKS
2007
13 years 4 months ago
The two-median problem on Manhattan meshes
Mordecai J. Golin, Yan Zhang
NETWORKS
2007
13 years 4 months 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
13 years 4 months 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