Chinese Postman problem, with all odd nodes

[harrycho2000]

Hi everyone, I'm trying to answer this question for a school assignment. If there is a map, and there are only odd nodes, how can the shortest route be found? You must start and end in the same place. The goal is to minimize retracing of steps.
Thanks. :smile:

 

[tkhunny]

There are many ways to proceed. What's your first plan? Have you seen "Integer Programming"?

 

[harrycho2000]

Oh i am writing an essay on it, so I would prefer something done by hand, rather than by a computer. Normally for the chinese postman problem you're supposed to pair up all the odd nodes. But when there are only odd nodes, how can this be done in the quickest way?

 

[tkhunny]

Okay, let's see your results. We'll be delighted to comment.