IDEAS home Printed from https://ideas.repec.org/a/spr/binfse/v60y2018i5d10.1007_s12599-018-0549-x.html
   My bibliography  Save this article

Call for Papers Issue 1/2020

Author

Listed:
  • Guido Schryen

    (Universität Paderborn)

  • Natalia Kliewer

    (Freie Universität Berlin)

  • Andreas Fink

    (Helmut-Schmidt-Universität Hamburg)

Abstract

No abstract is available for this item.

Suggested Citation

  • Guido Schryen & Natalia Kliewer & Andreas Fink, 2018. "Call for Papers Issue 1/2020," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 60(5), pages 439-440, October.
    • Handle: RePEc:spr:binfse:v:60:y:2018:i:5:d:10.1007_s12599-018-0549-x
    DOI: 10.1007/s12599-018-0549-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12599-018-0549-x
    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/s12599-018-0549-x?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. Aldasoro, Unai & Escudero, Laureano F. & Merino, María & Pérez, Gloria, 2017. "A parallel Branch-and-Fix Coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0–1 problems," European Journal of Operational Research, Elsevier, vol. 258(2), pages 590-606.
    2. Bernard Gendron & Teodor Gabriel Crainic, 1994. "Parallel Branch-and-Branch Algorithms: Survey and Synthesis," Operations Research, INFORMS, vol. 42(6), pages 1042-1066, December.
    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. Schryen, Guido, 2020. "Parallel computational optimization in operations research: A new integrative framework, literature review and research directions," European Journal of Operational Research, Elsevier, vol. 287(1), pages 1-18.
    2. Guido Schryen & Natalia Kliewer & Andreas Fink, 2020. "High Performance Business Computing," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 62(1), pages 1-3, February.
    3. Unai Aldasoro & María Merino & Gloria Pérez, 2019. "Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic," Annals of Operations Research, Springer, vol. 280(1), pages 151-187, September.
    4. Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
    5. Y. Xu & T. K. Ralphs & L. Ladányi & M. J. Saltzman, 2009. "Computational Experience with a Software Framework for Parallel Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 383-397, August.
    6. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    7. Julius Žilinskas, 2012. "Parallel branch and bound for multidimensional scaling with city-block distances," Journal of Global Optimization, Springer, vol. 54(2), pages 261-274, October.
    8. Eva K. Lee, 2004. "Generating Cutting Planes for Mixed Integer Programming Problems in a Parallel Computing Environment," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 3-26, February.
    9. Stripinis, Linas & Žilinskas, Julius & Casado, Leocadio G. & Paulavičius, Remigijus, 2021. "On MATLAB experience in accelerating DIRECT-GLce algorithm for constrained global optimization through dynamic data structures and parallelization," Applied Mathematics and Computation, Elsevier, vol. 390(C).
    10. Juan F. R. Herrera & José M. G. Salmerón & Eligius M. T. Hendrix & Rafael Asenjo & Leocadio G. Casado, 2017. "On parallel Branch and Bound frameworks for Global Optimization," Journal of Global Optimization, Springer, vol. 69(3), pages 547-560, November.
    11. Le‐Yu Chen & Sokbae Lee, 2018. "Exact computation of GMM estimators for instrumental variable quantile regression models," Journal of Applied Econometrics, John Wiley & Sons, Ltd., vol. 33(4), pages 553-567, June.
    12. Escudero, Laureano F. & Monge, Juan F. & Rodríguez-Chía, Antonio M., 2020. "On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty," European Journal of Operational Research, Elsevier, vol. 287(1), pages 262-279.
    13. Mhand Hifi & Toufik Saadi, 2012. "A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems," Computational Optimization and Applications, Springer, vol. 51(2), pages 783-807, March.
    14. Lahrichi, Nadia & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter & Crişan, Gloria Cerasela & Vidal, Thibaut, 2015. "An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: Application to the MDPVRP," European Journal of Operational Research, Elsevier, vol. 246(2), pages 400-412.
    15. Charlotte Truchet & Alejandro Arbelaez & Florian Richoux & Philippe Codognet, 2016. "Estimating parallel runtimes for randomized algorithms in constraint solving," Journal of Heuristics, Springer, vol. 22(4), pages 613-648, August.
    16. Cadarso, Luis & Escudero, Laureano F. & Marín, Angel, 2018. "On strategic multistage operational two-stage stochastic 0–1 optimization for the Rapid Transit Network Design problem," European Journal of Operational Research, Elsevier, vol. 271(2), pages 577-593.
    17. Ellis L. Johnson & George L. Nemhauser & Martin W.P. Savelsbergh, 2000. "Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 2-23, February.
    18. Jan Gmys, 2022. "Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2502-2522, September.
    19. Michael R. Bussieck & Michael C. Ferris & Alexander Meeraus, 2009. "Grid-Enabled Optimization with GAMS," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 349-362, August.
    20. Iturriaga, E. & Aldasoro, U. & Terés-Zubiaga, J. & Campos-Celador, A., 2018. "Optimal renovation of buildings towards the nearly Zero Energy Building standard," Energy, Elsevier, vol. 160(C), pages 1101-1114.

    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:binfse:v:60:y:2018:i:5:d:10.1007_s12599-018-0549-x. 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.