94 search results - page 11 / 19 » Competitive Memetic Algorithms for Arc Routing Problems |
103
click to vote
COR
2006
15 years 1 months ago
2006
In this paper, we address a real life waste collection vehicle routing problem with time windows (VRPTW) with consideration of multiple disposal trips and drivers' lunch brea...
107
click to vote
APPROX
2000
Springer
15 years 5 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
131
click to vote
SPAA
2006
ACM
15 years 7 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
114
click to vote
SODA
1998
ACM
15 years 2 months ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
105
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...