KNUSTSpace >
Research Articles >
College of Agric and Natural Resources >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/1210

Title: Inspection of electoral materials in Gilana Astraveli Inc. saleman's problem
Authors: Amponsah, S. K.
Darkwah, K. F.
Ankamah, J. D.
Issue Date: 6-Sep-2010
Abstract: The paper considers Hamilton's paths and circuits and its application to the Solution of the Travelling Salesman's Problem (TSP) in the verification of distributed electoral materials in the regional capitals of Ghana. An algorithm due to Dharwadker is currently the most efficient polynomial time algorithm used in finding Hamilton circuits. It is applied for the first time in solving a TSP.
Description: This article is published with ABACUS, Pages 22,33, Vol. 37, No. 2, 2010
URI: http://hdl.handle.net/123456789/1210
Appears in Collections:College of Agric and Natural Resources

Files in This Item:

File Description SizeFormat
Binder1.pdf2.21 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback