Advanced search options

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

You searched for `subject:(Traveling Salesman Problem with Time window)`

.
Showing records 1 – 30 of
49727 total matches.

◁ [1] [2] [3] [4] [5] … [1658] ▶

Search Limiters

Dates

- 2017 – 2021 (13501)
- 2012 – 2016 (17382)
- 2007 – 2011 (10785)
- 2002 – 2006 (4359)
- 1997 – 2001 (1671)
- 1992 – 1996 (1099)
- 1987 – 1991 (868)
- 1982 – 1986 (833)
- 1977 – 1981 (731)
- 1972 – 1976 (633)

Universities

- Brno University of Technology (3352)
- University of São Paulo (863)
- Virginia Tech (745)
- The Ohio State University (726)
- Michigan State University (709)
- Delft University of Technology (606)
- NSYSU (604)
- Texas A&M University (544)
- University of Texas – Austin (540)
- University of Florida (533)
- University of Hong Kong (531)
- University of Michigan (516)
- National University of Singapore (442)
- Georgia Tech (421)
- University of Pretoria (397)

Department

- Electrical Engineering (613)
- Psychology (612)
- Computer Science (471)
- Electrical and Computer Engineering (470)
- Mechanical Engineering (389)
- Education (388)
- Graduate School (354)
- Mathematics (338)
- Informatique (332)
- Civil Engineering (318)
- Physics (247)
- Economics (185)
- Social Work (184)
- Statistics (175)
- School of Social Work (154)

Degrees

- PhD (8540)
- MS (2962)
- Docteur es (2731)
- Master (1120)
- MA (880)
- Mestrado (502)
- EdD (293)
- MSW (233)
- MEd (140)
- MS(M.S.) (95)
- MFA (93)
- MSin Engineering (82)
- DMA (76)
- MAin Education (72)
- M. Arch. (61)

Levels

- doctoral (15388)
- masters (8776)
- thesis (705)
- project (205)
- dissertation (78)
- doctor of philosophy ph.d. (67)
- doctor of philosophy (ph.d.) (41)
- thesis - unrestricted (33)
- dissertation - unrestricted (21)
- open access (10)

Languages

Country

- US (18182)
- Sweden (3545)
- Czech Republic (3377)
- Brazil (3239)
- Canada (3218)
- France (2732)
- Australia (1702)
- South Africa (1565)
- Netherlands (1402)
- UK (1348)
- Greece (1249)
- Portugal (1000)
- New Zealand (694)
- Hong Kong (635)
- Taiwan (604)

▼ Search Limiters

Virginia Tech

1. Baik, Hojong. Development of Optimization and Simulation Models for the Analysis of Airfield Operations.

Degree: PhD, Civil Engineering, 2000, Virginia Tech

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

► This research is concerned with the modeling and development of algorithmic approaches for solving airport operational problems that arise in Air Traffic Control (ATC) systems…
(more)

Subjects/Keywords: Dynamic Network Assignment Problem; Traveling Salesman Problem with Time-window; Integer Programming; Object-oriented Programming; Microscopic Simulation Model; Air Traffic Control

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Baik, H. (2000). Development of Optimization and Simulation Models for the Analysis of Airfield Operations. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/28162

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

Baik, Hojong. “Development of Optimization and Simulation Models for the Analysis of Airfield Operations.” 2000. Doctoral Dissertation, Virginia Tech. Accessed February 25, 2021. http://hdl.handle.net/10919/28162.

MLA Handbook (7^{th} Edition):

Baik, Hojong. “Development of Optimization and Simulation Models for the Analysis of Airfield Operations.” 2000. Web. 25 Feb 2021.

Vancouver:

Baik H. Development of Optimization and Simulation Models for the Analysis of Airfield Operations. [Internet] [Doctoral dissertation]. Virginia Tech; 2000. [cited 2021 Feb 25]. Available from: http://hdl.handle.net/10919/28162.

Council of Science Editors:

Baik H. Development of Optimization and Simulation Models for the Analysis of Airfield Operations. [Doctoral Dissertation]. Virginia Tech; 2000. Available from: http://hdl.handle.net/10919/28162

Iowa State University

2.
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

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):

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

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

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. 25 Feb 2021.

Vancouver:

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

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

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

University of Johannesburg

3.
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

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 February 25, 2021. http://hdl.handle.net/10210/12237.

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. 25 Feb 2021.

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 2021 Feb 25]. Available from: http://hdl.handle.net/10210/12237.

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

4.
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 February 25, 2021. 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. 25 Feb 2021.

Vancouver:

Geldenhuys CE. An implementation of a branch-and-cut algorithm for the travelling salesman problem. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2021 Feb 25]. 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

Texas State University – San Marcos

5. Gonzalez, Andres. A Parallel Implementation of A Greedy TSP Algorithm.

Degree: MS, Computer Science, 2020, Texas State University – San Marcos

URL: https://digital.library.txstate.edu/handle/10877/12922

► The *Traveling* *Salesman* *Problem* has often been used as an exploration ground for building heuristics to calculate the shortest path of a complete graph that…
(more)

Subjects/Keywords: TSP; Traveling Salesman Problem

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gonzalez, A. (2020). A Parallel Implementation of A Greedy TSP Algorithm. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/12922

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

Gonzalez, Andres. “A Parallel Implementation of A Greedy TSP Algorithm.” 2020. Masters Thesis, Texas State University – San Marcos. Accessed February 25, 2021. https://digital.library.txstate.edu/handle/10877/12922.

MLA Handbook (7^{th} Edition):

Gonzalez, Andres. “A Parallel Implementation of A Greedy TSP Algorithm.” 2020. Web. 25 Feb 2021.

Vancouver:

Gonzalez A. A Parallel Implementation of A Greedy TSP Algorithm. [Internet] [Masters thesis]. Texas State University – San Marcos; 2020. [cited 2021 Feb 25]. Available from: https://digital.library.txstate.edu/handle/10877/12922.

Council of Science Editors:

Gonzalez A. A Parallel Implementation of A Greedy TSP Algorithm. [Masters Thesis]. Texas State University – San Marcos; 2020. Available from: https://digital.library.txstate.edu/handle/10877/12922

Utah State University

6. Hommadi, Abbas. Multi-Stop Routing Optimization: A Genetic Algorithm Approach.

Degree: MS, Computer Science, 2018, Utah State University

URL: https://digitalcommons.usu.edu/etd/7048

► In this research, we investigate and propose new operators to improve Genetic Algorithm’s performance to solve the multi-stop routing *problem*. In a multi-stop route,…
(more)

Subjects/Keywords: Routing; Genetic Algorithm; Optimization; Time-Dependent Routing; Traveling Salesman Problem; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hommadi, A. (2018). Multi-Stop Routing Optimization: A Genetic Algorithm Approach. (Masters Thesis). Utah State University. Retrieved from https://digitalcommons.usu.edu/etd/7048

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

Hommadi, Abbas. “Multi-Stop Routing Optimization: A Genetic Algorithm Approach.” 2018. Masters Thesis, Utah State University. Accessed February 25, 2021. https://digitalcommons.usu.edu/etd/7048.

MLA Handbook (7^{th} Edition):

Hommadi, Abbas. “Multi-Stop Routing Optimization: A Genetic Algorithm Approach.” 2018. Web. 25 Feb 2021.

Vancouver:

Hommadi A. Multi-Stop Routing Optimization: A Genetic Algorithm Approach. [Internet] [Masters thesis]. Utah State University; 2018. [cited 2021 Feb 25]. Available from: https://digitalcommons.usu.edu/etd/7048.

Council of Science Editors:

Hommadi A. Multi-Stop Routing Optimization: A Genetic Algorithm Approach. [Masters Thesis]. Utah State University; 2018. Available from: https://digitalcommons.usu.edu/etd/7048

University of Windsor

7. Kamal, K. Raiyan. Ant Colony Optimization for Jointly Solving Relay Node Placement and Trajectory Calculation in Hierarchical Wireless Sensor Networks.

