Relevant bibliographies by topics / Salesman problem

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Salesman problem'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Salesman problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Salesman problem"

1

Liao, Shuran. "The Solutions to Traveling Salesman Problem." Highlights in Science, Engineering and Technology 47 (May 11, 2023): 136–43. http://dx.doi.org/10.54097/hset.v47i.8182.

Full text
Abstract:
This paper presents solutions to symmetric, asymmetric, and multiple traveling salesman problems. In the symmetric traveling salesman problem, one salesperson must go to five cities, making precisely one stop at each location. A matrix with the distances between each city is provided. Using the branch and bound algorithm and expressing it in Python, the final result is obtained. The formulations of the asymmetric traveling salesman problem and the multiple traveling salesman problem are demonstrated in the paper. The asymmetric problem in the paper is solved by transforming the asymmetric trav
APA, Harvard, Vancouver, ISO, and other styles
2

Essani, Furqan, and Sajjad Haider. "An Algorithm for Mapping the Asymmetric Multiple Traveling Salesman Problem onto Colored Petri Nets." Algorithms 11, no. 10 (2018): 143. http://dx.doi.org/10.3390/a11100143.

Full text
Abstract:
The Multiple Traveling Salesman Problem is an extension of the famous Traveling Salesman Problem. Finding an optimal solution to the Multiple Traveling Salesman Problem (mTSP) is a difficult task as it belongs to the class of NP-hard problems. The problem becomes more complicated when the cost matrix is not symmetric. In such cases, finding even a feasible solution to the problem becomes a challenging task. In this paper, an algorithm is presented that uses Colored Petri Nets (CPN)—a mathematical modeling language—to represent the Multiple Traveling Salesman Problem. The proposed algorithm map
APA, Harvard, Vancouver, ISO, and other styles
3

Mzili, Ilyass, Toufik Mzili, and Mohammed Essaid Riffi. "Efficient routing optimization with discrete penguins search algorithm for MTSP." Decision Making: Applications in Management and Engineering 6, no. 1 (2023): 730–43. http://dx.doi.org/10.31181/dmame04092023m.

Full text
Abstract:
The Travelling Salesman Problem (TSP) is a well-known combinatorial optimization problem that belongs to a class of problems known as NP-hard, which is an exceptional case of travelling salesman problem (TSP), which determines a set of routes enabling multiple salesmen to start at and return to home cities (depots). The penguins search optimization algorithm (PeSOA) is a new metaheuristic optimization algorithm. In this paper, we present a discrete penguins search optimization algorithm (PeSOA) for solving the multiple travelling salesman problem (MTSP). The PeSOA evaluated by a set of benchma
APA, Harvard, Vancouver, ISO, and other styles
4

Al-Furhud, Maha Ata, and Zakir Hussain Ahmed. "Experimental Study of a Hybrid Genetic Algorithm for the Multiple Travelling Salesman Problem." Mathematical Problems in Engineering 2020 (October 27, 2020): 1–13. http://dx.doi.org/10.1155/2020/3431420.

Full text
Abstract:
The multiple travelling salesman problem (MTSP), an extension of the well-known travelling salesman problem (TSP), is studied here. In MTSP, starting from a depot, multiple salesmen require to visit all cities so that each city is required to be visited only once by one salesman only. It is NP-hard and is more complex than the usual TSP. So, exact optimal solutions can be obtained for smaller sized problem instances only. For large-sized problem instances, it is essential to apply heuristic algorithms, and amongst them, genetic algorithm is identified to be successfully deal with such complex
APA, Harvard, Vancouver, ISO, and other styles
5

Chris, Jojo Obi, Qiang Xiong, and Martinson Yeboah Appiah. "Using genetic algorithm to solve multiple traveling salesman problem and considering Carbon emissions." Indian Journal of Science and Technology 13, no. 36 (2020): 3707–15. https://doi.org/10.17485/IJST/v13i36.1316.

