 the knapsack problem.  Instructions are available
      on how to run the job, via MATLAB's BATCH facility,
      on a remote system such as Virginia Tech's ITHACA cluster.
    </p>

    <p>
      <a href = "../../m_src/tsp_brute/tsp_brute.html">
      TSP_BRUTE</a>,
      a MATLAB program which
      reads a file of city-to-city distances and solves the 
      traveling salesperson problem, using brute force.
    </p>

    <h3 align = "center">
      Reference:
    </h3>

    <p>
      <ol>
        <li>
 