| dc.contributor.author |
Tran, Vu Thieu |
|
| dc.contributor.author |
Pham, Xuan Hinh |
|
| dc.date.accessioned |
2011-04-20T07:18:55Z |
|
| dc.date.available |
2011-04-20T07:18:55Z |
|
| dc.date.issued |
2007 |
|
| dc.identifier.citation |
VNU Journal of Science, Mathematics - Physics 23 (2007) 178-182 |
vi |
| dc.identifier.issn |
0866-8612 |
|
| dc.identifier.uri |
http://hdl.handle.net/123456789/1032 |
|
| dc.description |
VNU Journal of Science, Mathematics - Physics. Vol. 23 (2007), No 3, P. 178-182 |
vi |
| dc.description.abstract |
In this paper we consider a combinatorial optimization problem that is similar to the
bottleneck traveling salesman problem. We show that an optimal tour for this problem is
pyramidal tour (1, 3, 5,…, n,…, 6, 4, 2) or consists of some pyramidal subtours. The above
7methods can be extended to complete bipartite graphs. |
vi |
| dc.language.iso |
en |
vi |
| dc.publisher |
ĐHQGHN |
vi |
| dc.subject |
Algorithm |
vi |
| dc.subject |
combinatorial optimization |
vi |
| dc.subject |
method |
vi |
| dc.title |
Algorithm for solution of a routing problem |
vi |
| dc.type |
Article |
vi |