Full text
Abstract:
Abstract <strong>Objectives:</strong>&nbsp;The Multiple Travelling Salesman problem is a complex combinatorial optimization problem which is a variance of the Traveling Salesman Problem,where a lot of salesmen are utilized in the solution. In this work a cold chain logistics and route optimization model with minimum transport cost, carbon cost and Refrigeration cost are constructed.&nbsp;<strong>Methods:</strong>&nbsp;A genetic algorithm is then proposed to solve for the Multiple Travelling Salesman Problem with time windows while transport cost, carbon emission cost and refrigeration cost is
APA, Harvard, Vancouver, ISO, and other styles
6

Iriani, Rahma Try, Sapti Wahyuningsih, and Darmawan Satyananda. "TWO PHASE HEURISTIC ALGORITHM (TPHA) PADA MULTIPLE TRAVELLING SALESMAN PROBLEM (MTSP) DAN IMPLEMENTASI PROGRAMNYA." Jurnal Kajian Matematika dan Aplikasinya (JKMA) 1, no. 1 (2020): 10. http://dx.doi.org/10.17977/um055v1i12020p10-17.

Full text
Abstract:
Multiple Traveling Salesman Problem (MTSP) is one variant of Traveling Salesman Problem (TSP) which involves several salesmen in making a trip to visit several customers. In this article, the Two-Phase Heuristic Algorithm (TPHA) is used to solve MTSP problems. The algorithm classifies customers into several regions using the K-Means algorithm, which will then find a route solution for each region using a genetic algorithm. The MTSP problems that were resolved using TPHA were implemented into the Borland Delphi 7.0 programming language. Application testing was conducted using 21, 32, and 46 poi
APA, Harvard, Vancouver, ISO, and other styles
7

Obi, Chris Jojo. "Using genetic algorithm to solve multiple traveling salesman problem and considering Carbon emissions." Indian Journal of Science and Technology 13, no. 36 (2020): 3707–15. http://dx.doi.org/10.17485/ijst/v13i36.1316.

Full text
Abstract:
Objectives: The Multiple Travelling Salesman problem is a complex combinatorial optimization problem which is a variance of the Traveling Salesman Problem,where a lot of salesmen are utilized in the solution. In this work a cold chain logistics and route optimization model with minimum transport cost, carbon cost and Refrigeration cost are constructed. Methods: A genetic algorithm is then proposed to solve for the Multiple Travelling Salesman Problem with time windows while transport cost, carbon emission cost and refrigeration cost is minimized. Findings: It was observed that the algorithm ev
APA, Harvard, Vancouver, ISO, and other styles
8

Singamsetty, Purusotham, and Jayanth Kumar Thenepalle. "An efficient genetic algorithm for solving open multiple travelling salesman problem with load balancing constraint." Decision Science Letters 10, no. 4 (2021): 525–34. http://dx.doi.org/10.5267/j.dsl.2021.5.003.

Full text
Abstract:
The multiple travelling salesman problem (MTSP) is one of the widely studied combinatorial optimization problems with various theoretical and practical applications. However, most of the studies intended to deal with classical MTSP, very limited attention has been given to an open multiple travelling salesman problem and its variants. In this paper, an open multiple travelling salesman problem with load balancing constraint (OMTSPLB) is addressed. The OMTSPLB differs from the conventional MTSP, in which all the salesmen start from the central depot and need not come back to it after visiting t
APA, Harvard, Vancouver, ISO, and other styles
9

YOGA DWI WAHYU NUGRAHA, HENDRAWAN ARMANTO, and YOSI KRISTIAN. "Single Objective Mayfly Algorithm with Balancing Parameter for Multiple Traveling Salesman Problem." Journal of Electronics, Electromedical Engineering, and Medical Informatics 5, no. 3 (2023): 193–204. http://dx.doi.org/10.35882/jeemi.v5i3.299.

Full text
Abstract:
The Multiple Travelling Salesman Problem (MTSP) is a challenging combinatorial problem that involves multiple salesman visiting a set of cities, each exactly once, starting and ending at the same depot. The aim is to determine the optimal route with minimal cost and node cuts for each salesman while ensuring that at least one salesman visits each city. As the problem is NP-Hard, a single-objective metaheuristic algorithm, called the Mayfly Algorithm, inspired by the collective behavior of mayflies, is employed to solve the problem using the TSPlib95 test data. Since the Mayfly Algorithm employ
APA, Harvard, Vancouver, ISO, and other styles
10

