On the Expected Value of a Random Assignment Problem
From MaRDI portal
Cited in
(41)- Weighted tree games
- Uncertain programming model for uncertain optimal assignment problem
- An analysis of a decomposition heuristic for the assignment problem
- Order statistics and the linear assignment problem
- Quick or cheap? Breaking points in dynamic markets
- The asymptotic probabilistic behaviour of quadratic sum assignment problems
- Maximal paths in random dynamic graphs
- Selected topics on assignment problems
- Exploiting partial correlations in distributionally robust optimization
- Probabilistic analysis of optimization problems on sparse random shortest path metrics
- On linear programs with random costs
- Matchings in random regular bipartite digraphs
- Constructive bounds and exact expectations for the random assignment problem
- The mean field traveling salesman and related problems
- A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
- Minimal H-factors and covers
- Minimean optimal key arrangements in hash tables
- On the value of a random minimum spanning tree problem
- One-factor in random graphs based on vertex choice
- Asymptotics in the random assignment problem
- Random assignment problems
- Concentration of measure and isoperimetric inequalities in product spaces
- On the expected optimal value of random assignment problems: Experimental results and open questions
- Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
- On Frieze's (3) limit for lengths of minimal spanning trees
- Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
- The planted matching problem: sharp threshold and infinite-order phase transition
- Minimum-weight combinatorial structures under random cost-constraints
- The (2) limit in the random assignment problem
- On random k-out subgraphs of large graphs
- Probabilistic asymptotic properties of some combinatorial optimization problems
- The random linear bottleneck assignment problem
- Minimum cost matching in a random graph with random costs
- On the longest path of a randomly weighted tournament
- The effect of adding randomly weighted edges
- Uncertain random assignment problem
- The planted matching problem: phase transitions and exact results
- On the connectivity of random m-orientable graphs and digraphs
- The minimum perfect matching in pseudo-dimension \(0<q<1\)
- Asymptotic results for random multidimensional assignment problems
- The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach
This page was built for publication: On the Expected Value of a Random Assignment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3048272)