On the public citation graph

A Grand-Canonical Solution to a Class of Random Optimization Problems

0 signed · 21 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/nav.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1002/rsa.1015openalex-snapshot
The ζ(2) limit in the random assignment problem
inferredcites →https://doi.org/10.1002/rsa.20084openalex-snapshot
Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
inferredcites →https://doi.org/10.1007/bf02579036openalex-snapshot
Lagrangean relaxation
inferredcites →https://doi.org/10.1007/s10559-016-9847-9openalex-snapshot
Fast Algorithm to Find 2-Factor of Minimum Weight
inferredcites →https://doi.org/10.1016/0196-6774(85)90022-7openalex-snapshot
An algorithmic proof of Tutte's f-factor theorem
inferredcites →https://doi.org/10.1016/0893-6080(94)90081-7openalex-snapshot
The invisible hand algorithm: Solving the assignment problem with statistical physics
inferredcites →https://doi.org/10.1016/j.physrep.2021.03.001openalex-snapshot
The Stable Marriage Problem: An interdisciplinary review from the physicist’s perspective
inferredcites →https://doi.org/10.1038/s41467-020-16175-yopenalex-snapshot
Application of combinatorial optimization strategies in synthetic biology
inferredcites →https://doi.org/10.1051/jphys:019860047080128500openalex-snapshot
A replica analysis of the travelling salesman problem
inferredcites →https://doi.org/10.1051/jphyslet:0198400450240114500openalex-snapshot
On the statistical mechanics of optimization problems of the travelling salesman type
inferredcites →https://doi.org/10.1051/jphyslet:019850046017077100openalex-snapshot
Replicas and optimization
inferredcites →https://doi.org/10.1088/1751-8121/abee9dopenalex-snapshot
The planted k-factor problem
inferredcites →https://doi.org/10.1093/acprof:oso/9780198509417.001.0001openalex-snapshot
Statistical Physics of Spin Glasses and Information Processing
inferredcites →https://doi.org/10.1103/physrevlett.58.1703openalex-snapshot
Zero-temperature scaling and combinatorial optimization
inferredcites →https://doi.org/10.1103/physrevlett.84.1347openalex-snapshot
Random Costs in Combinatorial Optimization
inferredcites →https://doi.org/10.1137/0208045openalex-snapshot
A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
inferredcites →https://doi.org/10.1137/0210024openalex-snapshot
Optimization Problems on Graphs with Independent Random Edge Weights
inferredcites →https://doi.org/10.1287/moor.1040.0105openalex-snapshot
On Random Symmetric Travelling Salesman Problems
inferredcites →https://doi.org/10.1287/opre.18.6.1138openalex-snapshot
The Traveling-Salesman Problem and Minimum Spanning Trees
inferredcites →https://doi.org/10.3390/a17050212openalex-snapshot
A General Statistical Physics Framework for Assignment Problems
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.