|
Volumn 26, Issue 8, 1999, Pages 819-827
|
Improved solutions for the Chinese postman problem on mixed networks
|
Author keywords
Combinatorial optimization; Network routing
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
HEURISTIC METHODS;
OPTIMIZATION;
POLYNOMIALS;
PROBLEM SOLVING;
CHINESE POSTMAN PROBLEMS;
CRITICAL PATH ANALYSIS;
METHODOLOGY;
NETWORKING;
PLANNING METHOD;
TRANSPORTATION PLANNING;
|
EID: 0033166648
PISSN: 03050548
EISSN: None
Source Type: Journal
DOI: 10.1016/S0305-0548(98)00092-6 Document Type: Article |
Times cited : (10)
|
References (11)
|