Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Traveling). Showing records 1 – 30 of 494 total matches.

[1] [2] [3] [4] [5] … [17]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Yan, Zhifeng. Lattice-Boltzmann Modeling of Bacterial Chemotaxis in the Subsurface.

Degree: 2014, Johns Hopkins University

 The Lattice Boltzmann method (LBM) has been widely used because it is well-suited to model flow and transport in the complex geometries that are typical… (more)

Subjects/Keywords: Bacterial chemotaxis; Traveling bacterial waves

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yan, Z. (2014). Lattice-Boltzmann Modeling of Bacterial Chemotaxis in the Subsurface. (Thesis). Johns Hopkins University. Retrieved from http://jhir.library.jhu.edu/handle/1774.2/37189

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Yan, Zhifeng. “Lattice-Boltzmann Modeling of Bacterial Chemotaxis in the Subsurface.” 2014. Thesis, Johns Hopkins University. Accessed January 20, 2021. http://jhir.library.jhu.edu/handle/1774.2/37189.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Yan, Zhifeng. “Lattice-Boltzmann Modeling of Bacterial Chemotaxis in the Subsurface.” 2014. Web. 20 Jan 2021.

Vancouver:

Yan Z. Lattice-Boltzmann Modeling of Bacterial Chemotaxis in the Subsurface. [Internet] [Thesis]. Johns Hopkins University; 2014. [cited 2021 Jan 20]. Available from: http://jhir.library.jhu.edu/handle/1774.2/37189.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yan Z. Lattice-Boltzmann Modeling of Bacterial Chemotaxis in the Subsurface. [Thesis]. Johns Hopkins University; 2014. Available from: http://jhir.library.jhu.edu/handle/1774.2/37189

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Oregon State University

2. Corbett, Arthur Charles. A mobile shop unit for Oregon's rural schools.

Degree: MS, Industrial Arts and Engineering, 1955, Oregon State University

Subjects/Keywords: Schools; Traveling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Corbett, A. C. (1955). A mobile shop unit for Oregon's rural schools. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/51242

Chicago Manual of Style (16th Edition):

Corbett, Arthur Charles. “A mobile shop unit for Oregon's rural schools.” 1955. Masters Thesis, Oregon State University. Accessed January 20, 2021. http://hdl.handle.net/1957/51242.

MLA Handbook (7th Edition):

Corbett, Arthur Charles. “A mobile shop unit for Oregon's rural schools.” 1955. Web. 20 Jan 2021.

Vancouver:

Corbett AC. A mobile shop unit for Oregon's rural schools. [Internet] [Masters thesis]. Oregon State University; 1955. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/1957/51242.

Council of Science Editors:

Corbett AC. A mobile shop unit for Oregon's rural schools. [Masters Thesis]. Oregon State University; 1955. Available from: http://hdl.handle.net/1957/51242


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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

Leenen, Louise. “Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem.” 2014. Thesis, University of Johannesburg. Accessed January 20, 2021. 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 (7th Edition):

Leenen, Louise. “Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem.” 2014. Web. 20 Jan 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 Jan 20]. 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

Note: this citation may be lacking information needed for this citation format:
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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Geldenhuys, Christel Erna. “An implementation of a branch-and-cut algorithm for the travelling salesman problem.” 2012. Web. 20 Jan 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 Jan 20]. Available from: http://hdl.handle.net/10210/7337.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Gonzalez A. A Parallel Implementation of A Greedy TSP Algorithm. [Internet] [Masters thesis]. Texas State University – San Marcos; 2020. [cited 2021 Jan 20]. 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


University of North Texas

6. Paudel, Laxmi P. Traveling Wave Solutions of the Porous Medium Equation.

Degree: 2013, University of North Texas

 We prove the existence of a one-parameter family of solutions of the porous medium equation, a nonlinear heat equation. In our work, with space dimension… (more)

Subjects/Keywords: Traveling wave; porous media; interface

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Paudel, L. P. (2013). Traveling Wave Solutions of the Porous Medium Equation. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc271876/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Paudel, Laxmi P. “Traveling Wave Solutions of the Porous Medium Equation.” 2013. Thesis, University of North Texas. Accessed January 20, 2021. https://digital.library.unt.edu/ark:/67531/metadc271876/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Paudel, Laxmi P. “Traveling Wave Solutions of the Porous Medium Equation.” 2013. Web. 20 Jan 2021.

Vancouver:

Paudel LP. Traveling Wave Solutions of the Porous Medium Equation. [Internet] [Thesis]. University of North Texas; 2013. [cited 2021 Jan 20]. Available from: https://digital.library.unt.edu/ark:/67531/metadc271876/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Paudel LP. Traveling Wave Solutions of the Porous Medium Equation. [Thesis]. University of North Texas; 2013. Available from: https://digital.library.unt.edu/ark:/67531/metadc271876/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Sydney

7. Naoumenko, Daniel. Neurophysiological Mechanisms underlying the Complex Dynamics of Propagating Waves in Neural Circuits .

Degree: 2018, University of Sydney

 Recent experimental studies have shown that the activity of neural circuits demonstrates spatiotemporal dynamics across multiple scales, including localized coherent patterns and propagating waves. This… (more)

Subjects/Keywords: neural field; traveling waves; neurodynamics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Naoumenko, D. (2018). Neurophysiological Mechanisms underlying the Complex Dynamics of Propagating Waves in Neural Circuits . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/20706

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Naoumenko, Daniel. “Neurophysiological Mechanisms underlying the Complex Dynamics of Propagating Waves in Neural Circuits .” 2018. Thesis, University of Sydney. Accessed January 20, 2021. http://hdl.handle.net/2123/20706.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Naoumenko, Daniel. “Neurophysiological Mechanisms underlying the Complex Dynamics of Propagating Waves in Neural Circuits .” 2018. Web. 20 Jan 2021.

Vancouver:

Naoumenko D. Neurophysiological Mechanisms underlying the Complex Dynamics of Propagating Waves in Neural Circuits . [Internet] [Thesis]. University of Sydney; 2018. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/2123/20706.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Naoumenko D. Neurophysiological Mechanisms underlying the Complex Dynamics of Propagating Waves in Neural Circuits . [Thesis]. University of Sydney; 2018. Available from: http://hdl.handle.net/2123/20706

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

8. Lin, Hsin-I. The Genderization of Risks in Traveling: the Imagination and Practice of Female Backpackers.

Degree: Master, Institute of Sociology, 2015, NSYSU

 Through the narratives of responses toward risks to female backpackers from Taiwan, This thesis identifies how women are empowered by backpacking. It also explores the… (more)

Subjects/Keywords: women leisure; backpacker; traveling; risk; masculinity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, H. (2015). The Genderization of Risks in Traveling: the Imagination and Practice of Female Backpackers. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0616115-001013

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lin, Hsin-I. “The Genderization of Risks in Traveling: the Imagination and Practice of Female Backpackers.” 2015. Thesis, NSYSU. Accessed January 20, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0616115-001013.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lin, Hsin-I. “The Genderization of Risks in Traveling: the Imagination and Practice of Female Backpackers.” 2015. Web. 20 Jan 2021.

Vancouver:

Lin H. The Genderization of Risks in Traveling: the Imagination and Practice of Female Backpackers. [Internet] [Thesis]. NSYSU; 2015. [cited 2021 Jan 20]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0616115-001013.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lin H. The Genderization of Risks in Traveling: the Imagination and Practice of Female Backpackers. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0616115-001013

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

9. 岡田, 正浩. Studies on Probabilistic Analysis of λ-opt for Traveling Salesperson Problems : 巡回セールスパーソン問題に対するλ-optの確率的解析に関する研究; ジュンカイ セールスパーソン モンダイ ニ タイスル λ-opt ノ カクリツテキ カイセキ ニ カンスル ケンキュウ.

Degree: Nara Institute of Science and Technology / 奈良先端科学技術大学院大学

Subjects/Keywords: traveling salesperson problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

岡田, . (n.d.). Studies on Probabilistic Analysis of λ-opt for Traveling Salesperson Problems : 巡回セールスパーソン問題に対するλ-optの確率的解析に関する研究; ジュンカイ セールスパーソン モンダイ ニ タイスル λ-opt ノ カクリツテキ カイセキ ニ カンスル ケンキュウ. (Thesis). Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10061/2954

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

