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 20 of 590 for “"Salesman"”.

  1. The Bernoulli salesman

    gatech Repository record for The Bernoulli salesman (opens in a new tab)

  2. A traveling salesman algorithm.

    nps Repository record for A traveling salesman algorithm. (opens in a new tab)

  3. A bicriterion traveling salesman problem

    A Bicriterion Traveling Salesman Problem (BCTSP) is introduced. The problems considered include both a cost matrix and a time matrix, and the objective is to minimize both cost and time. A set of undominated solutions will be found by solving the BCTSP. Several exact solution approaches: …

    ttu Repository record for A bicriterion traveling salesman problem (opens in a new tab)

  4. The bottleneck traveling salesman problem

    <p>A variation of the traveling salesman problem with a bottleneck type objective function is posed. A statistical analysis shows that for large problems in which the costs are independent identically distributed random variables, the optimal objective function value is almost deterministic and can …

    utk-theses Repository record for The bottleneck traveling salesman problem (opens in a new tab)

  5. Dynamic Programming: Salesman to Surgeon

    … Problem, the Knapsack Problem, and the Traveling Salesman Problem, with varying degrees of practical success. In this thesis, we present two applications of dynamic programming to optimization problems. The first application is as a method to compute the Branch-Cut-and-Price (BCP) family of lower …

    waterloo Repository record for Dynamic Programming: Salesman to Surgeon (opens in a new tab)

  6. 2-period travelling salesman problem

    <p>The 2-period travelling salesman problem originates from the collection of milk from dairy farmers in County Dublin, Ireland. Specifically, a group of dairy farms is allocated to a milk tanker. Of these farms some require every day collection, and others require collection every other day. The …

    soton Download PDF for 2-period travelling salesman problem (opens in a new tab)

  7. The symmetric generalized traveling salesman problem

    … model known as the Generalized Traveling Salesman Problem (GTSP). The GTSP is a generalization of a well known problem in the field of operations research known as the Traveling Salesman Problem (TSP). The GTSP can be simply described as follows. A salesman is given a list of cities that …

    utk-theses Repository record for The symmetric generalized traveling salesman problem (opens in a new tab)

  8. Period traveling salesman with customer stratification

    … AT AUTHOR'S REQUEST.] The Period Traveling Salesman Problem (PTSP) has been a popular subject in the area of Traveling Salesman Problem (TSP) with the objective to minimize traveling cost over the entire M-day planning period. Most of the previous PTSP studies focused on cost minimization or …

    missouri Repository record for Period traveling salesman with customer stratification (opens in a new tab)

  9. Computational intelligence and the traveling salesman

    "The Traveling Salesman Problem (TSP) is one of the most widely studied problems in the computer science literature. As a member of the class of NP-complete problems, practical approaches to the TSP require heuristics and approximation techniques. Computational Intelligence approaches have …

    must-thes Repository record for Computational intelligence and the traveling salesman (opens in a new tab)

  10. The field salesman : a market manager

    Thesis (Ph. D.)--Michigan State University. Department of Marketing & Transportation Administration, 1963

    msu Repository record for The field salesman : a market manager (opens in a new tab)

  11. Wilbur Burton Foshay: The Saga of a Salesman

    History has been defined as the story of man's past actions based on the evidence that has survived. A study of this surviving evidence reveals that no man lives in a vacuum separated from other men nor does a man live untouched by those economic, political, social or religious threads which weave …

    creighton Repository record for Wilbur Burton Foshay: The Saga of a Salesman (opens in a new tab)

  12. The mixing genetic algorithm for traveling salesman problem

    The Traveling Salesman Problem (TSP) is one of the most intensively studied NP-Hard problems. The TSP solvers are well-suited for multi-core CPU-based architectures. With the decline in Moore's law, there is an increasing need to port the codes to parallel architectures such as the GPU massively. …

    colostate Repository record for The mixing genetic algorithm for traveling salesman problem (opens in a new tab)

  13. On DP-constraints for the Traveling Salesman polytope.

    … valid inequalities for the Symmetric Traveling Salesman Polytope (STSP) which includes the family of comb constraints. Moreover, there exists a polynomial-time exact separation algorithm for the DP-constraints for points whose support graph is planar. However, while the comb constraints are …

    ottawa-retro Repository record for On DP-constraints for the Traveling Salesman polytope. (opens in a new tab)

Page 1 of 30