### Abstract

A linear n × n assignment problem is considered for which the elements of the cost matrix are sampled from a continuous probability distribution. Based on the zero entries of the reduced matrix the expectation of the maximum number of initial assignments is determined for general n, as well as an asymptotic value for large n.

Original language | Undefined |
---|---|

Pages (from-to) | 329-335 |

Journal | Operations research letters |

Volume | 8 |

Issue number | 6 |

DOIs | |

Publication status | Published - 1989 |

### Keywords

- occupancy problem
- Bipartite graph
- Linear assignment problem
- IR-70401
- Matching

## Cite this

Nawijn, W. M., & Dorhout, B. (1989). On the expected number of assignments in reduced matrices for the linear assignment problem.

*Operations research letters*,*8*(6), 329-335. https://doi.org/10.1016/0167-6377(89)90018-7