The random linear bottleneck assignment problem
From MaRDI portal
Publication:5101412
Recommendations
- The random linear bottleneck assignment problem
- Asymptotic moments of the bottleneck assignment problem
- Solution methods and computational investigations for the linear bottleneck assignment problem
- Certain expected values in the random assignment problem
- Asymptotics in the random assignment problem
Cites work
- Algorithms for two bottleneck optimization problems
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results
- An algorithm to solve them ×n assignment problem in expected timeO(mn logn)
- scientific article; zbMATH DE number 3902655 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3943863 (Why is no real title available?)
- Matchings in random regular bipartite digraphs
- On the Expected Value of a Random Assignment Problem
- Order statistics and the linear assignment problem
Cited in
(6)- Solution methods and computational investigations for the linear bottleneck assignment problem
- Bottleneck assignment problems under categorization
- On the expected number of assignments in reduced matrices for the linear assignment problem
- Asymptotic moments of the bottleneck assignment problem
- On the solution of a stochastic bottleneck assignment problem and its variations
- The random linear bottleneck assignment problem
This page was built for publication: The random linear bottleneck assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5101412)