PHP Programming Innovation award nominee
May 2011 Number 5
 The salesman travel is a classic computing problem which consists in finding an optimized route that a salesman can follow to visit a set of cities with the minimum travel cost. This class implements a solution for the salesman travel problem using the Christofides heuristic.
© 2005-2011 Chi Hoang. All rights reserved. All trademarks are property of their respective owners. Last Update: 
12.01.2012
bookmark in your browserbookmark at mister wongpublish in twitterbookmark at del.icio.usbookmark at digg.combookmark at furl.netbookmark at linksilo.debookmark at reddit.combookmark at spurl.netbookmark at technorati.combookmark at google.combookmark at yahoo.combookmark at facebook.combookmark at stumbleupon.combookmark at propeller.combookmark at newsvine.combookmark at jumptags.com