An Exact Algorithm for Travelling Salesman Problem
A well known example of a Combinatorial Optimization Problem is the Travelling Salesman Problem. The Combinatorial Programming Problems share the following properties: They are Optimization Problems, are easy to state, and have a finite but usually very large number of feasible solutions. Lexi-Searc...
Gespeichert in:
Veröffentlicht in: | International journal of advanced research in computer science 2012-01, Vol.3 (1) |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!