Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Uber for Massage 2.0
Job Board Software 1.1
RentALL - Airbnb Clone | Built with ReactJS 2.6
VB.Net PDF 2020.6.0
Flowrigami 1.0.0
SentiVeillance SDK Trial 7.3.2020.03.02
Entity Developer 6.8
dbExpress driver for SQLite 4.2
dbForge SQL Complete 6.5
Advanced Amazon Clone App 2.0
Appjetty Delivery Date Manager 1.0.0
The C# Barcode Library 2020.5.0
Chowtro - Online Restaurant Food Ordering Software 1.0
Alvas.Audio.Core 2019.0
Sainsburys Script 1.3.2
Top Code
dbForge SQL Complete 4.8
dbExpress Driver for SQLite 3.9
Availability Booking Calendar PHP 1.0
ATN Site Builder 3.0
ICPennyBid Penny Auction Script 4.0
Invoice Manager by PHPJabbers 3.0
ATN Resume Finder 2.0
PHP Review Script 1.0
Aglowsoft SQL Query Tools 8.2
Classified Ad Lister 1.0
Solid File System OS edition 5.1
Deals and Discounts Website Script 1.0.2
SentiVeillance SDK Trial 7.3.2020.03.02
Uber for Massage 2.0
Azizi search engine script PHP 4.1.10
Top Rated
phpEnter 5.1.
Single Leg MLM 1.2.1
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
Dynamic Programming solution to the TSP 1.0
File ID: 83788






Dynamic Programming solution to the TSP 1.0
Download Dynamic Programming solution to the TSP 1.0http://www.mathworks.comReport Error Link
License: Shareware
File Size: 10.0 KB
Downloads: 53
Submit Rating:
Dynamic Programming solution to the TSP 1.0 Description
Description: The function is based on the paper by Held and Karp from 1962. The DP is guaranteed to provide the accurate (optimal) result to the TSP, but the time complexity of this algorithm is O(2^n n^2), which limits the use of this algorithm to 15 cities or less.

NOTE: For reasonable runtime, please do not try to calculate a tour of more than 13 cities. DP is not for large sets of cities.

License: Shareware

Related: cities, Limits, reasonable, Runtime, Large, Calculate, Algorithm, complexity

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 10.0 KB

Downloads: 53



More Similar Code

An alternative solution to the MAZE problem on matlab central FEX. (A recent submission to the File exchange on MATLAB central File ID: #27175 ).

The present solution uses an Immiscible Lattice Boltzmann framework to simulate the flow of a blue fluid in a complex pipeline; a red bubble is added at the inlet that serves as tracer to identify the fastest way out to the maze i.e. the path to the outlet.

The implementation is...



au'(x)+bu"(x)=0 for 0<=x<=d
BC: u(0)=0 and u(d)=h
Example:
Finding an approximate solution to the following BVP using 16 elements of equal length.
u'(x)-u"(x)=0 : 0<=x<=1
BC: u(0)=0 and u(1)=1



ApexSQL Diff implements a state of the Art solution to the most complex database comparison scenarios including many unique features like Diff codes, RegEx object filters, Project Wizards and much more

Compare your SQL Databases in...



This recipe provides an easy-to-use, decorator-based solution to the problem of using functions from other languages, especially C, in Python. It takes advantage of Python's new annotations to provide simple type checking and automatic conversion....



This is a solution to the first problem in this tutorial:
http://www.ai-junkie.com/ga/intro/gat1.html

I wrote it in about an hour, and tried to keep everything as clear and simple as possible. Please excuse the sparse...



This is the second example solution to the bounded
buffer problem. By looking at the code, you may
notice that it has several features that exapand
on what is demonstrated in the first example.
First of all, it accepts several...



This programme is an application of the Chinese Remainder Theorem for Integers - for obtaining a solution to the "k-threshold system for sharing a secret". The concept is explained in the book "A course in Number Theory and...



Compute the solution to the arbitrary-shape thin wire integral equation found in Section 4.5 of

Gibson, Walton C. "The Method of Moments in Electromagnetics," Taylor and Francis/CRC, 2008.

Assumes a straight wire...



The solution to the problem of calculating the distance between an ellipse and a point is less than straightforward. The problem can be solved analytically however, which boild down to solving a quartic equation in cos(f), with (f) the true...



Java Forker aims at providing a solution to the memory consumption of java Runtime.exec method under linux for really big vm like application servers.

It is a small vm that will do the fork and communicate back the two outputs from the...

User Review for Dynamic Programming solution to the TSP
- required fields
     

Please enter text on the image