Please use this identifier to cite or link to this item:
|Title:||Two algorithms for finding a minimal ratio Hamiltonian cycle in a network||Authors:||Tung, C.T.
Minimal time-to-profit ratio
|Issue Date:||1997||Citation:||Tung, C.T.,Kwek, K.H. (1997). Two algorithms for finding a minimal ratio Hamiltonian cycle in a network. Optimization 41 (1) : 89-100. ScholarBank@NUS Repository.||Abstract:||Two parametric algorithms with the support of subroutine NHORSH for finding a Hamiltonian cycle in a network, which minimizes the time-to-profit ratio, are presented in this paper. The difficulty of solving this problem is concerned with the problem of finding a shortest Hamiltonian cycle in a network which may have negative cycles. An subroutine Algorithm NHORSH has been established to cope with this problem. Validation of the algorithms and two illustrative examples are given. Computational experience is also reported.||Source Title:||Optimization||URI:||http://scholarbank.nus.edu.sg/handle/10635/104404||ISSN:||02331934|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 29, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.