Skip to main content

Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios

  • Conference paper
Nonlinear Mathematics for Uncertainty and its Applications

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 100))

Abstract

In this paper a class of bottleneck combinatorial optimization problems with unknown costs is discussed. A scenario set containing all the costs realizations is specified and a possibility distribution in this scenario set is provided. Several models of uncertainty with solution algorithms for each uncertainty representation are presented.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs (1993)

    MATH  Google Scholar 

  2. Aissi, H., Bazgan, C., Vanderpooten, D.: Min–max and min–max regret versions of combinatorial optimization problems: A survey. European Journal of Operational Research 197, 427–438 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Averbakh, I.: Minmax regret solutions for minimax optimization problems with uncertainty. Operations Research Letters 27, 57–65 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Dubois, D., Prade, H.: Possibility Theory: an approach to computerized processing of uncertainty. Plenum Press, New York (1988)

    MATH  Google Scholar 

  5. Inuiguchi, M., Ramik, J.: Possibilistic linear programming: a brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem. Fuzzy Sets and Systems 111, 3–28 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Inuiguchi, M., Sakawa, M.: Robust optimization under softness in a fuzzy linear programming problem. International Journal of Approximate Reasoning 18, 21–34 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kouvelis, P., Yu, G.: Robust Discrete Optimization and its applications. Kluwer Academic Publishers, Dordrecht (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kasperski, A., Zieliński, P. (2011). Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios. In: Li, S., Wang, X., Okazaki, Y., Kawabe, J., Murofushi, T., Guan, L. (eds) Nonlinear Mathematics for Uncertainty and its Applications. Advances in Intelligent and Soft Computing, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22833-9_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22833-9_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22832-2

  • Online ISBN: 978-3-642-22833-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics