On the public citation graph

Some theoretical implications of local optimization

https://doi.org/10.1007/bf01580681
0 signed · 30 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.1965.tb04146.xopenalex-snapshot
Computer Solutions of the Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-642-51565-1_136openalex-snapshot
The Traveling Salesman Problem: A Survey
inferredcites →https://doi.org/10.1057/jors.1970.122openalex-snapshot
Integer Programming and Network Flows.
inferredcites →https://doi.org/10.1080/01621459.1938.10502338openalex-snapshot
The Annals of Mathematical Statistics
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.1109/swat.1973.26openalex-snapshot
Statistical indicators of optimality
inferredcites →https://doi.org/10.1109/swat.1974.4openalex-snapshot
Approximate algorithms for the traveling salesperson problem
inferredcites →https://doi.org/10.1109/tct.1969.1083004openalex-snapshot
The Design of Minimum-Cost Survivable Networks
inferredcites →https://doi.org/10.1137/0113056openalex-snapshot
Discrete Optimizing
inferredcites →https://doi.org/10.1145/800125.804052openalex-snapshot
Neighborhood search algorithms for finding optimal traveling salesman tours must be inefficient
inferredcites →https://doi.org/10.1214/aoms/1177704004openalex-snapshot
Probability Integrals of Multivariate Normal and Multivariate $t^1$
inferredcites →https://doi.org/10.1287/opre.16.3.538openalex-snapshot
The Traveling Salesman Problem: A Survey
inferredcites →https://doi.org/10.1287/opre.6.6.791openalex-snapshot
A Method for Solving Traveling-Salesman Problems
inferredcites →https://doi.org/10.2307/3008450openalex-snapshot
Integer Programming and Network Flows.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0471787779.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-3-031-35719-0_2openalex-snapshot
Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/bf01874396openalex-snapshot
Randomized algorithms: An annotated bibliography
inferred← citeshttps://doi.org/10.1007/bf02241700openalex-snapshot
An effective structured approach to finding optimal partitions of networks
inferred← citeshttps://doi.org/10.1007/bfb0006528openalex-snapshot
Accelerated greedy algorithms for maximizing submodular set functions
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90013-2openalex-snapshot
Simulated annealing and tabu search: Lessons from a line search
inferred← citeshttps://doi.org/10.1016/0377-2217(93)e0234-oopenalex-snapshot
A note on the rule for sequential selection
inferred← citeshttps://doi.org/10.1016/b978-813120376-7/50031-2openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.12.001openalex-snapshot
Polarity and the complexity of the shooting experiment
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00300-2openalex-snapshot
Solving the medium newspaper production/distribution problem
inferred← citeshttps://doi.org/10.1080/00207729808929523openalex-snapshot
Probabilistic analysis of 2-opt for travelling salesman problems
inferred← citeshttps://doi.org/10.1145/3648354openalex-snapshot
Optimizing with Attractor: A Tutorial
inferred← citeshttps://doi.org/10.1287/ijoc.2.1.4openalex-snapshot
Tabu Search—Part II
inferred← citeshttps://doi.org/10.5772/intechopen.96129openalex-snapshot
How to Solve the Traveling Salesman Problem
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.