On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem

Published Online:https://doi.org/10.1287/moor.1030.0076

References

  • Fujishige S.Submodular Functions and Optimization (1991) (North-Holland, Amsterdam, The Netherlands) Google Scholar
  • Girlich E., Kovalev M., Zaporozhets A. A polynomial algorithm for resource allocation problems with polymatroid constraints. Optimization (1996) 37:73–86CrossrefGoogle Scholar
  • Hochbaum D. S. Lower and upper bounds for the allocation problem and other nonlinear optimization problems. Math. Oper. Res. (1994) 19:390–409LinkGoogle Scholar
  • Ibaraki T., Katoh N.Resource Allocation Problems: Algorithmic Approaches (1988) (MIT Press, Boston, MA) Google Scholar
  • Katoh N., Ibaraki T., Du D-Z., Pardalos P. M. Resource allocation problems. Handbook of Combinatorial Optimization II (1998) (Kluwer Academic Publishers, Boston, MA) 159–260CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.