Degree: MS, Computer Science, 2014, University of Windsor

URL: http://scholar.uwindsor.ca/etd/5054

► Given the locations of the Sensor Nodes in a Wireless Sensor Networks (WSN), finding the minimum number of Relays required and their locations such…
(more)

Subjects/Keywords: Applied sciences; Ant colony optimization; Optimization; Relay node placement; Travelingsalesman problem; Traveling salesman problem with neighborhood; Wireless sensor networks; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kamal, K. R. (2014). Ant Colony Optimization for Jointly Solving Relay Node Placement and Trajectory Calculation in Hierarchical Wireless Sensor Networks. (Masters Thesis). University of Windsor. Retrieved from http://scholar.uwindsor.ca/etd/5054

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

Kamal, K Raiyan. “Ant Colony Optimization for Jointly Solving Relay Node Placement and Trajectory Calculation in Hierarchical Wireless Sensor Networks.” 2014. Masters Thesis, University of Windsor. Accessed February 25, 2021. http://scholar.uwindsor.ca/etd/5054.

MLA Handbook (7^{th} Edition):

Kamal, K Raiyan. “Ant Colony Optimization for Jointly Solving Relay Node Placement and Trajectory Calculation in Hierarchical Wireless Sensor Networks.” 2014. Web. 25 Feb 2021.

Vancouver:

Kamal KR. Ant Colony Optimization for Jointly Solving Relay Node Placement and Trajectory Calculation in Hierarchical Wireless Sensor Networks. [Internet] [Masters thesis]. University of Windsor; 2014. [cited 2021 Feb 25]. Available from: http://scholar.uwindsor.ca/etd/5054.

Council of Science Editors:

Kamal KR. Ant Colony Optimization for Jointly Solving Relay Node Placement and Trajectory Calculation in Hierarchical Wireless Sensor Networks. [Masters Thesis]. University of Windsor; 2014. Available from: http://scholar.uwindsor.ca/etd/5054

Oregon State University

8.
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 February 25, 2021. 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. 25 Feb 2021.

Vancouver:

Starr RW. A multi-tour heuristic for the traveling salesman problem. [Internet] [Masters thesis]. Oregon State University; 1980. [cited 2021 Feb 25]. 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

9.
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 February 25, 2021. 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. 25 Feb 2021.

Vancouver:

Qian D. Dynamic Programming: Salesman to Surgeon. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2021 Feb 25]. 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

10.
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 February 25, 2021. 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. 25 Feb 2021.

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 2021 Feb 25]. 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

11.
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 February 25, 2021. 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. 25 Feb 2021.

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 2021 Feb 25]. 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

12.
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 February 25, 2021. 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. 25 Feb 2021.

Vancouver:

Bau NJ. On the solution of traveling salesman problems under conditions of sparseness. [Internet] [Masters thesis]. Georgia Tech; 1976. [cited 2021 Feb 25]. 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

13.
Duque Villarreal , Daniel.
Solving the Orienteering *Problem* with *Time* Windows Via the Pulse
.

Degree: 2016, Universidad de los Andes

URL: http://documentodegrado.uniandes.edu.co/documentos/Duque_OPTW_05302013.pdf

► El Problema de Orientación con Ventanas de Tiempo (OPTW por sus siglas en ingles) consiste en encontrar un camino que maximice el beneficio disponible en…
(more)

Subjects/Keywords: Routing; Trip design; Traveling salesman problem with profits; Vehicle Routing Problem with Time Windows

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Duque Villarreal , D. (2016). Solving the Orienteering Problem with Time Windows Via the Pulse . (Thesis). Universidad de los Andes. Retrieved from http://documentodegrado.uniandes.edu.co/documentos/Duque_OPTW_05302013.pdf

Not specified: Masters Thesis or Doctoral Dissertation

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

Duque Villarreal , Daniel. “Solving the Orienteering Problem with Time Windows Via the Pulse .” 2016. Thesis, Universidad de los Andes. Accessed February 25, 2021. http://documentodegrado.uniandes.edu.co/documentos/Duque_OPTW_05302013.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Duque Villarreal , Daniel. “Solving the Orienteering Problem with Time Windows Via the Pulse .” 2016. Web. 25 Feb 2021.

