94 search results - page 6 / 19 » Competitive Memetic Algorithms for Arc Routing Problems |
COR
2010
13 years 7 months ago
2010
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
GECCO
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. Improving image quality is the backbone of highly competitive display industry. Contemporary video processing system design is a challenging optimization problem. General...
NETWORKING
2004
13 years 8 months ago
2004
We consider the problem of non-bifurcated multicommodity flows rerouting in survivable connection-oriented networks. We focus on local restoration, in which the backup route is rer...
WG
2010
Springer
13 years 5 months ago
2010
Springer
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
CP
2003
Springer
14 years 18 days ago
2003
Springer
Arc consistency plays a central role in solving Constraint Satisfaction Problems. This is the reason why many algorithms have been proposed to establish it. Recently, an algorithm ...