21 search results - page 5 / 5 » Improved memetic algorithm for Capacitated Arc Routing Probl... |
122
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...