Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Traveling Salesman Problem)`

.
Showing records 1 – 30 of
191 total matches.

◁ [1] [2] [3] [4] [5] [6] [7] ▶

Search Limiters

Dates

- 2016 – 2020 (70)
- 2011 – 2015 (53)
- 2006 – 2010 (42)
- 2001 – 2005 (18)

Department

Degrees

- PhD (28)
- MS (17)
- Docteur es (12)

Languages

- English (83)
- Czech (23)
- Portuguese (16)

Country

- US (74)
- Brazil (25)
- Czech Republic (25)
- Canada (12)
- France (12)

▼ Search Limiters

University of Johannesburg

1.
Leenen, Louise.
Contributions towards an implementation of a branch-and-cut algorithm for the travelling *salesman* * problem*.

Degree: 2014, University of Johannesburg

URL: http://hdl.handle.net/10210/12237

►

M.Sc. (Computer Science)

The STSP (symmetric travelling *salesman* *problem*) involves finding the cheapest tour through a number of cities. It is a difficult *problem* and…
(more)

Subjects/Keywords: Computer algorithms; Traveling-salesman problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Leenen, L. (2014). Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/12237

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Leenen, Louise. “Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem.” 2014. Thesis, University of Johannesburg. Accessed November 30, 2020. http://hdl.handle.net/10210/12237.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Leenen, Louise. “Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem.” 2014. Web. 30 Nov 2020.

Vancouver:

Leenen L. Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10210/12237.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Leenen L. Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/12237

Not specified: Masters Thesis or Doctoral Dissertation

University of Johannesburg

2.
Geldenhuys, Christel Erna.
An implementation of a branch-and-cut algorithm for the travelling *salesman* * problem*.

Degree: 2012, University of Johannesburg

URL: http://hdl.handle.net/10210/7337

►

M.Sc. (Computer Science)

The Travelling *Salesman* *Problem* (TSP) comprises the following: A *salesman* is required, by definition of his job description, to visit a set…
(more)

Subjects/Keywords: Traveling-salesman problem; Computer algorithms

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Geldenhuys, C. E. (2012). An implementation of a branch-and-cut algorithm for the travelling salesman problem. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/7337

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Geldenhuys, Christel Erna. “An implementation of a branch-and-cut algorithm for the travelling salesman problem.” 2012. Thesis, University of Johannesburg. Accessed November 30, 2020. http://hdl.handle.net/10210/7337.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Geldenhuys, Christel Erna. “An implementation of a branch-and-cut algorithm for the travelling salesman problem.” 2012. Web. 30 Nov 2020.

Vancouver:

Geldenhuys CE. An implementation of a branch-and-cut algorithm for the travelling salesman problem. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10210/7337.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Geldenhuys CE. An implementation of a branch-and-cut algorithm for the travelling salesman problem. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/7337

Not specified: Masters Thesis or Doctoral Dissertation

Oregon State University

3.
Starr, Robert W.
A multi-tour heuristic for the *traveling* *salesman* * problem*.

Degree: MS, Computer Science, 1980, Oregon State University

URL: http://hdl.handle.net/1957/42577

► This paper demonstrates the effectiveness of a heuristic for the *Traveling* *Salesman* *Problem* based purely on the efficient storage of multiple partial sub-tours. The heuristic…
(more)

Subjects/Keywords: Traveling-salesman problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Starr, R. W. (1980). A multi-tour heuristic for the traveling salesman problem. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/42577

Chicago Manual of Style (16^{th} Edition):

Starr, Robert W. “A multi-tour heuristic for the traveling salesman problem.” 1980. Masters Thesis, Oregon State University. Accessed November 30, 2020. http://hdl.handle.net/1957/42577.

MLA Handbook (7^{th} Edition):

Starr, Robert W. “A multi-tour heuristic for the traveling salesman problem.” 1980. Web. 30 Nov 2020.

Vancouver:

Starr RW. A multi-tour heuristic for the traveling salesman problem. [Internet] [Masters thesis]. Oregon State University; 1980. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1957/42577.

Council of Science Editors:

Starr RW. A multi-tour heuristic for the traveling salesman problem. [Masters Thesis]. Oregon State University; 1980. Available from: http://hdl.handle.net/1957/42577

University of Waterloo

4.
Qian, David.
Dynamic Programming: *Salesman* to Surgeon.

Degree: 2013, University of Waterloo

URL: http://hdl.handle.net/10012/7526

► Dynamic Programming is an optimization technique used in computer science and mathematics. Introduced in the 1950s, it has been applied to many classic combinatorial optimization…
(more)

Subjects/Keywords: Dynamic Programming; TSP; Optimization; Traveling Salesman Problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Qian, D. (2013). Dynamic Programming: Salesman to Surgeon. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7526

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Qian, David. “Dynamic Programming: Salesman to Surgeon.” 2013. Thesis, University of Waterloo. Accessed November 30, 2020. http://hdl.handle.net/10012/7526.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Qian, David. “Dynamic Programming: Salesman to Surgeon.” 2013. Web. 30 Nov 2020.

Vancouver:

Qian D. Dynamic Programming: Salesman to Surgeon. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10012/7526.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Qian D. Dynamic Programming: Salesman to Surgeon. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/7526

Not specified: Masters Thesis or Doctoral Dissertation

California State University – Chico

5.
Powers, David J.
Effects of Parallelization on Genetic Algorithms in Programmable Logic: Implementing a Solution to the *Traveling* *Salesman* * Problem*
.

Degree: 2012, California State University – Chico

URL: http://hdl.handle.net/10211.4/397

► EFFECTS OF PARALLELIZATION ON GENETIC ALGORITHMS IN PROGRAMMABLE LOGIC: IMPLEMENTING A SOLUTION TO THE *TRAVELING* *SALESMAN* *PROBLEM* by David J. Powers Master of Science in…
(more)

Subjects/Keywords: Genetic Algorithems; Programmable Logic; Traveling Salesman Problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Powers, D. J. (2012). Effects of Parallelization on Genetic Algorithms in Programmable Logic: Implementing a Solution to the Traveling Salesman Problem . (Thesis). California State University – Chico. Retrieved from http://hdl.handle.net/10211.4/397

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Powers, David J. “Effects of Parallelization on Genetic Algorithms in Programmable Logic: Implementing a Solution to the Traveling Salesman Problem .” 2012. Thesis, California State University – Chico. Accessed November 30, 2020. http://hdl.handle.net/10211.4/397.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Powers, David J. “Effects of Parallelization on Genetic Algorithms in Programmable Logic: Implementing a Solution to the Traveling Salesman Problem .” 2012. Web. 30 Nov 2020.

Vancouver:

Powers DJ. Effects of Parallelization on Genetic Algorithms in Programmable Logic: Implementing a Solution to the Traveling Salesman Problem . [Internet] [Thesis]. California State University – Chico; 2012. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10211.4/397.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Powers DJ. Effects of Parallelization on Genetic Algorithms in Programmable Logic: Implementing a Solution to the Traveling Salesman Problem . [Thesis]. California State University – Chico; 2012. Available from: http://hdl.handle.net/10211.4/397

Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

6.
Yang, Chen PHYS.
A new strategy to solve the *traveling* *salesman* *problem* with a multi-agent system.

Degree: 2019, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-101546 ; https://doi.org/10.14711/thesis-991012752564303412 ; http://repository.ust.hk/ir/bitstream/1783.1-101546/1/th_redirect.html

► The large-scale *traveling* *salesman* *problem* is difficult to solve especially when the computing resources are limited. In this thesis, we propose a good strategy to…
(more)

Subjects/Keywords: Traveling salesman problem ; Mathematical models ; Multiagent systems

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Yang, C. P. (2019). A new strategy to solve the traveling salesman problem with a multi-agent system. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-101546 ; https://doi.org/10.14711/thesis-991012752564303412 ; http://repository.ust.hk/ir/bitstream/1783.1-101546/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Yang, Chen PHYS. “A new strategy to solve the traveling salesman problem with a multi-agent system.” 2019. Thesis, Hong Kong University of Science and Technology. Accessed November 30, 2020. http://repository.ust.hk/ir/Record/1783.1-101546 ; https://doi.org/10.14711/thesis-991012752564303412 ; http://repository.ust.hk/ir/bitstream/1783.1-101546/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Yang, Chen PHYS. “A new strategy to solve the traveling salesman problem with a multi-agent system.” 2019. Web. 30 Nov 2020.

Vancouver:

Yang CP. A new strategy to solve the traveling salesman problem with a multi-agent system. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2019. [cited 2020 Nov 30]. Available from: http://repository.ust.hk/ir/Record/1783.1-101546 ; https://doi.org/10.14711/thesis-991012752564303412 ; http://repository.ust.hk/ir/bitstream/1783.1-101546/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yang CP. A new strategy to solve the traveling salesman problem with a multi-agent system. [Thesis]. Hong Kong University of Science and Technology; 2019. Available from: http://repository.ust.hk/ir/Record/1783.1-101546 ; https://doi.org/10.14711/thesis-991012752564303412 ; http://repository.ust.hk/ir/bitstream/1783.1-101546/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

7.
Bau, Norman Jon.
On the solution of *traveling* *salesman* problems under conditions of sparseness.

Degree: MS, Operations research, 1976, Georgia Tech

URL: http://hdl.handle.net/1853/25496

Subjects/Keywords: Traveling-salesman problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Bau, N. J. (1976). On the solution of traveling salesman problems under conditions of sparseness. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/25496

Chicago Manual of Style (16^{th} Edition):

Bau, Norman Jon. “On the solution of traveling salesman problems under conditions of sparseness.” 1976. Masters Thesis, Georgia Tech. Accessed November 30, 2020. http://hdl.handle.net/1853/25496.

MLA Handbook (7^{th} Edition):

Bau, Norman Jon. “On the solution of traveling salesman problems under conditions of sparseness.” 1976. Web. 30 Nov 2020.

Vancouver:

Bau NJ. On the solution of traveling salesman problems under conditions of sparseness. [Internet] [Masters thesis]. Georgia Tech; 1976. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1853/25496.

Council of Science Editors:

Bau NJ. On the solution of traveling salesman problems under conditions of sparseness. [Masters Thesis]. Georgia Tech; 1976. Available from: http://hdl.handle.net/1853/25496

8. Gao, Zhihan. Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations.

Degree: 2015, University of Waterloo

URL: http://hdl.handle.net/10012/9492

► Linear programming (LP) relaxations provide a powerful technique to design approximation algorithms for combinatorial optimization problems. In the first part of the thesis, we study…
(more)

Subjects/Keywords: Approximation algorithms; Path Traveling Salesman Problem; Asymmetric Traveling Salesman Problem; Tree Augmentation Problem; Linear programming relaxations; Lift-and-Project systems

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Gao, Z. (2015). Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9492

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Gao, Zhihan. “Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations.” 2015. Thesis, University of Waterloo. Accessed November 30, 2020. http://hdl.handle.net/10012/9492.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gao, Zhihan. “Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations.” 2015. Web. 30 Nov 2020.

Vancouver:

Gao Z. Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10012/9492.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gao Z. Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9492

Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

9. Shing, Ming Tony PHYS. Optimal route planning for probabilistic landscape exploration.

Degree: 2020, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-103981 ; https://doi.org/10.14711/thesis-991012786069503412 ; http://repository.ust.hk/ir/bitstream/1783.1-103981/1/th_redirect.html

► In a general resource collection mission, it is important to plan optimal exploratory routes to maximize the total probability of finding resources. Very often, the…
(more)

Subjects/Keywords: Traveling salesman problem ; Mathematical models ; Vehicle routing problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Shing, M. T. P. (2020). Optimal route planning for probabilistic landscape exploration. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-103981 ; https://doi.org/10.14711/thesis-991012786069503412 ; http://repository.ust.hk/ir/bitstream/1783.1-103981/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Shing, Ming Tony PHYS. “Optimal route planning for probabilistic landscape exploration.” 2020. Thesis, Hong Kong University of Science and Technology. Accessed November 30, 2020. http://repository.ust.hk/ir/Record/1783.1-103981 ; https://doi.org/10.14711/thesis-991012786069503412 ; http://repository.ust.hk/ir/bitstream/1783.1-103981/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Shing, Ming Tony PHYS. “Optimal route planning for probabilistic landscape exploration.” 2020. Web. 30 Nov 2020.

Vancouver:

Shing MTP. Optimal route planning for probabilistic landscape exploration. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2020. [cited 2020 Nov 30]. Available from: http://repository.ust.hk/ir/Record/1783.1-103981 ; https://doi.org/10.14711/thesis-991012786069503412 ; http://repository.ust.hk/ir/bitstream/1783.1-103981/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shing MTP. Optimal route planning for probabilistic landscape exploration. [Thesis]. Hong Kong University of Science and Technology; 2020. Available from: http://repository.ust.hk/ir/Record/1783.1-103981 ; https://doi.org/10.14711/thesis-991012786069503412 ; http://repository.ust.hk/ir/bitstream/1783.1-103981/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Texas Tech University

10.
Roerty, Dennis Francis.
M-*salesman* balanced tours *traveling* *salesman* *problem* with multiple visits to cities allowed.

Degree: Industrial and Systems Engineering, 1974, Texas Tech University

URL: http://hdl.handle.net/2346/18193

Subjects/Keywords: Traveling-salesman problem; Traveling sales personnel

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Roerty, D. F. (1974). M-salesman balanced tours traveling salesman problem with multiple visits to cities allowed. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/18193

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Roerty, Dennis Francis. “M-salesman balanced tours traveling salesman problem with multiple visits to cities allowed.” 1974. Thesis, Texas Tech University. Accessed November 30, 2020. http://hdl.handle.net/2346/18193.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Roerty, Dennis Francis. “M-salesman balanced tours traveling salesman problem with multiple visits to cities allowed.” 1974. Web. 30 Nov 2020.

Vancouver:

Roerty DF. M-salesman balanced tours traveling salesman problem with multiple visits to cities allowed. [Internet] [Thesis]. Texas Tech University; 1974. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/2346/18193.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Roerty DF. M-salesman balanced tours traveling salesman problem with multiple visits to cities allowed. [Thesis]. Texas Tech University; 1974. Available from: http://hdl.handle.net/2346/18193

Not specified: Masters Thesis or Doctoral Dissertation

University of Hong Kong

11.
許明琪.
The *traveling* *salesman*
*problem* and its applications.

Degree: 2002, University of Hong Kong

URL: http://hdl.handle.net/10722/55639

Subjects/Keywords: Combinatorial optimization.; Traveling-salesman problem.

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

許明琪.. (2002). The traveling salesman problem and its applications. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/55639

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

許明琪.. “The traveling salesman problem and its applications.” 2002. Thesis, University of Hong Kong. Accessed November 30, 2020. http://hdl.handle.net/10722/55639.

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

許明琪.. “The traveling salesman problem and its applications.” 2002. Web. 30 Nov 2020.

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

Vancouver:

許明琪.. The traveling salesman problem and its applications. [Internet] [Thesis]. University of Hong Kong; 2002. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10722/55639.

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

許明琪.. The traveling salesman problem and its applications. [Thesis]. University of Hong Kong; 2002. Available from: http://hdl.handle.net/10722/55639

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Rochester Institute of Technology

12. Shoaib, Maria. Multi-robot Task Allocation using Agglomerative Clustering.

Degree: MS, Computer Science (GCCIS), 2016, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/9270

► The main objective of this thesis is to solve the *problem* of balancing tasks in the Multi-robot Task Allocation *problem* domain. When allocating a…
(more)

Subjects/Keywords: A*; Agglomerative clustering; Auctions; Multiple robots; Task Allocation; Traveling salesman problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Shoaib, M. (2016). Multi-robot Task Allocation using Agglomerative Clustering. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9270

Chicago Manual of Style (16^{th} Edition):

Shoaib, Maria. “Multi-robot Task Allocation using Agglomerative Clustering.” 2016. Masters Thesis, Rochester Institute of Technology. Accessed November 30, 2020. https://scholarworks.rit.edu/theses/9270.

MLA Handbook (7^{th} Edition):

Shoaib, Maria. “Multi-robot Task Allocation using Agglomerative Clustering.” 2016. Web. 30 Nov 2020.

Vancouver:

Shoaib M. Multi-robot Task Allocation using Agglomerative Clustering. [Internet] [Masters thesis]. Rochester Institute of Technology; 2016. [cited 2020 Nov 30]. Available from: https://scholarworks.rit.edu/theses/9270.

Council of Science Editors:

Shoaib M. Multi-robot Task Allocation using Agglomerative Clustering. [Masters Thesis]. Rochester Institute of Technology; 2016. Available from: https://scholarworks.rit.edu/theses/9270

Cornell University

13.
Gutekunst, Samuel Christian.
Fantastic Relaxations of the TSP and How to Bound them: Relaxations of the *Traveling* *Salesman* *Problem* and their Integrality Gaps.

Degree: PhD, Operations Research and Information Engineering, 2020, Cornell University

URL: http://hdl.handle.net/1813/70346

► The *Traveling* *Salesman* *Problem* (TSP) is a fundamental *problem* in combinatorial optimization, combinatorics, and theoretical computer science and is a canonical NP-hard *problem*. Given a…
(more)

Subjects/Keywords: Approximation Algorithm; Circulant; Integrality Gap; Relaxation; Semidefinite Program; Traveling Salesman Problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Gutekunst, S. C. (2020). Fantastic Relaxations of the TSP and How to Bound them: Relaxations of the Traveling Salesman Problem and their Integrality Gaps. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/70346

Chicago Manual of Style (16^{th} Edition):

Gutekunst, Samuel Christian. “Fantastic Relaxations of the TSP and How to Bound them: Relaxations of the Traveling Salesman Problem and their Integrality Gaps.” 2020. Doctoral Dissertation, Cornell University. Accessed November 30, 2020. http://hdl.handle.net/1813/70346.

MLA Handbook (7^{th} Edition):

Gutekunst, Samuel Christian. “Fantastic Relaxations of the TSP and How to Bound them: Relaxations of the Traveling Salesman Problem and their Integrality Gaps.” 2020. Web. 30 Nov 2020.

Vancouver:

Gutekunst SC. Fantastic Relaxations of the TSP and How to Bound them: Relaxations of the Traveling Salesman Problem and their Integrality Gaps. [Internet] [Doctoral dissertation]. Cornell University; 2020. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1813/70346.

Council of Science Editors:

Gutekunst SC. Fantastic Relaxations of the TSP and How to Bound them: Relaxations of the Traveling Salesman Problem and their Integrality Gaps. [Doctoral Dissertation]. Cornell University; 2020. Available from: http://hdl.handle.net/1813/70346

Cornell University

14.
An, Hyung Chan.
Approximation Algorithms For *Traveling* *Salesman* Problems Based On Linear Programming Relaxations.

Degree: PhD, Computer Science, 2012, Cornell University

URL: http://hdl.handle.net/1813/31039

► The *traveling* *salesman* *problem* (TSP) is the *problem* of finding a shortest Hamiltonian circuit or path in a given weighted graph. This *problem* has been…
(more)

Subjects/Keywords: approximation algorithms; traveling salesman problem; LP relaxations and rounding algorithms

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

An, H. C. (2012). Approximation Algorithms For Traveling Salesman Problems Based On Linear Programming Relaxations. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/31039

Chicago Manual of Style (16^{th} Edition):

An, Hyung Chan. “Approximation Algorithms For Traveling Salesman Problems Based On Linear Programming Relaxations.” 2012. Doctoral Dissertation, Cornell University. Accessed November 30, 2020. http://hdl.handle.net/1813/31039.

MLA Handbook (7^{th} Edition):

An, Hyung Chan. “Approximation Algorithms For Traveling Salesman Problems Based On Linear Programming Relaxations.” 2012. Web. 30 Nov 2020.

Vancouver:

An HC. Approximation Algorithms For Traveling Salesman Problems Based On Linear Programming Relaxations. [Internet] [Doctoral dissertation]. Cornell University; 2012. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1813/31039.

Council of Science Editors:

An HC. Approximation Algorithms For Traveling Salesman Problems Based On Linear Programming Relaxations. [Doctoral Dissertation]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/31039

University of Waterloo

15. Woo, Kyongjae. Cycle Time Reduction of 5-axis Laser Drilling via Time-optimal Trajectory Generation and Sequence Optimization.

Degree: 2019, University of Waterloo

URL: http://hdl.handle.net/10012/14585

► Cycle time reduction is one of the crucial tasks in manufacturing that needs to be achieved to maximize productivity and profits. Laser drilling processes, depending…
(more)

Subjects/Keywords: trajectory planning; traveling salesman problem; laser drilling; optimization

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Woo, K. (2019). Cycle Time Reduction of 5-axis Laser Drilling via Time-optimal Trajectory Generation and Sequence Optimization. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14585

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Woo, Kyongjae. “Cycle Time Reduction of 5-axis Laser Drilling via Time-optimal Trajectory Generation and Sequence Optimization.” 2019. Thesis, University of Waterloo. Accessed November 30, 2020. http://hdl.handle.net/10012/14585.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Woo, Kyongjae. “Cycle Time Reduction of 5-axis Laser Drilling via Time-optimal Trajectory Generation and Sequence Optimization.” 2019. Web. 30 Nov 2020.

Vancouver:

Woo K. Cycle Time Reduction of 5-axis Laser Drilling via Time-optimal Trajectory Generation and Sequence Optimization. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10012/14585.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Woo K. Cycle Time Reduction of 5-axis Laser Drilling via Time-optimal Trajectory Generation and Sequence Optimization. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14585

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

16. Hari, Sai Krishna Kanth. Optimal Routing of Unmanned Vehicles in Persistent Monitoring Missions.

Degree: PhD, Mechanical Engineering, 2019, Texas A&M University

URL: http://hdl.handle.net/1969.1/188741

► Missions such as forest fire monitoring, military surveillance and infrastructure monitoring are referred to as persistent monitoring missions. These missions rely heavily on continual data…
(more)

Subjects/Keywords: Persistent Monitoring; UAV; Optimal Routing; Traveling Salesman Problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hari, S. K. K. (2019). Optimal Routing of Unmanned Vehicles in Persistent Monitoring Missions. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/188741

Chicago Manual of Style (16^{th} Edition):

Hari, Sai Krishna Kanth. “Optimal Routing of Unmanned Vehicles in Persistent Monitoring Missions.” 2019. Doctoral Dissertation, Texas A&M University. Accessed November 30, 2020. http://hdl.handle.net/1969.1/188741.

MLA Handbook (7^{th} Edition):

Hari, Sai Krishna Kanth. “Optimal Routing of Unmanned Vehicles in Persistent Monitoring Missions.” 2019. Web. 30 Nov 2020.

Vancouver:

Hari SKK. Optimal Routing of Unmanned Vehicles in Persistent Monitoring Missions. [Internet] [Doctoral dissertation]. Texas A&M University; 2019. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/1969.1/188741.

Council of Science Editors:

Hari SKK. Optimal Routing of Unmanned Vehicles in Persistent Monitoring Missions. [Doctoral Dissertation]. Texas A&M University; 2019. Available from: http://hdl.handle.net/1969.1/188741

Colorado State University

17.
Hains, Douglas R.
Generalized partition crossover for the *traveling* *salesman* * problem*.

Degree: MS(M.S.), Computer Science, 2011, Colorado State University

URL: http://hdl.handle.net/10217/47314

► The *Traveling* *Salesman* *Problem* (TSP) is a well-studied combinatorial optimization *problem* with a wide spectrum of applications and theoretical value. We have designed a new…
(more)

Subjects/Keywords: genetic algorithms; Traveling Salesman Problem; search space; local search

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hains, D. R. (2011). Generalized partition crossover for the traveling salesman problem. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/47314

Chicago Manual of Style (16^{th} Edition):

Hains, Douglas R. “Generalized partition crossover for the traveling salesman problem.” 2011. Masters Thesis, Colorado State University. Accessed November 30, 2020. http://hdl.handle.net/10217/47314.

MLA Handbook (7^{th} Edition):

Hains, Douglas R. “Generalized partition crossover for the traveling salesman problem.” 2011. Web. 30 Nov 2020.

Vancouver:

Hains DR. Generalized partition crossover for the traveling salesman problem. [Internet] [Masters thesis]. Colorado State University; 2011. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10217/47314.

Council of Science Editors:

Hains DR. Generalized partition crossover for the traveling salesman problem. [Masters Thesis]. Colorado State University; 2011. Available from: http://hdl.handle.net/10217/47314

18.
Perng, Chyuan.
A bicriterion *traveling* *salesman* * problem*.

Degree: Industrial and Systems Engineering, 1989, Texas Tech University

URL: http://hdl.handle.net/2346/10674

► 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…
(more)

Subjects/Keywords: Traveling-salesman problem

…production cost). The first *problem* can be
described as Multi-criterion *Traveling* *Salesman*… …constraint.
Definiwion and Assumptions
The multi-criterion *traveling* *salesman* *problem* can be… …then V* is an undominated
solution.
A Bicriterion *Traveling* *Salesman*
*Problem* (BCTSP… …x29;
The bicriterion *traveling* *salesman* *problem* is a
special case of the MCTSP with m=2. For… …of both Zc(P) and
ZT(P).
The bicriterion *traveling* *salesman* *problem*…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Perng, C. (1989). A bicriterion traveling salesman problem. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/10674

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Perng, Chyuan. “A bicriterion traveling salesman problem.” 1989. Thesis, Texas Tech University. Accessed November 30, 2020. http://hdl.handle.net/2346/10674.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Perng, Chyuan. “A bicriterion traveling salesman problem.” 1989. Web. 30 Nov 2020.

Vancouver:

Perng C. A bicriterion traveling salesman problem. [Internet] [Thesis]. Texas Tech University; 1989. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/2346/10674.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Perng C. A bicriterion traveling salesman problem. [Thesis]. Texas Tech University; 1989. Available from: http://hdl.handle.net/2346/10674

Not specified: Masters Thesis or Doctoral Dissertation

19.
Rojanasoonthon, Siwate.
Methods for the solution of a priori *traveling* *salesman* problems.

Degree: Industrial and Systems Engineering, 1990, Texas Tech University

URL: http://hdl.handle.net/2346/17223

► The objective of this research is to develop a heuristic method that produces a good solution to probabilistic *traveling* *salesman* *problem* (PTSP). The probability of…
(more)

Subjects/Keywords: Traveling-salesman problem

…*salesman* *problem* (TSP).
This research deals with a probabilistic *traveling*
*salesman*… …spanning tree *problem*, the probabilistic *traveling* *salesman* *problem*, the probabilistic vehicle… …routing
*problem*, the probabilistic *traveling* *salesman* facility
location *problem*, and the… …*traveling* *salesman* facility location *problem*.
Examination of characteristics, development
of… …nodes and the home station.
(Use
any conventional *traveling* *salesman* *problem* algorithm…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Rojanasoonthon, S. (1990). Methods for the solution of a priori traveling salesman problems. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/17223

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Rojanasoonthon, Siwate. “Methods for the solution of a priori traveling salesman problems.” 1990. Thesis, Texas Tech University. Accessed November 30, 2020. http://hdl.handle.net/2346/17223.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rojanasoonthon, Siwate. “Methods for the solution of a priori traveling salesman problems.” 1990. Web. 30 Nov 2020.

Vancouver:

Rojanasoonthon S. Methods for the solution of a priori traveling salesman problems. [Internet] [Thesis]. Texas Tech University; 1990. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/2346/17223.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rojanasoonthon S. Methods for the solution of a priori traveling salesman problems. [Thesis]. Texas Tech University; 1990. Available from: http://hdl.handle.net/2346/17223

Not specified: Masters Thesis or Doctoral Dissertation

University of Hong Kong

20.
Feng, Feng.
The *traveling* *salesman*
*problem* and the subtour linear programming.

Degree: 2017, University of Hong Kong

URL: http://hdl.handle.net/10722/249902

► A *salesman* wishes to make a journey, visiting each of n cities exactly once and finishing at the city he starts from. Suppose that there…
(more)

Subjects/Keywords: Linear programming; Traveling salesman problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Feng, F. (2017). The traveling salesman problem and the subtour linear programming. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/249902

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Feng, Feng. “The traveling salesman problem and the subtour linear programming.” 2017. Thesis, University of Hong Kong. Accessed November 30, 2020. http://hdl.handle.net/10722/249902.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Feng, Feng. “The traveling salesman problem and the subtour linear programming.” 2017. Web. 30 Nov 2020.

Vancouver:

Feng F. The traveling salesman problem and the subtour linear programming. [Internet] [Thesis]. University of Hong Kong; 2017. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10722/249902.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Feng F. The traveling salesman problem and the subtour linear programming. [Thesis]. University of Hong Kong; 2017. Available from: http://hdl.handle.net/10722/249902

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

21.
White, John Lincoln.
A New Class of Cycle Inequality for the Time-Dependent *Traveling* *Salesman* * Problem*.

Degree: 2010, University of Waterloo

URL: http://hdl.handle.net/10012/5543

► The Time-Dependent *Traveling* *Salesman* *Problem* is a generalization of the well-known *Traveling* *Salesman* *Problem*, where the cost for travel between two nodes is dependent on…
(more)

Subjects/Keywords: Integer Programming; Traveling Salesman Problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

White, J. L. (2010). A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5543

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

White, John Lincoln. “A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem.” 2010. Thesis, University of Waterloo. Accessed November 30, 2020. http://hdl.handle.net/10012/5543.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

White, John Lincoln. “A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem.” 2010. Web. 30 Nov 2020.

Vancouver:

White JL. A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10012/5543.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

White JL. A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5543

Not specified: Masters Thesis or Doctoral Dissertation

University of Georgia

22.
Eury, Allison Howard.
The choice efficiency of capuchin monkeys (Cebus apella) in a laser pointer *traveling* *salesman* *problem* task.

Degree: 2014, University of Georgia

URL: http://hdl.handle.net/10724/26888

► Non-human primates have demonstrated a preference for efficient route choices in the wild and in simulated foraging experiments. This experiment tested the preferences of two…
(more)

Subjects/Keywords: Traveling Salesman Problem; Route Choice; Cebus; Spatial Cognition; Egocentric; Allocentric

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Eury, A. H. (2014). The choice efficiency of capuchin monkeys (Cebus apella) in a laser pointer traveling salesman problem task. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/26888

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Eury, Allison Howard. “The choice efficiency of capuchin monkeys (Cebus apella) in a laser pointer traveling salesman problem task.” 2014. Thesis, University of Georgia. Accessed November 30, 2020. http://hdl.handle.net/10724/26888.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Eury, Allison Howard. “The choice efficiency of capuchin monkeys (Cebus apella) in a laser pointer traveling salesman problem task.” 2014. Web. 30 Nov 2020.

Vancouver:

Eury AH. The choice efficiency of capuchin monkeys (Cebus apella) in a laser pointer traveling salesman problem task. [Internet] [Thesis]. University of Georgia; 2014. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10724/26888.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Eury AH. The choice efficiency of capuchin monkeys (Cebus apella) in a laser pointer traveling salesman problem task. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/26888

Not specified: Masters Thesis or Doctoral Dissertation

Virginia Tech

23. Budhiraja, Ashish Kumar. View Point Planning for Inspecting Static and Dynamic Scenes with Multi-Robot Teams.

Degree: MS, Computer Engineering, 2017, Virginia Tech

URL: http://hdl.handle.net/10919/78807

► We study the *problem* of viewpoint planning in static and dynamic scenes using multi-robot teams. This work is motivated by two applications: bridge inspection and…
(more)

Subjects/Keywords: Multi-Robot Coordination; Traveling Salesman Problem; Target Tracking

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Budhiraja, A. K. (2017). View Point Planning for Inspecting Static and Dynamic Scenes with Multi-Robot Teams. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/78807

Chicago Manual of Style (16^{th} Edition):

Budhiraja, Ashish Kumar. “View Point Planning for Inspecting Static and Dynamic Scenes with Multi-Robot Teams.” 2017. Masters Thesis, Virginia Tech. Accessed November 30, 2020. http://hdl.handle.net/10919/78807.

MLA Handbook (7^{th} Edition):

Budhiraja, Ashish Kumar. “View Point Planning for Inspecting Static and Dynamic Scenes with Multi-Robot Teams.” 2017. Web. 30 Nov 2020.

Vancouver:

Budhiraja AK. View Point Planning for Inspecting Static and Dynamic Scenes with Multi-Robot Teams. [Internet] [Masters thesis]. Virginia Tech; 2017. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10919/78807.

Council of Science Editors:

Budhiraja AK. View Point Planning for Inspecting Static and Dynamic Scenes with Multi-Robot Teams. [Masters Thesis]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/78807

Iowa State University

24.
Lan, Bo.
*Traveling**salesman* *problem* with time windows and drones (TSPTWD).

Degree: 2020, Iowa State University

URL: https://lib.dr.iastate.edu/etd/18165

► In this dissertation, I study a relatively novel variant form of *traveling* *salesman* *problem* (TSP), i.e. *traveling* *salesman* *problem* with time windows and a drone…
(more)

Subjects/Keywords: Drones; intermediate points; Time windows; Traveling Salesman Problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lan, B. (2020). Traveling salesman problem with time windows and drones (TSPTWD). (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/18165

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Lan, Bo. “Traveling salesman problem with time windows and drones (TSPTWD).” 2020. Thesis, Iowa State University. Accessed November 30, 2020. https://lib.dr.iastate.edu/etd/18165.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lan, Bo. “Traveling salesman problem with time windows and drones (TSPTWD).” 2020. Web. 30 Nov 2020.

Vancouver:

Lan B. Traveling salesman problem with time windows and drones (TSPTWD). [Internet] [Thesis]. Iowa State University; 2020. [cited 2020 Nov 30]. Available from: https://lib.dr.iastate.edu/etd/18165.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lan B. Traveling salesman problem with time windows and drones (TSPTWD). [Thesis]. Iowa State University; 2020. Available from: https://lib.dr.iastate.edu/etd/18165

Not specified: Masters Thesis or Doctoral Dissertation

Wichita State University

25.
Kookhahi, Elham .
Distribution planning with slective *traveling* *salesman* and vehicle routing problems
.

Degree: 2016, Wichita State University

URL: http://hdl.handle.net/10057/13512

► This dissertation introduces a new class of selective *traveling* *salesman* *problem* (TSP) and vehicle routing *problem* (VRP) in which the goal is to maximize the…
(more)

Subjects/Keywords: Traveling salesman problem; Vehicle routing problem; Mixed-integer linear mathematical models; Metaheuristic method

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Kookhahi, E. (2016). Distribution planning with slective traveling salesman and vehicle routing problems . (Doctoral Dissertation). Wichita State University. Retrieved from http://hdl.handle.net/10057/13512

Chicago Manual of Style (16^{th} Edition):

Kookhahi, Elham . “Distribution planning with slective traveling salesman and vehicle routing problems .” 2016. Doctoral Dissertation, Wichita State University. Accessed November 30, 2020. http://hdl.handle.net/10057/13512.

MLA Handbook (7^{th} Edition):

Kookhahi, Elham . “Distribution planning with slective traveling salesman and vehicle routing problems .” 2016. Web. 30 Nov 2020.

Vancouver:

Kookhahi E. Distribution planning with slective traveling salesman and vehicle routing problems . [Internet] [Doctoral dissertation]. Wichita State University; 2016. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10057/13512.

Council of Science Editors:

Kookhahi E. Distribution planning with slective traveling salesman and vehicle routing problems . [Doctoral Dissertation]. Wichita State University; 2016. Available from: http://hdl.handle.net/10057/13512

University of Illinois – Urbana-Champaign

26.
Kaushik, Varsha Ravi Prakash.
GPU accelerated Hungarian algorithm for *traveling* *salesman* * problem*.

Degree: MS, Industrial Engineering, 2017, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/97805

► In this thesis, we present a model of the *Traveling* *Salesman* *Problem* (TSP) cast in a quadratic assignment *problem* framework with linearized objective function and…
(more)

Subjects/Keywords: Compute Unified Device Architecture (CUDA); Linear assignment problem; Traveling salesman problem; Reformulation Linearization Technique (RLT)

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Kaushik, V. R. P. (2017). GPU accelerated Hungarian algorithm for traveling salesman problem. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97805

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Kaushik, Varsha Ravi Prakash. “GPU accelerated Hungarian algorithm for traveling salesman problem.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed November 30, 2020. http://hdl.handle.net/2142/97805.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kaushik, Varsha Ravi Prakash. “GPU accelerated Hungarian algorithm for traveling salesman problem.” 2017. Web. 30 Nov 2020.

Vancouver:

Kaushik VRP. GPU accelerated Hungarian algorithm for traveling salesman problem. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/2142/97805.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kaushik VRP. GPU accelerated Hungarian algorithm for traveling salesman problem. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97805

Not specified: Masters Thesis or Doctoral Dissertation

University of Georgia

27. Deng, Rucen. Spray treatment planning using the ant system Metaheuristic.

Degree: 2014, University of Georgia

URL: http://hdl.handle.net/10724/23346

► The spray treatment planning project is designed to assist the pesticide management programs as a computerized decision support system for optimizing spray routes. This optimization…
(more)

Subjects/Keywords: Heuristic Search; Ant System Metaheuristic; Capacitated Vehicle Routing Problem; Traveling Salesman Problem; Ant Colony Optimization

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Deng, R. (2014). Spray treatment planning using the ant system Metaheuristic. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/23346

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Deng, Rucen. “Spray treatment planning using the ant system Metaheuristic.” 2014. Thesis, University of Georgia. Accessed November 30, 2020. http://hdl.handle.net/10724/23346.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Deng, Rucen. “Spray treatment planning using the ant system Metaheuristic.” 2014. Web. 30 Nov 2020.

Vancouver:

Deng R. Spray treatment planning using the ant system Metaheuristic. [Internet] [Thesis]. University of Georgia; 2014. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/10724/23346.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Deng R. Spray treatment planning using the ant system Metaheuristic. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/23346

Not specified: Masters Thesis or Doctoral Dissertation

University of California – Berkeley

28.
Ahmadipouranari, Nima.
New Approaches to the Asymmetric *Traveling* *Salesman* and Related Problems.

Degree: Computer Science, 2015, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/0gf14980

► The Asymmetric *Traveling* *Salesman* *Problem* and its variants are optimization problems that are widely studied from the viewpoint of approximation algorithms as well as hardness…
(more)

Subjects/Keywords: Computer science; Mathematics; Asymmetric Traveling Salesman Problem; Kadison-Singer; Strongly Rayleigh Measure; Thin Tree

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Ahmadipouranari, N. (2015). New Approaches to the Asymmetric Traveling Salesman and Related Problems. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/0gf14980

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Ahmadipouranari, Nima. “New Approaches to the Asymmetric Traveling Salesman and Related Problems.” 2015. Thesis, University of California – Berkeley. Accessed November 30, 2020. http://www.escholarship.org/uc/item/0gf14980.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ahmadipouranari, Nima. “New Approaches to the Asymmetric Traveling Salesman and Related Problems.” 2015. Web. 30 Nov 2020.

Vancouver:

Ahmadipouranari N. New Approaches to the Asymmetric Traveling Salesman and Related Problems. [Internet] [Thesis]. University of California – Berkeley; 2015. [cited 2020 Nov 30]. Available from: http://www.escholarship.org/uc/item/0gf14980.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ahmadipouranari N. New Approaches to the Asymmetric Traveling Salesman and Related Problems. [Thesis]. University of California – Berkeley; 2015. Available from: http://www.escholarship.org/uc/item/0gf14980

Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

29. Peng, Jiayu. New Developments in Design of Experiments.

Degree: 2019, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/16109jup250

► This dissertation consists of three projects on the design of experiments. The first project is on order-of-addition experiments. In an order-of-addition *problem*, the output of…
(more)

Subjects/Keywords: Optimal design; Order-of-addition; Run order; Screening design; Exchange algorithm; Traveling Salesman Problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Peng, J. (2019). New Developments in Design of Experiments. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/16109jup250

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Peng, Jiayu. “New Developments in Design of Experiments.” 2019. Thesis, Penn State University. Accessed November 30, 2020. https://submit-etda.libraries.psu.edu/catalog/16109jup250.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Peng, Jiayu. “New Developments in Design of Experiments.” 2019. Web. 30 Nov 2020.

Vancouver:

Peng J. New Developments in Design of Experiments. [Internet] [Thesis]. Penn State University; 2019. [cited 2020 Nov 30]. Available from: https://submit-etda.libraries.psu.edu/catalog/16109jup250.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Peng J. New Developments in Design of Experiments. [Thesis]. Penn State University; 2019. Available from: https://submit-etda.libraries.psu.edu/catalog/16109jup250

Not specified: Masters Thesis or Doctoral Dissertation

Kaunas University of Technology

30. Putrius, Šarūnas. Atkaitinimo modeliavimo algoritmo komivojažieriaus uždaviniui sudarymas ir tyrimas.

Degree: Master, Informatics, 2008, Kaunas University of Technology

URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2008~D_20080811_154745-32747 ;

►

Šiame magistriniame darbe buvo koncentruojamasi į atkaitinimo modeliavimo algoritmo sudarymą ir jo taikymą kombinatorinio optimizavimo uždaviniui – komivojažieriaus uždaviniui. Pagrindiniai darbo tikslai būtų sudaryti ir… (more)

Subjects/Keywords: Komivojažieriaus uždavinys; Atkaitinimo modeliavimas; Euristiniai algoritmai; Traveling salesman problem; Sumulated annealing; Combinatorial optimization

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Putrius, Šarūnas. (2008). Atkaitinimo modeliavimo algoritmo komivojažieriaus uždaviniui sudarymas ir tyrimas. (Masters Thesis). Kaunas University of Technology. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2008~D_20080811_154745-32747 ;

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

Chicago Manual of Style (16^{th} Edition):

Putrius, Šarūnas. “Atkaitinimo modeliavimo algoritmo komivojažieriaus uždaviniui sudarymas ir tyrimas.” 2008. Masters Thesis, Kaunas University of Technology. Accessed November 30, 2020. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2008~D_20080811_154745-32747 ;.

Note: this citation may be lacking information needed for this citation format:

Author name may be incomplete

MLA Handbook (7^{th} Edition):

Putrius, Šarūnas. “Atkaitinimo modeliavimo algoritmo komivojažieriaus uždaviniui sudarymas ir tyrimas.” 2008. Web. 30 Nov 2020.

Author name may be incomplete

Vancouver:

Putrius, Šarūnas. Atkaitinimo modeliavimo algoritmo komivojažieriaus uždaviniui sudarymas ir tyrimas. [Internet] [Masters thesis]. Kaunas University of Technology; 2008. [cited 2020 Nov 30]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2008~D_20080811_154745-32747 ;.

Author name may be incomplete

Council of Science Editors:

Putrius, Šarūnas. Atkaitinimo modeliavimo algoritmo komivojažieriaus uždaviniui sudarymas ir tyrimas. [Masters Thesis]. Kaunas University of Technology; 2008. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2008~D_20080811_154745-32747 ;

Author name may be incomplete