Approximate binary search algorithms for mean cuts and cycles
- 31 October 1993
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 14 (3) , 129-132
- https://doi.org/10.1016/0167-6377(93)90022-9
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- New scaling algorithms for the assignment and minimum mean cycle problemsMathematical Programming, 1992
- Finding minimum-cost circulations by canceling negative cyclesJournal of the ACM, 1989
- A linear time randomizing algorithm for searching ranked functionsAlgorithmica, 1987
- Parametric shortest path algorithms with an application to cyclic staffingDiscrete Applied Mathematics, 1981
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978