IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v14y2017i2d10.1007_s10287-016-0269-y.html
   My bibliography  Save this article

Erratum to: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study

Author

Listed:
  • Andreas Bärmann

    (Lehrstuhl für Wirtschaftsmathematik, FAU Erlangen-Nürnberg)

  • Andreas Heidt

    (Lehrstuhl für Wirtschaftsmathematik, FAU Erlangen-Nürnberg)

  • Alexander Martin

    (Lehrstuhl für Wirtschaftsmathematik, FAU Erlangen-Nürnberg)

  • Sebastian Pokutta

    (Georgia Institute of Technology)

  • Christoph Thurner

    (Lehrstuhl für Wirtschaftsmathematik, FAU Erlangen-Nürnberg)

Abstract

No abstract is available for this item.

Suggested Citation

  • Andreas Bärmann & Andreas Heidt & Alexander Martin & Sebastian Pokutta & Christoph Thurner, 2017. "Erratum to: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study," Computational Management Science, Springer, vol. 14(2), pages 293-296, April.
    • Handle: RePEc:spr:comgts:v:14:y:2017:i:2:d:10.1007_s10287-016-0269-y
    DOI: 10.1007/s10287-016-0269-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-016-0269-y
    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/s10287-016-0269-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. Andreas Bärmann & Andreas Heidt & Alexander Martin & Sebastian Pokutta & Christoph Thurner, 2016. "Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study," Computational Management Science, Springer, vol. 13(2), pages 151-193, April.
    2. Aharon Ben-Tal & Arkadi Nemirovski, 2001. "On Polyhedral Approximations of the Second-Order Cone," Mathematics of Operations Research, INFORMS, vol. 26(2), pages 193-205, 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. Bostan, Alireza & Nazar, Mehrdad Setayesh & Shafie-khah, Miadreza & Catalão, João P.S., 2020. "Optimal scheduling of distribution systems considering multiple downward energy hubs and demand response programs," Energy, Elsevier, vol. 190(C).
    2. Duarte, Belmiro P.M. & Sagnol, Guillaume & Wong, Weng Kee, 2018. "An algorithm based on semidefinite programming for finding minimax optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 119(C), pages 99-117.
    3. Michele Conforti & Gérard Cornuéjols & Giacomo Zambelli, 2013. "Extended formulations in combinatorial optimization," Annals of Operations Research, Springer, vol. 204(1), pages 97-143, April.
    4. Erfan Mehmanchi & Andrés Gómez & Oleg A. Prokopyev, 2019. "Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations," Journal of Global Optimization, Springer, vol. 75(2), pages 273-339, October.
    5. GILLIS, Nicolas & GLINEUR, François, 2010. "On the geometric interpretation of the nonnegative rank," LIDAM Discussion Papers CORE 2010051, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Schmaltz, Christian & Pokutta, Sebastian & Heidorn, Thomas & Andrae, Silvio, 2014. "How to make regulators and shareholders happy under Basel III," Journal of Banking & Finance, Elsevier, vol. 46(C), pages 311-325.
    7. Bitencourt, Leonardo & Dias, Bruno & Soares, Tiago & Borba, Bruno & Quirós-Tortós, Jairo, 2023. "e-Carsharing siting and sizing DLMP-based under demand uncertainty," Applied Energy, Elsevier, vol. 330(PB).
    8. Mohammad R. Oskoorouchi & Hamid R. Ghaffari & Tamás Terlaky & Dionne M. Aleman, 2011. "An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application," Operations Research, INFORMS, vol. 59(5), pages 1184-1197, October.
    9. Gillis, Nicolas & Glineur, François & Tuyttens, Daniel & Vandaele, Arnaud, 2015. "Heuristics for exact nonnegative matrix factorization," LIDAM Discussion Papers CORE 2015006, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    10. Andreas Bärmann & Andreas Heidt & Alexander Martin & Sebastian Pokutta & Christoph Thurner, 2016. "Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study," Computational Management Science, Springer, vol. 13(2), pages 151-193, April.
    11. Li, Junkai & Ge, Shaoyun & Zhang, Shida & Xu, Zhengyang & Wang, Liyong & Wang, Chengshan & Liu, Hong, 2022. "A multi-objective stochastic-information gap decision model for soft open points planning considering power fluctuation and growth uncertainty," Applied Energy, Elsevier, vol. 317(C).
    12. Hamza Fawzi & James Saunderson & Pablo A. Parrilo, 2017. "Equivariant Semidefinite Lifts of Regular Polygons," Mathematics of Operations Research, INFORMS, vol. 42(2), pages 472-494, May.
    13. Alper Atamtürk & Andrés Gómez, 2020. "Submodularity in Conic Quadratic Mixed 0–1 Optimization," Operations Research, INFORMS, vol. 68(2), pages 609-630, March.
    14. Gábor Braun & Samuel Fiorini & Sebastian Pokutta & David Steurer, 2015. "Approximation Limits of Linear Programs (Beyond Hierarchies)," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 756-772, March.
    15. Guanglei Wang & Hassan Hijazi, 2018. "Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches," Computational Optimization and Applications, Springer, vol. 71(2), pages 553-608, November.
    16. Armin Fügenschuh & Henning Homfeld & Hanno Schülldorf, 2015. "Single-Car Routing in Rail Freight Transport," Transportation Science, INFORMS, vol. 49(1), pages 130-148, February.
    17. João Gouveia & Pablo A. Parrilo & Rekha R. Thomas, 2013. "Lifts of Convex Sets and Cone Factorizations," Mathematics of Operations Research, INFORMS, vol. 38(2), pages 248-264, May.
    18. Krokhmal, Pavlo A. & Soberanis, Policarpio, 2010. "Risk optimization with p-order conic constraints: A linear programming approach," European Journal of Operational Research, Elsevier, vol. 201(3), pages 653-671, March.
    19. Gopalswamy, Karthick & Uzsoy, Reha, 2021. "Conic programming models for production planning with clearing functions: Formulations and duality," European Journal of Operational Research, Elsevier, vol. 292(3), pages 953-966.
    20. Jean-Thomas Camino & Christian Artigues & Laurent Houssin & Stéphane Mourgues, 2019. "Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design," Computational Optimization and Applications, Springer, vol. 73(2), pages 679-705, June.

    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:comgts:v:14:y:2017:i:2:d:10.1007_s10287-016-0269-y. 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.