Operations Research Letters
| Hi-index | 0.00 |
It is pointed out that the polynomial-time scaling algorithm by Hochbaum does not work correctly for the general resource allocation problem. Hochbaum's algorithm increases a variable by one unit if the variable cannot feasibly be increased by the scaling unit. We modify the algorithm to increase such a variable by the largest possible amount and show that with this modification the algorithm works correctly. The effect is to modify the factorF in the running time of Hochbaum's algorithm for finding whether a certain solution is feasible by the factorF~ of finding the maximum feasible increment (also called the saturation capacity). Therefore, the corrected algorithm runs in O( n(logn +F~) log( B/n)) time.