Meng, Xianghu, Jun Li, and MengChu Zhou. "A Colored Traveling Salesman Problem with Varying City Colors." Discrete Dynamics in Nature and Society 2021 (December 9, 2021): 1–14. http://dx.doi.org/10.1155/2021/4533483.

Full text
Abstract:
A colored traveling salesman problem (CTSP) is a path optimization problem in which colors are used to characterize diverse matching relationship between cities and salesmen. Namely, each salesman has a single color while every city has one to multiple salesmen’s colors, thus allowing salesmen to visit exactly once the cities of their colors. It is noteworthy that cities’ accessibilities to salesmen may change over time, which usually takes place in the multiwarehouse distribution of online retailers. This work presents a new CTSP with dynamically varying city colors for describing and modelin
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Salesman problem"

1

Mattsson, Per. "The Asymmetric Traveling Salesman Problem." Thesis, Uppsala universitet, Matematiska institutionen, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-132624.

Full text
Abstract:
This thesis is a survey on the approximability of the asymmetric traveling salesmanproblem with triangle inequality (ATSP).In the ATSP we are given a set of cities and a function that gives the cost of travelingbetween any pair of cities. The cost function must satisfy the triangle inequality, i.e.the cost of traveling from city A to city B cannot be larger than the cost of travelingfrom A to some other city C and then to B. However, we allow the cost function tobe asymmetric, i.e. the cost of traveling from city A to city B may not equal the costof traveling from B to A. The problem is then t
APA, Harvard, Vancouver, ISO, and other styles
2

Butler, Martin. "2-period travelling salesman problem." Thesis, University of Southampton, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.242250.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gupta, Anil Kumar. "On a generalized travelling salesman problem." Thesis, University of Ottawa (Canada), 1986. http://hdl.handle.net/10393/4745.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Schmitting, Walter. "Das Traveling-Salesman-Problem Anwendungen und heuristische Nutzung von Voronoi-Delaunay-Strukturen zur Lösung euklidischer, zweidimensionaler Traveling-Salesman-Probleme /." Münster : Schmitting, 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=960608176.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Accorsi, Luca. "L'algoritmo bionomico per il Traveling Salesman Problem." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/9396/.

Full text
Abstract:
In questa tesi viene presentato un nuovo metaeuristico per la risoluzione del Traveling Salesman Problem (TSP) simmetrico. Tale metodo, detto algoritmo bionomico, è una variante dell'algoritmo genetico che usa un metodo innovativo di generazione del parents set. Nella tesi vengono proposti diversi metodi di crossover specifici per il TSP ma che possono essere facilmente estesi per altri problemi di ottimizzazione combinatoria. Tali metodi sono stati sperimentati su un insieme di problemi test, i risultati computazionali mostrano l'efficienza dei metodi proposti. In particolare uno dei metodi d
APA, Harvard, Vancouver, ISO, and other styles
6

Simsek, Omur. "The Biobjective Traveling Salesman Problem With Profit." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12608890/index.pdf.

Full text
Abstract:
The traveling salesman problem (TSP) is defined as: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities only once and returning to your starting city. Some variants of TSP are proposed to visit cities depending on the profit gained when the visit occurs. In literature, these kind of problems are named TSP with profit. In TSP with profit, there are two conflicting objectives, one to collect profit and the other to decrease traveling cost. In literature, TSP with profit are addressed as single objective, either
APA, Harvard, Vancouver, ISO, and other styles
7

Shapiro, Jeremy F. 1939. "Convergent Duality for the Traveling Salesman Problem." Massachusetts Institute of Technology, Operations Research Center, 1989. http://hdl.handle.net/1721.1/5199.

Full text
Abstract:
A constructive method is presented for optimizing exactly the Traveling Salesman Problem as a sequence of shortest route problems. The method combines group theoretic and Lagrangean relaxation constructions. Key Words: Traveling Salesman Problem, Lagrangean relaxation, shortest route problem, generalized linear programming, group theory.
APA, Harvard, Vancouver, ISO, and other styles
8

Cotton, Richard V. "Geometrical heuristics for the traveling salesman problem." Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/25573.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hui, Ming-Ki, and 許明琪. "The traveling salesman problem and its applications." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B4257707X.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hui, Ming-Ki. "The traveling salesman problem and its applications." Click to view the E-thesis via HKUTO, 2002. http://sunzi.lib.hku.hk/hkuto/record/B4257707X.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Salesman problem"

1

Greco, Federico. Traveling salesman problem. InTech, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Green, D. R. The travelling salesman problem. Department of Mathematical Sciences, Loughborough University of Technology, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Weiqi. The Traveling Salesman Problem. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-35719-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

1957-, Gutin Gregory, and Punnen Abraham P, eds. The traveling salesman problem and its variations. Kluwer Academic Publishers, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gutin, Gregory, and Abraham P. Punnen, eds. The Traveling Salesman Problem and Its Variations. Springer US, 2007. http://dx.doi.org/10.1007/b101971.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

L, Applegate David, ed. The traveling salesman problem: A computational study. Princeton University Press, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

1957-, Gutin Gregory, and Punnen Abraham P, eds. The traveling salesman problem and its variations. Kluwer Academic Publishers, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gutin, Gregory. The Travelling Salesman Problem and Its Variations. Springer, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Brendel, Thomas. Dialoggestützte Tourenplanung unter besonderer Berücksichtigung von Belieferungszeitintervallen. P. Lang, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Edelsbrunner, Herbert. Testing the necklace condition for shortest tours and optimal factors in the plane. University of Illinois at Urbana-Champaign, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Salesman problem"

1

Hoffman, Karla L., Manfred Padberg, and Giovanni Rinaldi. "Traveling Salesman Problem." In Encyclopedia of Operations Research and Management Science. Springer US, 2013. http://dx.doi.org/10.1007/978-1-4419-1153-7_1068.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lau, H. T. "Traveling Salesman Problem." In Lecture Notes in Economics and Mathematical Systems. Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/978-3-642-61649-5_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gutin, Gregory. "Traveling Salesman Problem." In Encyclopedia of Optimization. Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-030-54621-2_687-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Weiqi. "Traveling Salesman Problem." In The Traveling Salesman Problem. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-35719-0_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Weiqi. "Solving Multi-objective Traveling Salesman Problem." In The Traveling Salesman Problem. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-35719-0_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Weiqi. "Solving Probabilistic Traveling Salesman Problem." In The Traveling Salesman Problem. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-35719-0_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Weiqi. "Introduction." In The Traveling Salesman Problem. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-35719-0_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Weiqi. "The Attractor-Based Search System." In The Traveling Salesman Problem. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-35719-0_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Weiqi. "Solving Dynamic Multi-objective Traveling Salesman Problem." In The Traveling Salesman Problem. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-35719-0_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Weiqi. "Solving Dynamic Traveling Salesman Problem." In The Traveling Salesman Problem. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-35719-0_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Salesman problem"

1