岡田, 正浩. “Studies on Probabilistic Analysis of λ-opt for Traveling Salesperson Problems : 巡回セールスパーソン問題に対するλ-optの確率的解析に関する研究; ジュンカイ セールスパーソン モンダイ ニ タイスル λ-opt ノ カクリツテキ カイセキ ニ カンスル ケンキュウ.” Thesis, Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Accessed January 20, 2021. http://hdl.handle.net/10061/2954.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

岡田, 正浩. “Studies on Probabilistic Analysis of λ-opt for Traveling Salesperson Problems : 巡回セールスパーソン問題に対するλ-optの確率的解析に関する研究; ジュンカイ セールスパーソン モンダイ ニ タイスル λ-opt ノ カクリツテキ カイセキ ニ カンスル ケンキュウ.” Web. 20 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

岡田 . Studies on Probabilistic Analysis of λ-opt for Traveling Salesperson Problems : 巡回セールスパーソン問題に対するλ-optの確率的解析に関する研究; ジュンカイ セールスパーソン モンダイ ニ タイスル λ-opt ノ カクリツテキ カイセキ ニ カンスル ケンキュウ. [Internet] [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; [cited 2021 Jan 20]. Available from: http://hdl.handle.net/10061/2954.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

岡田 . Studies on Probabilistic Analysis of λ-opt for Traveling Salesperson Problems : 巡回セールスパーソン問題に対するλ-optの確率的解析に関する研究; ジュンカイ セールスパーソン モンダイ ニ タイスル λ-opt ノ カクリツテキ カイセキ ニ カンスル ケンキュウ. [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; Available from: http://hdl.handle.net/10061/2954

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.


Oregon State University

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

Starr, Robert W. “A multi-tour heuristic for the traveling salesman problem.” 1980. Web. 20 Jan 2021.

Vancouver:

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

11. Qian, David. Dynamic Programming: Salesman to Surgeon.

Degree: 2013, University of Waterloo

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Qian, David. “Dynamic Programming: Salesman to Surgeon.” 2013. Web. 20 Jan 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Boston University

12. Gonzalez Ramirez, Laura Rocio. Existence and stability of traveling waves in a biologically constrained model of seizure wave propagation.

Degree: PhD, Mathematics & Statistics, 2014, Boston University

 Epilepsy  – the condition of recurrent, unprovoked seizures  – manifests in brain voltage activity with characteristic spatio-temporal patterns. One of the patterns typically observed during… (more)

Subjects/Keywords: Mathematics; Epilepsy; Existence; Seizure; Stability; Traveling; Waves

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gonzalez Ramirez, L. R. (2014). Existence and stability of traveling waves in a biologically constrained model of seizure wave propagation. (Doctoral Dissertation). Boston University. Retrieved from http://hdl.handle.net/2144/15128

Chicago Manual of Style (16th Edition):

Gonzalez Ramirez, Laura Rocio. “Existence and stability of traveling waves in a biologically constrained model of seizure wave propagation.” 2014. Doctoral Dissertation, Boston University. Accessed January 20, 2021. http://hdl.handle.net/2144/15128.

MLA Handbook (7th Edition):

Gonzalez Ramirez, Laura Rocio. “Existence and stability of traveling waves in a biologically constrained model of seizure wave propagation.” 2014. Web. 20 Jan 2021.

Vancouver:

Gonzalez Ramirez LR. Existence and stability of traveling waves in a biologically constrained model of seizure wave propagation. [Internet] [Doctoral dissertation]. Boston University; 2014. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/2144/15128.

Council of Science Editors:

Gonzalez Ramirez LR. Existence and stability of traveling waves in a biologically constrained model of seizure wave propagation. [Doctoral Dissertation]. Boston University; 2014. Available from: http://hdl.handle.net/2144/15128


Michigan State University

13. Wieland, John Henry. The field salesman : a market manager.

Degree: PhD, Department of Marketing & Transportation Administration, 1963, Michigan State University

Subjects/Keywords: Traveling sales personnel

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wieland, J. H. (1963). The field salesman : a market manager. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:44986

Chicago Manual of Style (16th Edition):

Wieland, John Henry. “The field salesman : a market manager.” 1963. Doctoral Dissertation, Michigan State University. Accessed January 20, 2021. http://etd.lib.msu.edu/islandora/object/etd:44986.

MLA Handbook (7th Edition):

Wieland, John Henry. “The field salesman : a market manager.” 1963. Web. 20 Jan 2021.

Vancouver:

Wieland JH. The field salesman : a market manager. [Internet] [Doctoral dissertation]. Michigan State University; 1963. [cited 2021 Jan 20]. Available from: http://etd.lib.msu.edu/islandora/object/etd:44986.

Council of Science Editors:

Wieland JH. The field salesman : a market manager. [Doctoral Dissertation]. Michigan State University; 1963. Available from: http://etd.lib.msu.edu/islandora/object/etd:44986


California State University – Chico

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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 January 20, 2021. http://hdl.handle.net/10211.4/397.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Powers, David J. “Effects of Parallelization on Genetic Algorithms in Programmable Logic: Implementing a Solution to the Traveling Salesman Problem .” 2012. Web. 20 Jan 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 Jan 20]. Available from: http://hdl.handle.net/10211.4/397.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Hong Kong University of Science and Technology

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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 January 20, 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.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Yang, Chen PHYS. “A new strategy to solve the traveling salesman problem with a multi-agent system.” 2019. Web. 20 Jan 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 Jan 20]. 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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Georgia Tech

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

Degree: MS, Operations research, 1976, Georgia Tech

Subjects/Keywords: Traveling-salesman problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

Bau, Norman Jon. “On the solution of traveling salesman problems under conditions of sparseness.” 1976. Web. 20 Jan 2021.

Vancouver:

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


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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Roerty, Dennis Francis. “M-salesman balanced tours traveling salesman problem with multiple visits to cities allowed.” 1974. Web. 20 Jan 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 Jan 20]. Available from: http://hdl.handle.net/2346/18193.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Vienna

