Two algorithms for finding a minimal ratio Hamiltonian cycle in a network

Optimization

Saved in:

Bibliographic Details
Main Authors:	Tung, C.T., Kwek, K.H.
Other Authors:	MATHEMATICS
Format:	Article
Published:	2014
Subjects:	Algorithm Hamiltonian cycle Minimal time-to-profit ratio Network
Online Access:	http://scholarbank.nus.edu.sg/handle/10635/104404
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	National University of Singapore

id	sg-nus-scholar.10635-104404
record_format	dspace
spelling	sg-nus-scholar.10635-1044042015-01-08T01:47:33Z Two algorithms for finding a minimal ratio Hamiltonian cycle in a network Tung, C.T. Kwek, K.H. MATHEMATICS Algorithm Hamiltonian cycle Minimal time-to-profit ratio Network Optimization 41 1 89-100 2014-10-28T02:48:56Z 2014-10-28T02:48:56Z 1997 Article 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. 02331934 http://scholarbank.nus.edu.sg/handle/10635/104404 NOT_IN_WOS Scopus
institution	National University of Singapore
building	NUS Library
country	Singapore
collection	ScholarBank@NUS
topic	Algorithm Hamiltonian cycle Minimal time-to-profit ratio Network
spellingShingle	Algorithm Hamiltonian cycle Minimal time-to-profit ratio Network Tung, C.T. Kwek, K.H. Two algorithms for finding a minimal ratio Hamiltonian cycle in a network
description	Optimization
author2	MATHEMATICS
author_facet	MATHEMATICS Tung, C.T. Kwek, K.H.
format	Article
author	Tung, C.T. Kwek, K.H.
author_sort	Tung, C.T.
title	Two algorithms for finding a minimal ratio Hamiltonian cycle in a network
title_short	Two algorithms for finding a minimal ratio Hamiltonian cycle in a network
title_full	Two algorithms for finding a minimal ratio Hamiltonian cycle in a network
title_fullStr	Two algorithms for finding a minimal ratio Hamiltonian cycle in a network
title_full_unstemmed	Two algorithms for finding a minimal ratio Hamiltonian cycle in a network
title_sort	two algorithms for finding a minimal ratio hamiltonian cycle in a network
publishDate	2014
url	http://scholarbank.nus.edu.sg/handle/10635/104404
_version_	1681093100188991488

Two algorithms for finding a minimal ratio Hamiltonian cycle in a network

Similar Items