0
$\begingroup$

I have found transformations of Chinese Postman Problems (CPPs) into Asymmetric Traveling Salesman Problems (ATSPs), but didn't find anything about transformations in the opposite direction.

Having such a transformation may provide a means to identify some polynomially solvable ATSP instances, e.g. those whose transformation resembles Eulerian Windy Postman Problems.

Question:

Have transformations from ATSPs to CPPs already been described and if so, what are the relevant publications, ideally freely accessible online?

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.