Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
From MaRDI portal
Publication:5717770
DOI10.1002/rsa.20084zbMath1125.90026OpenAlexW4247422315WikidataQ123141315 ScholiaQ123141315MaRDI QIDQ5717770
Balaji Prabhakar, M. Sharma, Chandra Nair
Publication date: 10 January 2006
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20084
Management decision making, including multiple objectives (90B50) Stochastic scheduling theory in operations research (90B36) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
On the Maximum of a Special Random Assignment Process, Distributionally robust mixed integer linear programs: persistency models with applications, Asymptotic behavior of the expected optimal value of the multidimensional assignment problem, On the maximum of random assignment process, The mean field traveling salesman and related problems, The planted matching problem: sharp threshold and infinite-order phase transition, Extrema of a multinomial assignment process, Replica symmetry of the minimum matching, Minimum Cost Matching in a Random Graph with Random Costs, Random-link matching problems on random regular graphs, Anomalous scaling of the optimal cost in the one-dimensional random assignment problem, The Blind Passenger and the Assignment Problem, The stable marriage problem: an interdisciplinary review from the physicist's perspective, On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph, Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs, Local tail bounds for functions of independent random variables, Random assignment problems, On random multi-dimensional assignment problems, Efficient algorithms for three‐dimensional axial and planar random assignment problems, Weight of a link in a shortest path tree and the Dedekind Eta function, Edge flows in the complete random-lengths network, Uncertain programming model for uncertain optimal assignment problem, On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model, The \(k\)-assignment polytope, Strong and weighted matchings in inhomogenous random graphs, The planted matching problem: phase transitions and exact results, The Effect of Adding Randomly Weighted Edges, The minimum perfect matching in pseudo-dimension 0 < q < 1, A general method for lower bounds on fluctuations of random variables, The Dyck bound in the concave 1-dimensional random assignment model, Typical values of extremal-weight combinatorial structures with independent symmetric weights
Cites Work