Vancouver:

Duque Villarreal D. Solving the Orienteering Problem with Time Windows Via the Pulse . [Internet] [Thesis]. Universidad de los Andes; 2016. [cited 2021 Feb 25]. Available from: http://documentodegrado.uniandes.edu.co/documentos/Duque_OPTW_05302013.pdf.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Duque Villarreal D. Solving the Orienteering Problem with Time Windows Via the Pulse . [Thesis]. Universidad de los Andes; 2016. Available from: http://documentodegrado.uniandes.edu.co/documentos/Duque_OPTW_05302013.pdf

Not specified: Masters Thesis or Doctoral Dissertation

Universidade de Lisboa

14. Silva, João Carlos Lopes da. Planeamento de rotas de distribuição.

Degree: 2016, Universidade de Lisboa

URL: http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/24881

►

Tese de mestrado, Estatística e Investigação Operacional, Universidade de Lisboa, Faculdade de Ciências, 2016

Considerando um conjunto de clientes que necessitam de ser visitados num… (more)

Subjects/Keywords: Algoritmos exactos; Traveling Salesman Problem; Vehicle Routing Problem; Time Windows; Teses de mestrado - 2016; Departamento de Estatística e Investigação Operacional

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Silva, J. C. L. d. (2016). Planeamento de rotas de distribuição. (Thesis). Universidade de Lisboa. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/24881

Not specified: Masters Thesis or Doctoral Dissertation

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

Silva, João Carlos Lopes da. “Planeamento de rotas de distribuição.” 2016. Thesis, Universidade de Lisboa. Accessed February 25, 2021. http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/24881.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Silva, João Carlos Lopes da. “Planeamento de rotas de distribuição.” 2016. Web. 25 Feb 2021.

Vancouver:

Silva JCLd. Planeamento de rotas de distribuição. [Internet] [Thesis]. Universidade de Lisboa; 2016. [cited 2021 Feb 25]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/24881.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Silva JCLd. Planeamento de rotas de distribuição. [Thesis]. Universidade de Lisboa; 2016. Available from: http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/24881

Not specified: Masters Thesis or Doctoral Dissertation

15. 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 February 25, 2021. 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. 25 Feb 2021.

Vancouver:

Gao Z. Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2021 Feb 25]. 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

16. 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 February 25, 2021. 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. 25 Feb 2021.

Vancouver:

Shing MTP. Optimal route planning for probabilistic landscape exploration. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2020. [cited 2021 Feb 25]. 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

17.
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 February 25, 2021. 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. 25 Feb 2021.

Vancouver:

Roerty DF. M-salesman balanced tours traveling salesman problem with multiple visits to cities allowed. [Internet] [Thesis]. Texas Tech University; 1974. [cited 2021 Feb 25]. 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

18.
Shojaei, Radoyeh.
A parallel branch and bound algorithm for the sequential ordering * problem*.

Degree: MS, Computer Science, 2019, California State University – Sacramento

URL: http://hdl.handle.net/10211.3/210197

► The Sequential Ordering *Problem* (SOP) is a combinatorial optimization *problem*. Given a directed weighted graph and an unweighted directed graph representing precedence constraints among vertices,…
(more)

Subjects/Keywords: Precedence constrained traveling salesman problem; Asymmetric traveling salesman with precedence constraints; Parallel algorithms

…generalization of the Asymmetric
*Traveling* *Salesman* *Problem* (TSP) [1]. The SOP… …quadcore processor *with* a *time* limit of 2 hours per instance show that the proposed parallel… …sub-*problem* solutions, referred to as decomposition. The
sub-problems are solved *with* an ILP… …Miller solve the asymmetric-TSP *with* a parallel B&B algorithm using
the assignment *problem* as a… …same location, so the remaining *problem* is identical
between the similar nodes. The node *with*…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shojaei, R. (2019). A parallel branch and bound algorithm for the sequential ordering problem. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.3/210197

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

