Some recent results in the analysis of greedy algorithms for assignment problems
- 1 December 1994
- journal article
- Published by Springer Nature in OR Spectrum
- Vol. 15 (4) , 181-188
- https://doi.org/10.1007/bf01719448
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Series parallel composition of greedy linear programming problemsMathematical Programming, 1993
- New algorithms for an ancient scheduling problemPublished by Association for Computing Machinery (ACM) ,1992
- An algorithm for the detection and construction of Monge sequencesLinear Algebra and its Applications, 1989
- Monge sequences and a simple assignment algorithmDiscrete Applied Mathematics, 1986
- Greedy concepts for network flow problemsDiscrete Applied Mathematics, 1986
- Recognition of Gilmore-Gomory traveling salesman problemDiscrete Applied Mathematics, 1986
- Probabilistic Bounds on the Performance of List SchedulingSIAM Journal on Computing, 1986
- Minimum cost flow algorithms for series-parallel networksDiscrete Applied Mathematics, 1985
- Characterizations of totally balanced matricesJournal of Algorithms, 1984
- The asymptotic probabilistic behaviour of quadratic sum assignment problemsMathematical Methods of Operations Research, 1983