Skip to main content
SpringerLink
Log in

Probabilistic analysis of algorithms for some combinatorial optimization problems

  • Conference paper
  • First Online:
Recent Advances in System Modelling and Optimization

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 87))

  • 204 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Erdos, P., Spencer, J. Probabilistic Methods in Combinatorics. Academic Press, 1974.

    Google Scholar 

  2. Gazmuri, P. “Probabilistic Analysis of Packing, Coloring and Scheduling Problems”. Ph.D. Thesis, University of California, Berkeley, 1980.

    Google Scholar 

  3. Gazmuri, P. “Chromatic Number on Sparse Graphs”. Working Paper No84/06. Depto. de Ingeniería de Sistemas. Pontificia Universidad Católica de Chile.

    Google Scholar 

  4. Gazmuri, P. “Probabilistic Analysis of a Machine Scheduling Problem”, Mathematics of Operations Research Vol. 10, No2, 1985.

    Google Scholar 

  5. Gazmuri, P. “Some new results on probabilistic analysis of machine scheduling problems”. Working Paper No85/01. Depto. de Ingeniería de Sistemas. Pontificia Universidad Católica de Chile. Submitted for publication in Operations Research.

    Google Scholar 

  6. Gazmuri, P. “Independent sets in Random Sparse Graphs”. Networks, Vol 14, No3, 1984.

    Google Scholar 

  7. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnoy Kan, A.H.G. “Optimization and Aproximation in Deterministic Sequencing and Scheduling: a survey”. Annals of Discrete Mathematics Vol 5, 1979.

    Google Scholar 

  8. Grimmett, G.R. McDiarmid, J.H. “On coloring random graphs”. Math. Proc. Camb. Phil. Society Vol 77, 1975.

    Google Scholar 

  9. Karp, R.M. “Probabilistic Analysis of Partitioning algorithms for the Travelling-Salesman Problem in the plane”. Mathematics of Operations Research. Vol 2, No3, 1977.

    Google Scholar 

  10. Karp, R.M. “The Probabilistic Analysis of some combinatorial search algorithms”. Memorandum NoERL-M581, 1976. Electronics Research Laboratory, University of California, Berkeley.

    Google Scholar 

  11. Loulou, R. “Tight Bounds and Probabilistic Analysis of two heuristics for Parallel Processor Scheduling” Mathematics of Operations Research Vol 9, No1, 1984.

    Google Scholar 

  12. Pinedo, M., Schrage, L. “Stochastic Shop Scheduling: A survey” in Deterministic and stochastic Scheduling. Nato Advanced Study Institutes Series. D. Reidel Publishing Company. 1981.

    Google Scholar 

  13. Wiss, G. “Multiserver Stochastic Scheduling” in Deterministic and Stochastic Scheduling. Nato Advanced Study Institute Series. D. Reidel Publishing Company, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Depto. Ing. de Sistemas, Pontificia Universidad Católica de Chile, Casilla 6177, Santiago, Chile

    P. G. Gazmuri

Authors
  1. P. G. Gazmuri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luis Contesse B. Rafael Correa F. Andrés Weintraub P.

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Gazmuri, P.G. (1986). Probabilistic analysis of algorithms for some combinatorial optimization problems. In: Contesse B., L., Correa F., R., Weintraub P., A. (eds) Recent Advances in System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006783

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17083-9

  • Online ISBN: 978-3-540-47201-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation