Two algorithms for finding a minimal ratio Hamiltonian cycle in a network
Optimization
Saved in:
Main Authors: | Tung, C.T., Kwek, K.H. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Subjects: | |
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 |
Similar Items
-
Finding Hamiltonian cycles: An algorithm
by: Macapagal, Rachel R., et al.
Published: (2008) -
On r-regular subgraphs with hamiltonian cycles in graphs with many edges
by: Yeaw Ku, C., et al.
Published: (2016) -
On degree sums, k-factors, and Hamiltonian cycles in graphs
by: Hernandez, Alana Margarita R.
Published: (2002) -
Optimization of Hamiltonian algorithm for fiber alignment by simulation and experiments
by: Lu, Z., et al.
Published: (2014) -
On generalized fibonacci cubes which contain Hamiltonian paths
by: Mustard, Elaine M.
Published: (1998)