Some recent results in the analysis of greedy algorithms for assignment problems

U. Faigle

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)
155 Downloads (Pure)

Abstract

We survey some recent developments in the analysis of greedy algorithms for assignment and transportation problems. We focus on the linear programming model for matroids and linear assignment problems with Monge property, on general linear programs, probabilistic analysis for linear assignment and makespan minimization, and on-line algorithms for linear and non-linear assignment problems.
Original languageUndefined
Pages (from-to)181-188
Number of pages8
JournalOR Spectrum = OR Spektrum
Volume15
Issue number4
DOIs
Publication statusPublished - 1994

Keywords

  • METIS-140679
  • IR-85179

Cite this