<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Heuristic (computer science) - Page 5 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Heuristic_(computer_science)&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Heuristic_%28computer_science%29&amp;p=6">3.Next</a>
</p>
<p>gain expected of a heuristic consists of solving a simpler problem whose solution is also a solution to the initial problem.</p>

<p><big> Travelling salesman problem </big></p>
<p>An example of approximation is described by <a href="page.php?w=Jon_Bentley_%28computer_scientist%29">Jon Bentley</a> for solving the <a href="page.php?w=travelling_salesman_problem">travelling salesman problem</a> (TSP):<br/>
* "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns</p><p>
<a accesskey="1" href="page.php?w=Heuristic_(computer_science)&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Heuristic_%28computer_science%29&amp;p=6">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
