Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1989: Automata, Languages and Programming pp 461–472Cite as

The complexity of nonlinear separable optimization

  • Conference paper
  • First Online:

  • 151 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 372))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Cook, A.M.H. Gerards, A. Schrijver and E. Tardos, "Sensitivity Results in Integer Linear Programming," Mathematical Programming 34 (1986), 251–264.

    Article  Google Scholar 

  2. G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, (1963).

    Google Scholar 

  3. A. Federgruen and H. Groenevelt, "The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality," Operations Research Vol. 34, No. 6 (1986), 909–918.

    Google Scholar 

  4. A. Frank and E. Tardos, "An Application of Simultaneous Approximation in Combinatorial Optimization," 26th Annual Symposium on Foundations of Computer Science (1985), 459–463. Also, in Combinatorica Vol.7, 49–66 (1987).

    Google Scholar 

  5. F. Granot and J. Skorin-Kapov, "Some Proximity and Sensitivity Results in Quadratic Integer Programming," Working Paper No. 1207, University of British Columbia (1986).

    Google Scholar 

  6. D. S. Hochbaum and J. G. Shanthikumar, "Convex Separable Optimization is Not Much Harder Than Linear Optimization," Manuscript, UC Berkeley, April (1988).

    Google Scholar 

  7. D. S. Hochbaum and J. G. Shanthikumar, "Optimal Algorithms for Allocation Problems and Their Extensions," Manuscript, UC Berkeley, March (1989).

    Google Scholar 

  8. H.W. Lenstra Jr., "Integer Programming with a Fixed Number of Variables," Mathematics of Operations Research, Vol. 8, No. 4, (1983).

    Google Scholar 

  9. A.S. Nemirovsky and D.D. Yudin, Problem Complexity and Method Efficiency in Optimization, Wiley 1983.

    Google Scholar 

  10. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, 1982.

    Google Scholar 

  11. E. Tardos, "A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs," Operations Research, 34 (1986), 250–256.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Business Administration and IEOR Department, University of California, Berkeley

    Dorit S. Hochbaum

  2. School of Business Administration, University of California, Berkeley

    J. George Shanthikumar

Authors
  1. Dorit S. Hochbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. George Shanthikumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Mariangiola Dezani-Ciancaglini Simonetta Ronchi Della Rocca

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hochbaum, D.S., Shanthikumar, J.G. (1989). The complexity of nonlinear separable optimization. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035777

Download citation

  • DOI: https://doi.org/10.1007/BFb0035777

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51371-1

  • Online ISBN: 978-3-540-46201-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation