Skip to main content

Algorithmic Improvements Using a Heuristic Parameter, Reject Index for Interval Optimization

  • Reference work entry
Encyclopedia of Optimization
  • 379 Accesses

Article Outline

Keywords and Phrases

Introduction

Subinterval Selection

Multisection

Heuristic Rejection

References

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 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.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

References

  1. Casado LG, García I (1998) New Load Balancing Criterion for Parallel Interval Global Optimization Algorithms. In: Proceedings of the 16th IASTED International Conference on Applied Informatics, Garmisch-Partenkirchen, pp 321–323

    Google Scholar 

  2. Casado LG, García I, Csendes T (2000) A new multisection technique in interval methods for global optimization. Computing 65:263–269

    MathSciNet  MATH  Google Scholar 

  3. Casado LG, García I, Csendes T (2001) A heuristic rejection criterion in interval global optimization algorithms. BIT 41:683–692

    MathSciNet  MATH  Google Scholar 

  4. Casado LG, García I, Csendes T, Ruiz VG (2003) Heuristic Rejection in Interval Global Optimization. JOTA 118:27–43

    MATH  Google Scholar 

  5. Csallner AE, Csendes T, Markót MC (2000) Multisection in Interval Branch-and-Bound Methods for Global Optimization I. Theoretical Results. J Global Optim 16:371–392

    MathSciNet  MATH  Google Scholar 

  6. Csendes T (2001) New subinterval selection criteria for interval global optimization. J Global Optim 19:307–327

    MathSciNet  MATH  Google Scholar 

  7. Csendes T (2003) Numerical experiences with a new generalized subinterval selection criterion for interval global optimization. Reliab Comput 9:109–125

    MATH  Google Scholar 

  8. Csendes T (2004) Generalized subinterval selection criteria for interval global optimization. Numer Algorithms 37:93–100

    MathSciNet  MATH  Google Scholar 

  9. Kreinovich V, Csendes T (2001) Theoretical Justification of a Heuristic Subbox Selection Criterion for Interval Global Optimization. CEJOR 9:255–265

    MathSciNet  MATH  Google Scholar 

  10. Markót MC, Csendes T, Csallner AE (2000) Multisection in Interval Branch-and-Bound Methods for Global Optimization II. Numerical Tests. J Global Optim 16:219–228

    MathSciNet  MATH  Google Scholar 

  11. Markót MC, Fernandez J, Casado LG, Csendes T (2006) New interval methods for constrained global optimization. Math Programm 106:287–318

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Csendes, T. (2008). Algorithmic Improvements Using a Heuristic Parameter, Reject Index for Interval Optimization . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_8

Download citation

Publish with us

Policies and ethics