tsp.git - Travelling Salesman Problem algorithms

Age	Commit message (Expand)	Author	Files	Lines
2007-12-18	* Display best-solution-yet search time	Guillaume Seguin	1	-9/+24
2007-12-17	* Add need_init property to Algo class	Guillaume Seguin	1	-13/+16
2007-12-17	* Modify the way t0 is computed (use min (10, citycount / 5))	Guillaume Seguin	1	-2/+3
2007-12-17	* Add 2opt-based algorithm with MonteCarlo perturbations	Guillaume Seguin	1	-1/+32
2007-12-17	* Cleanup resume feature (mostly move it to AlgoThread)	Guillaume Seguin	1	-6/+11
2007-12-17	* Enable resuming current algorithm execution	Guillaume Seguin	1	-25/+56
2007-12-17	* Minor cleanup	Guillaume Seguin	1	-4/+3
2007-12-17	* Center canvas horizontally	Guillaume Seguin	1	-1/+3
2007-12-17	* Use simpler Greedy init and move the current one to "Greedy (Best)"	Guillaume Seguin	1	-8/+13
2007-12-17	* Comments & cleanup	Guillaume Seguin	1	-34/+122
2007-12-17	* Don't completely block algorithm thread while stopping it	Guillaume Seguin	1	-3/+5
2007-12-17	* Add Simulated Annealing algorithm and use it by default	Guillaume Seguin	1	-2/+37
2007-12-17	* Improve 2opt algorithm (don't enforce i to be lower than j)	Guillaume Seguin	1	-4/+9
2007-12-17	* Drop the "8 cities" choice, the "10 cities" choice is close enough	Guillaume Seguin	1	-1/+1
2007-12-17	* Add combo box to choose between Random and Greedy inits	Guillaume Seguin	1	-12/+32
2007-12-17	* Add method to generate a random path	Guillaume Seguin	1	-0/+5
2007-12-16	* Minor refactoring of default configuration handling	Guillaume Seguin	1	-4/+5
2007-12-16	* Initial import	Guillaume Seguin	1	-0/+421