ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
39
views
10
references
Top references
cited by
134
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,528
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
The traveling-salesman problem and minimum spanning trees: Part II
Author(s):
Michael Held
,
Richard M. Karp
Publication date
Created:
December 1971
Publication date
(Print):
December 1971
Journal:
Mathematical Programming
Publisher:
Springer Nature
Read this article at
ScienceOpen
Publisher
Review
Review article
Invite someone to review
Bookmark
Cite as...
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Abstract
Related collections
General Collective Intelligence Platforms and Hive Minds
Most cited references
10
Record
: found
Abstract
: not found
Article
: not found
Computer Solutions of the Traveling Salesman Problem
Hwei-Shen Lin
(1965)
0
comments
Cited
291
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
Joseph Kruskal
(1956)
0
comments
Cited
225
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A Method for Solving Traveling-Salesman Problems
G. Croes
(1958)
0
comments
Cited
168
times
– based on
0
reviews
Review now
Bookmark
All references
Author and article information
Journal
Title:
Mathematical Programming
Abbreviated Title:
Mathematical Programming
Publisher:
Springer Nature
ISSN (Print):
0025-5610
ISSN (Electronic):
1436-4646
Publication date Created:
December 1971
Publication date (Print):
December 1971
Volume
: 1
Issue
: 1
Pages
: 6-25
Article
DOI:
10.1007/BF01584070
SO-VID:
ce92afce-db97-47d2-8223-26d80c0dd8dd
Copyright ©
© 1971
History
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
1,528
Reducing the Number of Qubits from \(n^2\) to \(n\log_{2} (n)\) to Solve the Traveling Salesman Problem with Quantum Computers: A Proposal for Demonstrating Quantum Supremacy in the NISQ Era
Authors:
Mehdi Ramezani
,
Sadegh Salami
,
Mehdi Shokhmkar
…
A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
Authors:
Gilbert Laporte
,
Fayez F. Boctor
,
Jacques Renaud
A Priori Optimization of the Probabilistic Traveling Salesman Problem
Authors:
Hélène Mercure
,
François Louveaux
,
Gilbert Laporte
See all similar
Cited by
132
Branch-and-Price: Column Generation for Solving Huge Integer Programs
Authors:
Pamela Vance
,
Martin W. P. Savelsbergh
,
George Nemhauser
…
Validation of subgradient optimization
Authors:
Michael Held
,
Philip Wolfe
,
Harlan Crowder
Routing and scheduling of vehicles and crews
Authors:
Samuel Raff
See all cited by
Most referenced authors
60
David W. Pethick
Graham E Gardner
Peter McGilchrist
See all reference authors