On the public citation graph

On the expected optimal value of random assignment problems: Experimental results and open questions

https://doi.org/10.1007/bf01299451
0 signed · 34 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/9781119584445.ch10openalex-snapshot
The Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/978-3-642-61649-5_4openalex-snapshot
Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/bf01582905openalex-snapshot
Computational results of an interior point algorithm for large scale linear programming
inferredcites →https://doi.org/10.1007/bf01587095openalex-snapshot
An implementation of Karmarkar's algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf02241753openalex-snapshot
Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
inferredcites →https://doi.org/10.1007/bf02310105openalex-snapshot
Order statistics and the linear assignment problem
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1016/0024-3795(91)90275-2openalex-snapshot
Computational experience with a primal-dual interior point method for linear programming
inferredcites →https://doi.org/10.1016/0167-6377(93)90071-nopenalex-snapshot
Certain expected values in the random assignment problem
inferredcites →https://doi.org/10.1016/b978-0-12-386870-1.50006-xopenalex-snapshot
An Upper Bound on the Expected Cost of an Optimal Assignment
inferredcites →https://doi.org/10.1016/c2013-0-10917-8openalex-snapshot
Discrete Algorithms and Complexity
inferredcites →https://doi.org/10.1051/jphys:019870048090145100openalex-snapshot
On the solution of the random link matching problems
inferredcites →https://doi.org/10.1080/03610929008830444openalex-snapshot
Probability and statisitics in the service of computer science: illustrations using the assignment problem
inferredcites →https://doi.org/10.1090/dimacs/012/17openalex-snapshot
An approximate dual projective algorithm for solving assignment problems
inferredcites →https://doi.org/10.1090/s0002-9947-1989-1005525-6openalex-snapshot
The nonlinear geometry of linear programming. I. Affine and projective scaling trajectories
inferredcites →https://doi.org/10.1137/0208036openalex-snapshot
On the Expected Value of a Random Assignment Problem
inferredcites →https://doi.org/10.1145/355826.355828openalex-snapshot
A More Portable Fortran Random Number Generator
inferredcites →https://doi.org/10.1147/rd.134.0380openalex-snapshot
Algorithm and Average-value Bounds for Assignment Problems
inferredcites →https://doi.org/10.1209/0295-5075/8/3/002openalex-snapshot
The Cavity Method and the Travelling-Salesman Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199909)15:2<113::aid-rsa1>3.0.co;2-sopenalex-snapshot
Constructive bounds and exact expectations for the random assignment problem
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_20openalex-snapshot
Asymptotic Properties of Random Multidimensional Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-3632-7_12openalex-snapshot
On Very Large Scale Assignment Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_2openalex-snapshot
Linear Assignment Problems and Extensions
inferred← citeshttps://doi.org/10.1007/s00440-003-0308-9openalex-snapshot
A proof of Parisi’s conjecture on the random assignment problem
inferred← citeshttps://doi.org/10.1007/s10107-006-0036-xopenalex-snapshot
Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
inferred← citeshttps://doi.org/10.1007/s10107-019-01453-5openalex-snapshot
Exploiting Partial Correlations in Distributionally Robust Optimization
inferred← citeshttps://doi.org/10.1007/s10589-005-3227-0openalex-snapshot
Asymptotic Results for Random Multidimensional Assignment Problems
inferred← citeshttps://doi.org/10.1016/j.cie.2013.05.013openalex-snapshot
A negative dual rectangle cancellation algorithm for the linear assignment problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.11.062openalex-snapshot
Random assignment problems
inferred← citeshttps://doi.org/10.1016/j.spl.2021.109087openalex-snapshot
Maxima and near-maxima of a Gaussian random assignment field
inferred← citeshttps://doi.org/10.1017/s0963548302005114openalex-snapshot
Exact Expectations and Distributions for the Random Assignment Problem
inferred← citeshttps://doi.org/10.1023/b:jota.0000042592.16418.1bopenalex-snapshot
Asymptotic Properties of Random Multidimensional Assignment Problems
inferred← citeshttps://doi.org/10.1214/ecp.v14-1475openalex-snapshot
An easy proof of the $\zeta(2)$ limit in the random assignment problem
inferred← citeshttps://doi.org/10.48550/arxiv.math/0307357openalex-snapshot
A proof of a conjecture of Buck, Chan and Robbins on the random assignment 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.