50 results
Open links in new tab
  1. backtracking - NIST

    Oct 30, 2024 · backtracking (algorithmic technique) Definition: Find a solution by trying one of several choices. If the choice proves …

  2. knight's tour - NIST

    Oct 30, 2024 · See also Hamiltonian cycle. Note: The associated problem is to find such a series of moves. The problem can be …

  3. travelling salesman problem - NIST

    Definition of travelling salesman problem, possibly with links to more information and implementations.

  4. traveling salesman problem

    Definition of traveling salesman problem, possibly with links to more information and implementations.

  5. TSP - xlinux.nist.gov

    Definition of TSP, possibly with links to more information and implementations.

  6. traveling salesman - NIST

    Oct 30, 2024 · traveling salesman (classic problem) Definition: Find a path through a weighted graph that starts and ends at the …

  7. parametric searching - NIST

    Dec 17, 2004 · parametric searching (algorithmic technique) Definition: (no definition here, yet, but you can help.) Note: Adapted …