A Novel Approach Model for Chinese Postman Problem

2006 ◽  
pp. 230-237
Author(s):  
Jiang Bo ◽  
Shi Xiaoying ◽  
Xu Zhibang
Keyword(s):  
Chinese Postman Problem ◽  
Novel Approach ◽  
Chinese Postman

Security routing games with multivehicle Chinese postman problem

Networks ◽  
2014 ◽  
Vol 64 (3) ◽  
pp. 181-191 ◽  
Author(s):  
Dorit S. Hochbaum ◽  
Cheng Lyu ◽  
Fernando Ordóñez
Keyword(s):  
Chinese Postman Problem ◽  
Chinese Postman ◽  
Routing Games

Snowplow Route Optimization Using Chinese Postman Problem and Tabu Search Algorithm

2021 ◽  
Author(s):  
Abdullah Rasul ◽  
Jaho Seo ◽  
Shuoyan Xu ◽  
Tae J. Kwon ◽  
Justin MacLean ◽  
...  
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Route Optimization ◽  
Tabu Search Algorithm ◽  
Chinese Postman Problem ◽  
Chinese Postman

On the Maximum Benefit Chinese Postman Problem

Omega ◽  
2003 ◽  
Vol 31 (4) ◽  
pp. 269-273 ◽  
Author(s):  
W.L. Pearn ◽  
K.H. Wang
Keyword(s):  
Chinese Postman Problem ◽  
Maximum Benefit ◽  
Chinese Postman

scholarly journals Parameterized complexity of k -Chinese Postman Problem

2013 ◽  
Vol 513 ◽  
pp. 124-128 ◽  
Author(s):  
Gregory Gutin ◽  
Gabriele Muciaccia ◽  
Anders Yeo
Keyword(s):  
Parameterized Complexity ◽  
Chinese Postman Problem ◽  
Chinese Postman

Traversing Graphs

2017 ◽  
Author(s):  
Arthur Benjamin ◽  
Gary Chartrand ◽  
Ping Zhang
Keyword(s):  
Chinese Postman Problem ◽  
Round Trip ◽  
Eulerian Graphs ◽  
Bridge Problem ◽  
Chinese Postman ◽  
Leonhard Euler ◽  
The City ◽  
East Prussia

This chapter considers Eulerian graphs, a class of graphs named for the Swiss mathematician Leonhard Euler. It begins with a discussion of the the Königsberg Bridge Problem and its connection to Euler, who presented the first solution of the problem in a 1735 paper. Euler showed that it was impossible to stroll through the city of Königsberg, the capital of German East Prussia, and cross each bridge exactly once. He also mentioned in his paper a problem whose solution uses the geometry of position to which Gottfried Leibniz had referred. The chapter concludes with another problem, the Chinese Postman Problem, which deals with minimizing the length of a round-trip that a letter carrier might take.

Tight integral duality gap in the Chinese Postman problem

1992 ◽  
Vol 55 (1-3) ◽  
pp. 183-191 ◽  
Author(s):  
Ephraim Korach ◽  
Michal Penn
Keyword(s):  
Duality Gap ◽  
Chinese Postman Problem ◽  
Chinese Postman
Sign in / Sign up

Export Citation Format

Share Document