.. This file is part of the OpenDSA eTextbook project. See
.. http://opendsa.org for more details.
.. Copyright (c) 2012-2020 by the OpenDSA Project Contributors, and
.. distributed under an MIT open source license.

.. avmetadata::
   :title: The Traveling Salesman Problem
   :author: Nabanita Maji
   :institution: Virginia Tech
   :topic: NP-completeness
   :keyword: NP-Complete; Traveling Salesman Problem
   :naturallanguage: en
   :programminglanguage: N/A
   :description: Presents the Traveling Salesman problem. Includes a practice exercise where the user must find the shortest cycle for a given graph.

The Traveling Salesman Problem
==============================

Traveling Salesman
------------------

.. inlineav:: TSPCON ss
   :long_name: Traveling Salesman
   :links: AV/NP/TSPCON.css
   :scripts: AV/NP/TSPCON.js
   :output: show
   :keyword: NP-completeness; Traveling Salesman Problem

Try out an instance of the Traveling Salesman problem on your own.

.. avembed:: Exercises/NP/TSPPRO.html ka
   :long_name: Practice Exercise for Traveling Salesman Problem
   :keyword: NP-completeness; Traveling Salesman Problem