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

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

0.00 Avg rating0 Votes
Article ID: iaor19952271
Country: Germany
Volume: 15
Issue: 4
Start Page Number: 181
End Page Number: 188
Publication Date: Jun 1994
Journal: OR Spektrum
Authors:
Keywords: programming: linear
Abstract:

The paper surveys some recent developments in the analysis of greedy algorithms for assignment and transportation problems. It focuses 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.

Reviews

Required fields are marked *. Your email address will not be published.