Skip to main content
SpringerLink
Log in

On the relation between complexity and uncertainty

  • Section I Tutorials
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In practical problem situations data are usually inherently unreliable. A mathematical representation of uncertainty leads to stochastic optimization problems. In this paper the complexity of stochastic combinatorial optimization problems is discussed. Surprisingly, certain stochastic versions of NP-hard determinstic combinatorial problems appear to be solvable in polynomial time.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. Derman, G.J. Leiberman and S.M. Ross, A renewal decision problem, Management Science 24 (1978) 554.

    Google Scholar 

  2. M.L. Pinedo, Stochastic scheduling with release dates and due dates, Operations Research 31 (1983) 559.

    Google Scholar 

  3. A.H.G. Rinnooy Kan and L. Stougie, Stochastic integer programming, in:Numerical Techniques and Stochastic Optimization, Y. Ermoliev and R.-J.B. Wets (Springer-Verlag, Heidelberg, 1988).

    Google Scholar 

  4. G. Weiss, Multiserver stochastic scheduling, in:Deterministic and Stochastic Scheduling, eds. M.A.H. Dempster, J.K. Lenstra and A.H.G. Rinnooy Kan (Reidel, Dordrecht, 1982).

    Google Scholar 

  5. G. Weiss and M.L. Pinedo, Scheduling tasks with exponential service times on non identical processors to minimize various cost functions, Journal of Applied Probability 17 (1980) 187.

    Google Scholar 

  6. G. Weiss and M.L. Pinedo, On the ‘largest variance first’ policy in some stochastic scheduling problems, Operations Research, to appear

Download references

Author information

Authors and Affiliations

  1. Erasmus University, Rotterdam, The Netherlands

    Alexander H. G. Rinnooy Kan

  2. University of Amsterdam, The Netherlands

    Leen Stougie

Authors
  1. Alexander H. G. Rinnooy Kan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leen Stougie
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rinnooy Kan, A.H.G., Stougie, L. On the relation between complexity and uncertainty. Ann Oper Res 18, 17–23 (1989). https://doi.org/10.1007/BF02097793

Download citation

  • Issue Date:

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

Keywords

Search

Navigation