Skip to content

QuickMatch: A Very Fast Algorithm for the Assignment Problem

Authors: James B. Orlin, Yusin Lee

Published: 1993 (Technical Report)

Source: MIT Sloan School of Management

Algorithm: QuickMatch

Summary

Introduces QuickMatch, a fast practical algorithm for the linear assignment problem. Designed to exploit problem structure for speed in practice, complementing theoretically optimal but slow algorithms. An MIT Sloan working paper (WP 3547-93) targeting large-scale assignment instances.

Abstract

Primary

Paper dspace.mit.edu

Tags

  • Assignment problem

  • Hungarian algorithm

  • Combinatorial optimization

  • Graph algorithms

  • Matching