18. Lechmann, Miriam. The traveling repairman problem.

Degree: 2009, University of Vienna

 Diese Magisterarbeit gibt einen Überblick über das Traveling Repairman Problem (TRP), das eine Spezialform des Problems des Handlungsreisenden (Traveling Salesman Problem – TSP) darstellt. Beide… (more)

Subjects/Keywords: 85.99 Betriebswirtschaft: Sonstiges; Traveling Repairman Problem; Traveling Repairman Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lechmann, M. (2009). The traveling repairman problem. (Thesis). University of Vienna. Retrieved from http://othes.univie.ac.at/7515/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lechmann, Miriam. “The traveling repairman problem.” 2009. Thesis, University of Vienna. Accessed January 20, 2021. http://othes.univie.ac.at/7515/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lechmann, Miriam. “The traveling repairman problem.” 2009. Web. 20 Jan 2021.

Vancouver:

Lechmann M. The traveling repairman problem. [Internet] [Thesis]. University of Vienna; 2009. [cited 2021 Jan 20]. Available from: http://othes.univie.ac.at/7515/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lechmann M. The traveling repairman problem. [Thesis]. University of Vienna; 2009. Available from: http://othes.univie.ac.at/7515/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

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

Degree: 2015, University of Waterloo

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Gao, Zhihan. “Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations.” 2015. Web. 20 Jan 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

20. Chang, Chih-yung. The Reseach of Taiwanese Senior Touristsâ Travelling Type - A Case Study of CSC Tours & Travel Service CO., LTD.

Degree: Master, EMBA, 2015, NSYSU

 The tourism industry in Taiwan has developed with the change of government policy. The government has introduced the concept of travelling and sightseeing since 1948;… (more)

Subjects/Keywords: travel package; traveling patterns; travel agency; travelling; senior tourists

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chang, C. (2015). The Reseach of Taiwanese Senior Touristsâ Travelling Type - A Case Study of CSC Tours & Travel Service CO., LTD. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711115-114931

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chang, Chih-yung. “The Reseach of Taiwanese Senior Touristsâ Travelling Type - A Case Study of CSC Tours & Travel Service CO., LTD.” 2015. Thesis, NSYSU. Accessed January 20, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711115-114931.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chang, Chih-yung. “The Reseach of Taiwanese Senior Touristsâ Travelling Type - A Case Study of CSC Tours & Travel Service CO., LTD.” 2015. Web. 20 Jan 2021.

