The Capacitated Arc Routing Problem: Valid Inequalities and Facets
Computational Optimization and Applications
Approximate solutions for the maximum benefit Chinese postman problem
International Journal of Systems Science
Solving capacitated arc routing problems using a transformation to the CVRP
Computers and Operations Research
A constraint programming approach to the Chinese postman problem with time windows
Computers and Operations Research
New lower bound for the capacitated arc routing problem
Computers and Operations Research
Exploiting sparsity in pricing routines for the capacitated arc routing problem
Computers and Operations Research
Lower bounds for the mixed capacitated arc routing problem
Computers and Operations Research
Solving capacitated arc routing problems using a transformation to the CVRP
Computers and Operations Research
Computers and Operations Research
Development and assessment of the SHARP and RandSHARP algorithms for the arc routing problem
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
Operations Research
Improved bounds for large scale capacitated arc routing problem
Computers and Operations Research
Location-arc routing problem: Heuristic approaches and test instances
Computers and Operations Research
| Hi-index | 0.01 |