Shojaei, Radoyeh. “A parallel branch and bound algorithm for the sequential ordering problem.” 2019. Masters Thesis, California State University – Sacramento. Accessed February 25, 2021. http://hdl.handle.net/10211.3/210197.

MLA Handbook (7^{th} Edition):

Shojaei, Radoyeh. “A parallel branch and bound algorithm for the sequential ordering problem.” 2019. Web. 25 Feb 2021.

Vancouver:

Shojaei R. A parallel branch and bound algorithm for the sequential ordering problem. [Internet] [Masters thesis]. California State University – Sacramento; 2019. [cited 2021 Feb 25]. Available from: http://hdl.handle.net/10211.3/210197.

Council of Science Editors:

Shojaei R. A parallel branch and bound algorithm for the sequential ordering problem. [Masters Thesis]. California State University – Sacramento; 2019. Available from: http://hdl.handle.net/10211.3/210197

University of Hong Kong

19.
許明琪.
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 February 25, 2021. 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. 25 Feb 2021.

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 2021 Feb 25]. 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

20. 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 February 25, 2021. https://scholarworks.rit.edu/theses/9270.

MLA Handbook (7^{th} Edition):

Shoaib, Maria. “Multi-robot Task Allocation using Agglomerative Clustering.” 2016. Web. 25 Feb 2021.

Vancouver:

Shoaib M. Multi-robot Task Allocation using Agglomerative Clustering. [Internet] [Masters thesis]. Rochester Institute of Technology; 2016. [cited 2021 Feb 25]. 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

21.
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 February 25, 2021. 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. 25 Feb 2021.

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 2021 Feb 25]. 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

22.
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 February 25, 2021. 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. 25 Feb 2021.

Vancouver:

An HC. Approximation Algorithms For Traveling Salesman Problems Based On Linear Programming Relaxations. [Internet] [Doctoral dissertation]. Cornell University; 2012. [cited 2021 Feb 25]. 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

23.
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 February 25, 2021. 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. 25 Feb 2021.

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 2021 Feb 25]. 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

24. 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 February 25, 2021. 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. 25 Feb 2021.

Vancouver:

Hari SKK. Optimal Routing of Unmanned Vehicles in Persistent Monitoring Missions. [Internet] [Doctoral dissertation]. Texas A&M University; 2019. [cited 2021 Feb 25]. 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

25.
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 February 25, 2021. http://hdl.handle.net/10217/47314.

MLA Handbook (7^{th} Edition):

Hains, Douglas R. “Generalized partition crossover for the traveling salesman problem.” 2011. Web. 25 Feb 2021.

Vancouver:

Hains DR. Generalized partition crossover for the traveling salesman problem. [Internet] [Masters thesis]. Colorado State University; 2011. [cited 2021 Feb 25]. 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

26.
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

…x29;
The bicriterion *traveling* *salesman* *problem* is a
special case of the MCTSP *with* m=2. For… …required to specify the *salesman*'s itinerary *with* the minimum *traveling* *time*, so that the… …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…

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 February 25, 2021. 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. 25 Feb 2021.

Vancouver:

Perng C. A bicriterion traveling salesman problem. [Internet] [Thesis]. Texas Tech University; 1989. [cited 2021 Feb 25]. 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

27.
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 February 25, 2021. 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. 25 Feb 2021.

Vancouver:

Rojanasoonthon S. Methods for the solution of a priori traveling salesman problems. [Internet] [Thesis]. Texas Tech University; 1990. [cited 2021 Feb 25]. 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

28.
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 February 25, 2021. 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. 25 Feb 2021.

Vancouver:

Feng F. The traveling salesman problem and the subtour linear programming. [Internet] [Thesis]. University of Hong Kong; 2017. [cited 2021 Feb 25]. 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

29.
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 February 25, 2021. 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. 25 Feb 2021.

Vancouver:

White JL. A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2021 Feb 25]. 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

30.
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 February 25, 2021. 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. 25 Feb 2021.

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 2021 Feb 25]. 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