Vancouver:

Chang C. The Reseach of Taiwanese Senior Touristsâ Travelling Type - A Case Study of CSC Tours & Travel Service CO., LTD. [Internet] [Thesis]. NSYSU; 2015. [cited 2021 Jan 20]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711115-114931.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chang C. The Reseach of Taiwanese Senior Touristsâ Travelling Type - A Case Study of CSC Tours & Travel Service CO., LTD. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711115-114931

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade do Rio Grande do Norte

21. Bagi, Ligia Bariani. Algoritmo treansgenético na solução do problema do Caixeiro Viajante .

Degree: 2007, Universidade do Rio Grande do Norte

 The Traveling Purchaser Problem is a variant of the Traveling Salesman Problem, where there is a set of markets and a set of products. Each… (more)

Subjects/Keywords: Mercados; Algoritmo; PCC; Vetores; Transgenético; Traveling purchaser problem; Transgenetic; Algorithm; Evolution

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bagi, L. B. (2007). Algoritmo treansgenético na solução do problema do Caixeiro Viajante . (Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/18112

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bagi, Ligia Bariani. “Algoritmo treansgenético na solução do problema do Caixeiro Viajante .” 2007. Thesis, Universidade do Rio Grande do Norte. Accessed January 20, 2021. http://repositorio.ufrn.br/handle/123456789/18112.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bagi, Ligia Bariani. “Algoritmo treansgenético na solução do problema do Caixeiro Viajante .” 2007. Web. 20 Jan 2021.

Vancouver:

Bagi LB. Algoritmo treansgenético na solução do problema do Caixeiro Viajante . [Internet] [Thesis]. Universidade do Rio Grande do Norte; 2007. [cited 2021 Jan 20]. Available from: http://repositorio.ufrn.br/handle/123456789/18112.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bagi LB. Algoritmo treansgenético na solução do problema do Caixeiro Viajante . [Thesis]. Universidade do Rio Grande do Norte; 2007. Available from: http://repositorio.ufrn.br/handle/123456789/18112

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Hong Kong

22. 許明琪. The traveling salesman problem and its applications.

Degree: 2002, University of Hong Kong

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

許明琪.. “The traveling salesman problem and its applications.” 2002. Thesis, University of Hong Kong. Accessed January 20, 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 (7th Edition):

許明琪.. “The traveling salesman problem and its applications.” 2002. Web. 20 Jan 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 Jan 20]. 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

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation


Rochester Institute of Technology

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

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

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

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


Hong Kong University of Science and Technology

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

Degree: 2020, Hong Kong University of Science and Technology

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Shing, Ming Tony PHYS. “Optimal route planning for probabilistic landscape exploration.” 2020. Thesis, Hong Kong University of Science and Technology. Accessed January 20, 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.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Shing, Ming Tony PHYS. “Optimal route planning for probabilistic landscape exploration.” 2020. Web. 20 Jan 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Cornell University

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 January 20, 2021. http://hdl.handle.net/1813/70346.

MLA Handbook (7th 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. 20 Jan 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 Jan 20]. 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

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

Degree: PhD, Computer Science, 2012, Cornell University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

An, Hyung Chan. “Approximation Algorithms For Traveling Salesman Problems Based On Linear Programming Relaxations.” 2012. Web. 20 Jan 2021.

Vancouver:

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

27. Naveen Babu G. Electromagnetic wave propagation in Anisotropically conducting Tape Helix Slow Wave Structures;.

Degree: Electronics and Communication, 2013, INFLIBNET

High power, broad bandwidth, high gain, high efficiency, long life times, excellent reliability and robustness are among the most important features of Traveling Wave Tube… (more)

Subjects/Keywords: Electronics and Communication; Traveling Wave Tube Amplifiers; Electromagnetic Wave; Helical Conductors

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

G, N. B. (2013). Electromagnetic wave propagation in Anisotropically conducting Tape Helix Slow Wave Structures;. (Thesis). INFLIBNET. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/10517

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

