Pages that link to "Item:Q5717770"
From MaRDI portal
The following pages link to Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures (Q5717770):
Displayed 30 items.
- Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
- Replica symmetry of the minimum matching (Q431636) (← links)
- The mean field traveling salesman and related problems (Q617874) (← links)
- Asymptotic behavior of the expected optimal value of the multidimensional assignment problem (Q868473) (← links)
- Random assignment problems (Q953417) (← links)
- The \(k\)-assignment polytope (Q1015319) (← links)
- Anomalous scaling of the optimal cost in the one-dimensional random assignment problem (Q1731012) (← links)
- Uncertain programming model for uncertain optimal assignment problem (Q1788760) (← links)
- On random multi-dimensional assignment problems (Q2004066) (← links)
- On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model (Q2031482) (← links)
- Strong and weighted matchings in inhomogenous random graphs (Q2064836) (← links)
- The planted matching problem: phase transitions and exact results (Q2075325) (← links)
- Typical values of extremal-weight combinatorial structures with independent symmetric weights (Q2111788) (← links)
- The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
- Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs (Q2240864) (← links)
- A general method for lower bounds on fluctuations of random variables (Q2327942) (← links)
- Local tail bounds for functions of independent random variables (Q2468424) (← links)
- On the maximum of random assignment process (Q2670804) (← links)
- Minimum Cost Matching in a Random Graph with Random Costs (Q2968521) (← links)
- The Blind Passenger and the Assignment Problem (Q2998855) (← links)
- Weight of a link in a shortest path tree and the Dedekind Eta function (Q3055888) (← links)
- Edge flows in the complete random-lengths network (Q3055894) (← links)
- On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph (Q4643315) (← links)
- The Effect of Adding Randomly Weighted Edges (Q4992839) (← links)
- The minimum perfect matching in pseudo-dimension 0 < <i>q</i> < 1 (Q4993130) (← links)
- Random-link matching problems on random regular graphs (Q5135089) (← links)
- Efficient algorithms for three‐dimensional axial and planar random assignment problems (Q5175234) (← links)
- The Dyck bound in the concave 1-dimensional random assignment model (Q5870421) (← links)
- On the Maximum of a Special Random Assignment Process (Q5883338) (← links)
- The planted matching problem: sharp threshold and infinite-order phase transition (Q6095833) (← links)