Technical Note—A Polynomial Simplex Method for the Assignment Problem | Zendy

Ming S. Hung | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Technical Note—A Polynomial Simplex Method for the Assignment Problem

Author(s) -

Ming S. Hung

Publication year - 1983

Publication title -

operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.797

H-Index - 140

eISSN - 1526-5463

pISSN - 0030-364X

DOI - 10.1287/opre.31.3.595

Subject(s) - simplex , simplex algorithm , mathematics , extreme point , assignment problem , mathematical optimization , integer (computer science) , basis (linear algebra) , combinatorics , integer programming , generalized assignment problem , polynomial , weapon target assignment problem , point (geometry) , revised simplex method , linear programming , computer science , mathematical analysis , geometry , programming language

In Proc. of the Fourth International Symposium on Operations Research, Cambridge, Mass. PIERSKALLA, W. P. 1967. Optimal Issuing Policies in Inventory Management-I. Mgmt. Sci. 13, 395-412. PIERSKALLA, W. P., AND ROACH, C. D. 1972. Optimal Issuing Policies for Perishable Inventory. Mgmt. Sci. 18, 603-614. ZEHNA, P. A. 1962. Inventory Depletion Policies. Studies in Applied Probability. Stanford University Press, Stanford, Calif.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research