Amanote Research

Amanote Research

    RegisterSign In

On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem

Proceedings of the American Mathematical Society - United States
doi 10.2307/2033241
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsApplied Mathematics
Date

February 1, 1956

Authors
Joseph B. Kruskal
Publisher

JSTOR


Related search

A Tabu Search Approximation for Finding the Shortest Distance Using Traveling Salesman Problem

IOSR Journal of Mathematics
2016English

The Traveling Salesman Problem

English

Traveling Salesman Problem

2011English

Traveling Salesman Problem

English

Solving the Traveling Salesman Problem on a Quantum Annealer

SN Applied Sciences
2019English

Information in the Traveling Salesman Problem

Applied Mathematics
2012English

Approximating the Euclidean Traveling Salesman Problem (TSP)

Geometric Approximation Algorithms
2011English

A Memetic Algorithm for the Generalized Traveling Salesman Problem

Natural Computing
Computer Science Applications
2009English

A Method for the Traveling Salesman Problem Based on the Genetic Algorithm

Transactions of the Society of Instrument and Control Engineers
1995English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy