IDEAS home Printed from https://ideas.repec.org/a/spr/eurjco/v4y2016i2d10.1007_s13675-016-0068-9.html
   My bibliography  Save this article

Editorial

Author

Listed:
  • Bernard Fortz

    (Université Libre de Bruxelles
    INOCS, INRIA Lille Nord-Europe)

  • Luís Gouveia

    (Faculdade de Ciências da Universidade de Lisboa)

Abstract

No abstract is available for this item.

Suggested Citation

  • Bernard Fortz & Luís Gouveia, 2016. "Editorial," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(2), pages 123-124, May.
    • Handle: RePEc:spr:eurjco:v:4:y:2016:i:2:d:10.1007_s13675-016-0068-9
    DOI: 10.1007/s13675-016-0068-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13675-016-0068-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13675-016-0068-9?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. J.-Ch. Grégoire & Angèle M. Hamel, 2016. "Models for video-on-demand scheduling with costs," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(2), pages 125-135, May.
    2. Phuoc Hoang Le & Tri-Dung Nguyen & Tolga Bektaş, 2016. "Generalized minimum spanning tree games," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(2), pages 167-188, May.
    3. Alessandro Hill & Stefan Voß, 2016. "Optimal capacitated ring trees," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(2), pages 137-166, May.
    4. Amaro Sousa & Carlos Borges Lopes & Paulo Monteiro, 2016. "Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(2), pages 189-213, May.
    Full references (including those not matched with items on IDEAS)

    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. Anupam Mukherjee & Partha Sarathi Barma & Joydeep Dutta & Goutam Panigrahi & Samarjit Kar & Manoranjan Maiti, 2022. "A multi-objective antlion optimizer for the ring tree problem with secondary sub-depots," Operational Research, Springer, vol. 22(3), pages 1813-1851, July.
    2. Newbery, David, 2018. "Shifting demand and supply over time and space to manage intermittent generation: The economics of electrical storage," Energy Policy, Elsevier, vol. 113(C), pages 711-720.
    3. Alessandro Hill & Roberto Baldacci & Edna Ayako Hoshino, 2019. "Capacitated ring arborescence problems with profits," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 357-389, June.
    4. Baldacci, Roberto & Hill, Alessandro & Hoshino, Edna A. & Lim, Andrew, 2017. "Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms," European Journal of Operational Research, Elsevier, vol. 262(3), pages 879-893.
    5. Baldacci, Roberto & Hoshino, Edna A. & Hill, Alessandro, 2023. "New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems," European Journal of Operational Research, Elsevier, vol. 307(2), pages 538-553.

    More about this item

    Statistics

    Access and download statistics

    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:eurjco:v:4:y:2016:i:2:d:10.1007_s13675-016-0068-9. 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.