On the public citation graph

Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem

https://doi.org/10.1007/bf01585505
0 signed · 78 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01584070openalex-snapshot
The traveling-salesman problem and minimum spanning trees: Part II
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078686-7openalex-snapshot
On the shortest spanning subtree of a graph and the traveling salesman problem
inferredcites →https://doi.org/10.1145/362736.362753openalex-snapshot
Increasing the efficiency of quicksort
inferredcites →https://doi.org/10.1145/362790.362803openalex-snapshot
Algorithms 402: Increasing the efficiency of quicksort
inferredcites →https://doi.org/10.1287/opre.18.6.1138openalex-snapshot
The Traveling-Salesman Problem and Minimum Spanning Trees

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118627372.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/nav.3800300107openalex-snapshot
The traveling salesman problem: An update of research
inferred← citeshttps://doi.org/10.1002/net.3230110209openalex-snapshot
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects
inferred← citeshttps://doi.org/10.1002/net.3230220204openalex-snapshot
Optimal routing and process scheduling for a mobile service facility
inferred← citeshttps://doi.org/10.1002/rsa.20706openalex-snapshot
Separating subadditive euclidean functionals
inferred← citeshttps://doi.org/10.1007/3-540-07623-9_300openalex-snapshot
Subgradient optimization, matroid problems and heuristic evaluation
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_10openalex-snapshot
Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-1-4419-6512-7_8openalex-snapshot
Single Vehicle Round-trip Routing
inferred← citeshttps://doi.org/10.1007/978-3-031-86849-8_4openalex-snapshot
Diversification Through Candidate Sampling for a Non-iterated Lin-Kernighan-Helsgaun Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_26openalex-snapshot
Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-322-84013-4_7openalex-snapshot
Das Zuordnungs- und das Rundreiseproblem
inferred← citeshttps://doi.org/10.1007/978-3-642-46329-7_7openalex-snapshot
On Constrained Shortest-Route Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-68118-9_52openalex-snapshot
Die Anwendung von “Matchings” bei der Lösung von Routing-Problemen
inferred← citeshttps://doi.org/10.1007/978-3-642-95316-3_6openalex-snapshot
Optimierungsprobleme mit Nicht Polynomial Begrenzten Algorithmen
inferred← citeshttps://doi.org/10.1007/978-3-642-99748-8_16openalex-snapshot
Graphentheoretische Probleme und Methoden — ein Überblick über neuere Entwicklungen (Übersichtsvortrag)
inferred← citeshttps://doi.org/10.1007/978-3-662-00401-2_16openalex-snapshot
Graphentheoretische Methoden in der Logistik
inferred← citeshttps://doi.org/10.1007/978-3-662-03514-6_8openalex-snapshot
Recent Advances in Routing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-7091-3291-3_4openalex-snapshot
The Traveling Salesman Problem and its Implications
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_7openalex-snapshot
Acyclic Subdigraphs and Linear Orderings: Polytopes, Facets, and a Cutting Plane Algorithm
inferred← citeshttps://doi.org/10.1007/978-94-009-7154-7_7openalex-snapshot
The assignment and the travelling salesman problems
inferred← citeshttps://doi.org/10.1007/978-94-011-7557-9_8openalex-snapshot
The Peripatetic Salesman and Some Related Unsolved Problems
inferred← citeshttps://doi.org/10.1007/978-94-011-9688-8_21openalex-snapshot
Pattern Recognition Applications in Work with Ancient Objects
inferred← citeshttps://doi.org/10.1007/bf01580682openalex-snapshot
Integer programming approaches to the travelling salesman problem
inferred← citeshttps://doi.org/10.1007/bf01584228openalex-snapshot
A restricted Lagrangean approach to the traveling salesman problem
inferred← citeshttps://doi.org/10.1007/bf01584338openalex-snapshot
The traveling salesman problem: A duality approach
inferred← citeshttps://doi.org/10.1007/bf01589105openalex-snapshot
New lower bounds for the Symmetric Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/bf01609016openalex-snapshot
Using cutting planes to solve the symmetric Travelling Salesman problem
inferred← citeshttps://doi.org/10.1007/bf01758756openalex-snapshot
How to find Steiner minimal trees in euclideand-space
inferred← citeshttps://doi.org/10.1007/bf01918456openalex-snapshot
Lineare Charakterisierungen von Travelling Salesman Problemen
inferred← citeshttps://doi.org/10.1007/bf02294091openalex-snapshot
Applications of Combinatorial Programming to Data Analysis: The Traveling Salesman and Related Problems
inferred← citeshttps://doi.org/10.1007/bfb0120910openalex-snapshot
Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90083-3openalex-snapshot
Heuristically guided algorithm for k-parity matroid problems
inferred← citeshttps://doi.org/10.1016/0022-0000(78)90022-3openalex-snapshot
Algorithms for updating minimal spanning trees
inferred← citeshttps://doi.org/10.1016/0167-6377(95)00038-0openalex-snapshot
Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
inferred← citeshttps://doi.org/10.1016/0305-0548(80)90022-2openalex-snapshot
Degree-constrained minimum spanning tree
inferred← citeshttps://doi.org/10.1016/0305-0548(83)90030-8openalex-snapshot
Routing and scheduling of vehicles and crews
inferred← citeshttps://doi.org/10.1016/0377-2217(82)90014-5openalex-snapshot
Probabilistic analysis of solving the assignment problem for the traveling salesman problem
inferred← citeshttps://doi.org/10.1016/0377-2217(82)90015-7openalex-snapshot
A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90138-yopenalex-snapshot
The traveling salesman problem: An overview of exact and approximate algorithms
inferred← citeshttps://doi.org/10.1016/0771-050x(78)90024-4openalex-snapshot
The seriation problem and the travelling salesman problem
inferred← citeshttps://doi.org/10.1016/b978-0-12-734250-4.50010-2openalex-snapshot
COMBINATORIAL OPTIMIZATION: WHAT IS THE STATE OF THE ART?
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.02.008openalex-snapshot
Embedding learning capability in Lagrangean relaxation: An application to the travelling salesman problem
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70754-4openalex-snapshot
A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree Relaxation
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70755-6openalex-snapshot
Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70827-6openalex-snapshot
Travelling Salesman and Assignment Problems: A Survey
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00159-xopenalex-snapshot
Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00214-7openalex-snapshot
Estimating the Held-Karp lower bound for the geometric TSP
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00284-2openalex-snapshot
An effective implementation of the Lin–Kernighan traveling salesman heuristic
inferred← citeshttps://doi.org/10.1051/ro/1978120403691openalex-snapshot
Improved lower bounds to the travelling salesman problem
inferred← citeshttps://doi.org/10.1057/jors.1975.151openalex-snapshot
Some Simple Applications of the Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601053openalex-snapshot
An improved branching rule for the symmetric travelling salesman problem
inferred← citeshttps://doi.org/10.1057/s41274-016-0173-4openalex-snapshot
A dual local search framework for combinatorial optimization problems with TSP application
inferred← citeshttps://doi.org/10.1080/05695557808975227openalex-snapshot
An Industrial application of the traveling salesman's subtour problem
inferred← citeshttps://doi.org/10.1080/05695557908974447openalex-snapshot
A Transportation Location-Allocation Model for Regional Blood Banking
inferred← citeshttps://doi.org/10.1109/icsenst.2008.4757083openalex-snapshot
Energy- aware mobile element scheduling in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/mahc.1985.10011openalex-snapshot
On the History of the Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1137/1033004openalex-snapshot
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1145/2897518.2897571openalex-snapshot
Separating subadditive euclidean functionals
inferred← citeshttps://doi.org/10.1155/2015/854218openalex-snapshot
Solving Large-Scale TSP Using a Fast Wedging Insertion Partitioning Approach
inferred← citeshttps://doi.org/10.1184/r1/6479474openalex-snapshot
Separating subadditive Euclidean functionals
inferred← citeshttps://doi.org/10.1287/mnsc.1040.0263openalex-snapshot
The Lagrangian Relaxation Method for Solving Integer Programming Problems
inferred← citeshttps://doi.org/10.1287/moor.16.1.72openalex-snapshot
Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1287/moor.2.3.209openalex-snapshot
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
inferred← citeshttps://doi.org/10.1287/moor.5.1.1openalex-snapshot
Combinatorial Optimization: What is the State of the Art
inferred← citeshttps://doi.org/10.1287/opre.33.5.1024openalex-snapshot
Using Confidence Limits for the Global Optimum in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1287/opre.34.5.698openalex-snapshot
An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
inferred← citeshttps://doi.org/10.24089/j.sisfo.2018.01.005openalex-snapshot
Implementasi dan Perbandingan Metode Iterative Deepening Search dan Held-Karp pada Manajemen Pengiriman Produk
inferred← citeshttps://doi.org/10.3390/math11061418openalex-snapshot
A Lagrangian Method for Calculation of Passing Capacity on a Railway Hub Station
inferred← citeshttps://doi.org/10.47749/t/unicamp.2022.1246095openalex-snapshot
Um estudo sobre problemas de roteamento de veículo com aplicação em uma rede de distribuição logística
inferred← citeshttps://doi.org/10.4995/thesis/10251/2664openalex-snapshot
Optimización heurística económica aplicada a las redes de transporte del tipo VRPTW.
inferred← citeshttps://doi.org/10.7763/ijmo.2018.v8.638openalex-snapshot
Solving a Modified TSP Problem by a Greedy Heuristic for Cost Minimization
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.