New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem.

Dino Ahr, Gerhard Reinelt

Browse the full ESA paper archive.