Constructive bounds and exact expectations for the random assignment problem
From MaRDI portal
Recommendations
Cites work
- A Combinatorial Algorithm
- A Lower Bound on the Expected Cost of an Optimal Assignment
- Algorithm and Average-value Bounds for Assignment Problems
- Asymptotics in the random assignment problem
- Average Case Analysis of a Heuristic for the Assignment Problem
- Certain expected values in the random assignment problem
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- On Approximation Methods for the Assignment Problem
- On linear programs with random costs
- On the expected optimal value of random assignment problems: Experimental results and open questions
- On the Expected Value of a Random Assignment Problem
Cited in
(39)- The k-assignment polytope
- Random matching problems on the complete graph
- An easy proof of the \(\zeta (2)\) limit in the random assignment problem
- Asymptotics in the random assignment problem
- On the expected optimal value of random assignment problems: Experimental results and open questions
- Certain expected values in the random assignment problem
- A proof of Parisi's conjecture on the random assignment problem
- Typical values of extremal-weight combinatorial structures with independent symmetric weights
- A two-objective fuzzy \(k\)-cardinality assignment problem
- An asymptotical study of combinatorial optimization problems by means of statistical mechanics
- On the maximum of random assignment process
- The (2) limit in the random assignment problem
- Asymptotic moments of the bottleneck assignment problem
- Minimum cost matching in a random graph with random costs
- The blind passenger and the assignment problem
- Weight of a link in a shortest path tree and the Dedekind eta function
- scientific article; zbMATH DE number 1802784 (Why is no real title available?)
- Belief propagation: an asymptotically optimal algorithm for the random assignment problem
- Random assignment and shortest path problems
- The Probabilistic Analysis of a Heuristic for the Assignment Problem
- scientific article; zbMATH DE number 1263267 (Why is no real title available?)
- Average Case Analysis of a Heuristic for the Assignment Problem
- Optimality of belief propagation for random assignment problem
- A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
- scientific article; zbMATH DE number 1833413 (Why is no real title available?)
- Random Assignment with Integer Costs
- The random fractional matching problem
- Efficient algorithms for three‐dimensional axial and planar random assignment problems
- A Lower Bound on the Expected Cost of an Optimal Assignment
- ON THE FLUCTUATION IN THE RANDOM ASSIGNMENT PROBLEM
- Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
- The Dyck bound in the concave 1-dimensional random assignment model
- On the Maximum of a Special Random Assignment Process
- The mean field traveling salesman and related problems
- Extrema of a multinomial assignment process
- A CLuP algorithm to practically achieve 0.76 SK-model ground state free energy
- Asymptotic results for random multidimensional assignment problems
- Asymptotic properties of random multidimensional assignment problems
- Random assignment problems
This page was built for publication: Constructive bounds and exact expectations for the random assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4265785)
