# New scaling algorithms for the assignment and minimum mean cycle problems

@article{Orlin1992NewSA,
title={New scaling algorithms for the assignment and minimum mean cycle problems},
author={J. Orlin and R. Ahuja},
journal={Mathematical Programming},
year={1992},
volume={54},
pages={41-56}
}
• Published 1992
• Mathematics, Computer Science
• Mathematical Programming
AbstractIn this paper we suggest new scaling algorithms for the assignment and minimum mean cycle problems. Our assignment algorithm is based on applying scaling to a hybrid version of the recentauction algorithm of Bertsekas and the successive shortest path algorithm. The algorithm proceeds by relaxing the optimality conditions, and the amount of relaxation is successively reduced to zero. On a network with 2n nodes,m arcs, and integer arc costs bounded byC, the algorithm runs in O( \sqrt n… Expand
99 Citations

#### Topics from this paper

Directed Shortest Paths via Approximate Cost Balancing
• Computer Science, Mathematics
• SODA
• 2021
Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems
• Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361)
• 1999
Approximating the minimum cycle mean
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2014
The quickest flow problem
• Mathematics, Computer Science
• ZOR Methods Model. Oper. Res.
• 1993
Approximating the minimum cycle mean
• Mathematics, Computer Science
• GandALF
• 2013

#### References

SHOWING 1-10 OF 33 REFERENCES