Madhusoodanan, Devika, Vismaya R, Hridyalakshmi, and Apurvanand Sahay. "Adapting Optimal Solutions to Travelling Salesman Problem." In 2024 15th International Conference on Computing Communication and Networking Technologies (ICCCNT). IEEE, 2024. http://dx.doi.org/10.1109/icccnt61001.2024.10725252.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Liu, Yuzhou, Huayi Yin, Zebin Huang, and Yihong Wu. "Enhanced Genetic Algorithm for Traveling Salesman Problem." In 2024 4th International Conference on Artificial Intelligence, Robotics, and Communication (ICAIRC). IEEE, 2024. https://doi.org/10.1109/icairc64177.2024.10900033.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bartal, Yair, Lee-Ad Gottlieb, and Robert Krauthgamer. "The traveling salesman problem." In the 44th symposium. ACM Press, 2012. http://dx.doi.org/10.1145/2213977.2214038.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Khodamoradi, Kamyar, and Ramesh Krishnamurti. "Prize Collecting Travelling Salesman Problem." In 5th International Conference on Operations Research and Enterprise Systems. SCITEPRESS - Science and Technology Publications, 2016. http://dx.doi.org/10.5220/0005758103800387.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Twohig, Susan N., and Samuel O. Aletan. "The traveling-salesman problem (abstract)." In the 1990 ACM annual conference. ACM Press, 1990. http://dx.doi.org/10.1145/100348.100468.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Assaf, Mustafa, and Malick Ndiaye. "Multi travelling salesman problem formulation." In 2017 4th International Conference on Industrial Engineering and Applications (ICIEA). IEEE, 2017. http://dx.doi.org/10.1109/iea.2017.7939224.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Saad, Shakila, Wan Nurhadani Wan Jaafar, and Siti Jasmida Jamil. "Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound." In PROCEEDINGS OF THE 20TH NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES: Research in Mathematical Sciences: A Catalyst for Creativity and Innovation. AIP, 2013. http://dx.doi.org/10.1063/1.4801294.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hu, Bin, and Günther R. Raidl. "Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem." In 2008 8th International Conference on Hybrid Intelligent Systems (HIS). IEEE, 2008. http://dx.doi.org/10.1109/his.2008.30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ahmed, Manal, Faez Ali, Wakkas Khalaf, and ,. Mohammed Al-Safi. "Solving Weighted Multiobjective Travelling Salesman Problem." In ‎4th International Conference on ‎Administrative ‎& Financial Sciences. Cihan University-Erbil, 2023. http://dx.doi.org/10.24086/icafs2023/paper.899.

Full text
Abstract:
The Multiobjective Travelling Salesman Problem with Weighted is studied in this article, we used the exact Branch and Bound (BAB) method to find the optimal solution and we proposed two heuristic methods MDA and MDTM to find the best solution. Finally, we compared the proposed methods MDA and MDTM with BAB to show the efficiency of these methods. The results prove the good performance of these methods.
APA, Harvard, Vancouver, ISO, and other styles
10

Tu, Phan Anh, Nguyen Tuan Dat, and Pham Quang Dung. "Traveling Salesman Problem with Multiple Drones." In the Ninth International Symposium. ACM Press, 2018. http://dx.doi.org/10.1145/3287921.3287932.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Salesman problem"

1

Sokkappa, P. R. The cost-constrained traveling salesman problem. Office of Scientific and Technical Information (OSTI), 1990. http://dx.doi.org/10.2172/6223080.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pizlo, Zygmunt. Human Problem Solving: The Complete Model of the Traveling Salesman Problem. Defense Technical Information Center, 2009. http://dx.doi.org/10.21236/ada567226.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Fogel, David B. Addressing the Travelling Salesman Problem through Evolutionary Adaptation. Defense Technical Information Center, 1987. http://dx.doi.org/10.21236/ada179992.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Balas, Egon, and Matteo Fischetti. Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem. Defense Technical Information Center, 1997. http://dx.doi.org/10.21236/ada352002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Calle López, Sergio, and Alberto Antonio del Barrio García. Efectos de la computación cuántica sobre la complejidad del TSP. Fundación Avanza, 2023. http://dx.doi.org/10.60096/fundacionavanza/2652022.

Full text
Abstract:
En este artículo se hace un análisis de las distintas complejidades existente para el “Traveling Salesman Problem” o TSP según las distintas formulaciones clásicas y se contrasta con la complejidad asociada a la computación cuántica.
APA, Harvard, Vancouver, ISO, and other styles
6

Cronin, T. M. The Voronoi Diagram for the Euclidean Traveling Salesman Problem Is Piecemeal Quartic and Hyperbolic. Defense Technical Information Center, 1990. http://dx.doi.org/10.21236/ada256112.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Miller, D. L., J. F. Pekny, and G. L. Thompson. An Exact Two-Matching Based Branch and Bound Algorithm for the Symmetric Traveling Salesman Problem. Defense Technical Information Center, 1991. http://dx.doi.org/10.21236/ada237878.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Libura, Marek. Sensitivity Analysis for Shortest Hamiltonian Path and Traveling Salesman Problems. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada197167.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Salesman problem' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography