Authours:
- Carlos Eduardo de Andrade -- [email protected]
Created on Jul 04, 2012. Last change: Ago 30, 2012
This project aims to build a wrapper for Concorde Libs using Lemon graph infrastructure. In current stage, we can load TSP instances and apply the Chain Lin Kernighan heuristic to obtain good tours.
Concorde is a computer code for the symmetric traveling salesman problem (TSP) and some related network optimization problems. To this date, it is considered the best software package to solve this problem.
More information about Concorde can be found at http://www.tsp.gatech.edu/concorde.html.
LEMON stands for Library for Efficient Modeling and Optimization in Networks. It is a C++ template library providing efficient implementations of common data structures and algorithms with focus on combinatorial optimization tasks connected mainly with graphs and networks.
LEMON is a member of the COIN-OR initiative, a collection of OR related open source projects, and can be found at http://lemon.cs.elte.hu/.