Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Combinatorial designs and configurations -- Data processing"”.

  1. The traveling salesman problem improving K-opt via edge cut equivalence sets

    … (TSP) has become a classic in the field of combinatorial optimization. Attracting computer scientists and mathematicians, the problem involves finding a minimum cost Hamiltonian cycle in a weighted graph.

    csusb Repository record for The traveling salesman problem improving K-opt via edge cut equivalence sets (opens in a new tab)

  2. The traveling salesman problem improving K-opt via edge cut equivalence sets

    … (TSP) has become a classic in the field of combinatorial optimization. Attracting computer scientists and mathematicians, the problem involves finding a minimum cost Hamiltonian cycle in a weighted graph.

    csusb-retro Repository record for The traveling salesman problem improving K-opt via edge cut equivalence sets (opens in a new tab)