G, Naveen Babu. “Electromagnetic wave propagation in Anisotropically conducting Tape Helix Slow Wave Structures;.” 2013. Thesis, INFLIBNET. Accessed January 20, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/10517.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

G, Naveen Babu. “Electromagnetic wave propagation in Anisotropically conducting Tape Helix Slow Wave Structures;.” 2013. Web. 20 Jan 2021.

Vancouver:

G NB. Electromagnetic wave propagation in Anisotropically conducting Tape Helix Slow Wave Structures;. [Internet] [Thesis]. INFLIBNET; 2013. [cited 2021 Jan 20]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/10517.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

G NB. Electromagnetic wave propagation in Anisotropically conducting Tape Helix Slow Wave Structures;. [Thesis]. INFLIBNET; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/10517

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Stellenbosch University

28. De Waal, Arthur William. Development of a crane load software application for electric driven overhead travelling bridge cranes in accordance with SANS 10160-6:2010.

Degree: Civil Engineering, 2011, Stellenbosch University

Thesis (MScEng (Civil Engineering)) – University of Stellenbosch, 2011.

ENGLISH ABSTRACT: Electric driven overhead travelling bridge cranes (EOHTC) form a vital part of industrial plants where… (more)

Subjects/Keywords: Civil engineering; Mobile cranes; Traveling cranes; Gantry cranes; Electric cranes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

De Waal, A. W. (2011). Development of a crane load software application for electric driven overhead travelling bridge cranes in accordance with SANS 10160-6:2010. (Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/6622

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

De Waal, Arthur William. “Development of a crane load software application for electric driven overhead travelling bridge cranes in accordance with SANS 10160-6:2010.” 2011. Thesis, Stellenbosch University. Accessed January 20, 2021. http://hdl.handle.net/10019.1/6622.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

De Waal, Arthur William. “Development of a crane load software application for electric driven overhead travelling bridge cranes in accordance with SANS 10160-6:2010.” 2011. Web. 20 Jan 2021.

Vancouver:

De Waal AW. Development of a crane load software application for electric driven overhead travelling bridge cranes in accordance with SANS 10160-6:2010. [Internet] [Thesis]. Stellenbosch University; 2011. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/10019.1/6622.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

De Waal AW. Development of a crane load software application for electric driven overhead travelling bridge cranes in accordance with SANS 10160-6:2010. [Thesis]. Stellenbosch University; 2011. Available from: http://hdl.handle.net/10019.1/6622

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Saskatchewan

29. Sidhu, Harjinder Singh. High speed digital protection of EHV transmission lines using traveling waves.

Degree: 2004, University of Saskatchewan

 Extra High Voltage (EHV) transmission lines are designed to transfer large amount of power from one location to another. The length exposed to the environment… (more)

Subjects/Keywords: Traveling Waves; Protection; Transmission Line

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sidhu, H. S. (2004). High speed digital protection of EHV transmission lines using traveling waves. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/etd-04302004-143430

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sidhu, Harjinder Singh. “High speed digital protection of EHV transmission lines using traveling waves.” 2004. Thesis, University of Saskatchewan. Accessed January 20, 2021. http://hdl.handle.net/10388/etd-04302004-143430.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sidhu, Harjinder Singh. “High speed digital protection of EHV transmission lines using traveling waves.” 2004. Web. 20 Jan 2021.

Vancouver:

Sidhu HS. High speed digital protection of EHV transmission lines using traveling waves. [Internet] [Thesis]. University of Saskatchewan; 2004. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/10388/etd-04302004-143430.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sidhu HS. High speed digital protection of EHV transmission lines using traveling waves. [Thesis]. University of Saskatchewan; 2004. Available from: http://hdl.handle.net/10388/etd-04302004-143430

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

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

Degree: 2019, University of Waterloo

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th 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 January 20, 2021. http://hdl.handle.net/10012/14585.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Woo, Kyongjae. “Cycle Time Reduction of 5-axis Laser Drilling via Time-optimal Trajectory Generation and Sequence Optimization.” 2019. Web. 20 Jan 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 Jan 20]. Available from: http://hdl.handle.net/10012/14585.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3] [4] [5] … [17]

.