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

A branch-and-cut algorithm for the maximum benefit Chinese postman problem

2011 ◽  
Vol 141 (1-2) ◽  
pp. 21-48 ◽  
Author(s):  
Ángel Corberán ◽  
Isaac Plana ◽  
Antonio M. Rodríguez-Chía ◽  
José M. Sanchis
Keyword(s):  
Branch And Cut ◽  
Chinese Postman Problem ◽  
Maximum Benefit ◽  
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

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
Sign in / Sign up

Export Citation Format

Share Document