IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v50y2011i4p629-644.html
   My bibliography  Save this article

A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms

Author

Listed:
  • Jordan Ninin
  • Frédéric Messine

Abstract

No abstract is available for this item.

Suggested Citation

  • Jordan Ninin & Frédéric Messine, 2011. "A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms," Journal of Global Optimization, Springer, vol. 50(4), pages 629-644, August.
    • Handle: RePEc:spr:jglopt:v:50:y:2011:i:4:p:629-644
    DOI: 10.1007/s10898-010-9531-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-010-9531-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-010-9531-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Frédéric Messine, 2005. "A Deterministic Global Optimization Algorithm for Design Problems," Springer Books, in: Charles Audet & Pierre Hansen & Gilles Savard (ed.), Essays and Surveys in Global Optimization, chapter 0, pages 267-294, Springer.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bertrand Neveu & Gilles Trombettoni & Ignacio Araya, 2016. "Node selection strategies in interval Branch and Bound algorithms," Journal of Global Optimization, Springer, vol. 64(2), pages 289-304, February.
    2. Ralph Kearfott, 2014. "On rigorous upper bounds to a global optimum," Journal of Global Optimization, Springer, vol. 59(2), pages 459-476, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ignacio Araya & Victor Reyes, 2016. "Interval Branch-and-Bound algorithms for optimization and constraint satisfaction: a survey and prospects," Journal of Global Optimization, Springer, vol. 65(4), pages 837-866, August.
    2. Emilio Carrizosa & Frédéric Messine, 2021. "An interval branch and bound method for global Robust optimization," Journal of Global Optimization, Springer, vol. 80(3), pages 507-522, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:50:y:2011:i:4:p:629-644. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.