Search dblp for Publications

export results for "toc:db/journals/ejco/ejco6.bht:"

 download as .bib file

@article{DBLP:journals/ejco/ArtiguesJS18,
  author       = {Christian Artigues and
                  Nicolas Jozefowiez and
                  Boadu Mensah Sarpong},
  title        = {Column generation algorithms for bi-objective combinatorial optimization
                  problems with a min-max objective},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {2},
  pages        = {117--142},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-017-0090-6},
  doi          = {10.1007/S13675-017-0090-6},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/ArtiguesJS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/Ben-AmeurOWZ18,
  author       = {Walid Ben{-}Ameur and
                  Adam Ouorou and
                  Guanglei Wang and
                  Mateusz Zotkiewicz},
  title        = {Multipolar robust optimization},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {4},
  pages        = {395--434},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-017-0092-4},
  doi          = {10.1007/S13675-017-0092-4},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/Ben-AmeurOWZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/BuchheimK18,
  author       = {Christoph Buchheim and
                  Jannis Kurtz},
  title        = {Robust combinatorial optimization under convex and discrete cost uncertainty},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {3},
  pages        = {211--238},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-018-0103-0},
  doi          = {10.1007/S13675-018-0103-0},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/BuchheimK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/BusingKL18,
  author       = {Christina B{\"{u}}sing and
                  Sigrid Knust and
                  Xuan Thanh Le},
  title        = {Trade-off between robustness and cost for a storage loading problem:
                  rule-based scenario generation},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {4},
  pages        = {339--365},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-018-0094-x},
  doi          = {10.1007/S13675-018-0094-X},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/BusingKL18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/ChoumanCG18,
  author       = {Mervat Chouman and
                  Teodor Gabriel Crainic and
                  Bernard Gendron},
  title        = {The impact of filtering in a branch-and-cut algorithm for multicommodity
                  capacitated fixed charge network design},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {2},
  pages        = {143--184},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-017-0091-5},
  doi          = {10.1007/S13675-017-0091-5},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/ChoumanCG18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/FickerSW18,
  author       = {Annette M. C. Ficker and
                  Frits C. R. Spieksma and
                  Gerhard J. Woeginger},
  title        = {Robust balanced optimization},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {3},
  pages        = {239--266},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-018-0093-y},
  doi          = {10.1007/S13675-018-0093-Y},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/FickerSW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/GabrelMT18,
  author       = {Virginie Gabrel and
                  C{\'{e}}cile Murat and
                  Aur{\'{e}}lie Thiele},
  title        = {Portfolio optimization with \emph{pw}-robustness},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {3},
  pages        = {267--290},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-018-0096-8},
  doi          = {10.1007/S13675-018-0096-8},
  timestamp    = {Tue, 16 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/GabrelMT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/GadegaardKN18,
  author       = {Sune Lauth Gadegaard and
                  Andreas Klose and
                  Lars Relund Nielsen},
  title        = {An improved cut-and-solve algorithm for the single-source capacitated
                  facility location problem},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {1},
  pages        = {1--27},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-017-0084-4},
  doi          = {10.1007/S13675-017-0084-4},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/GadegaardKN18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/GuptaSS18,
  author       = {Anjulika Gupta and
                  Prabha Sharma and
                  Hemant Salwan},
  title        = {A local search algorithm: minimizing makespan of deteriorating jobs
                  with relaxed agreeable weights},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {1},
  pages        = {29--54},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-017-0086-2},
  doi          = {10.1007/S13675-017-0086-2},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/GuptaSS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/HamazHC18,
  author       = {Idir Hamaz and
                  Laurent Houssin and
                  Sonia Cafieri},
  title        = {A robust basic cyclic scheduling problem},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {3},
  pages        = {291--313},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-018-0100-3},
  doi          = {10.1007/S13675-018-0100-3},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/HamazHC18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/KargarBP18,
  author       = {Kamyar Kargar and
                  Halil Ibrahim Bayrak and
                  Mustafa {\c{C}}. Pinar},
  title        = {Robust bilateral trade with discrete types},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {4},
  pages        = {367--393},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-018-0106-x},
  doi          = {10.1007/S13675-018-0106-X},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejco/KargarBP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/KosterP18,
  author       = {Arie M. C. A. Koster and
                  Michael Poss},
  title        = {Special issue on: robust combinatorial optimization},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {3},
  pages        = {207--209},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-018-0102-1},
  doi          = {10.1007/S13675-018-0102-1},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/KosterP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/Kurtz18,
  author       = {Jannis Kurtz},
  title        = {Robust combinatorial optimization under budgeted-ellipsoidal uncertainty},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {4},
  pages        = {315--337},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-018-0097-7},
  doi          = {10.1007/S13675-018-0097-7},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/Kurtz18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/OzbayginKY18,
  author       = {Gizem Ozbaygin and
                  Oya Ekin Karasan and
                  Hande Yaman},
  title        = {New exact solution approaches for the split delivery vehicle routing
                  problem},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {1},
  pages        = {85--115},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-017-0089-z},
  doi          = {10.1007/S13675-017-0089-Z},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/OzbayginKY18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/PapageorgiouT18,
  author       = {Dimitri J. Papageorgiou and
                  Francisco Trespalacios},
  title        = {Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition
                  in convex disjunctive programming},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {1},
  pages        = {55--83},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-017-0088-0},
  doi          = {10.1007/S13675-017-0088-0},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/PapageorgiouT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/ZaghroutiHS18,
  author       = {Abdelouahab Zaghrouti and
                  Issmail El Hallaoui and
                  Fran{\c{c}}ois Soumis},
  title        = {Improved integral simplex using decomposition for the set partitioning
                  problem},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {6},
  number       = {2},
  pages        = {185--206},
  year         = {2018},
  url          = {https://doi.org/10.1007/s13675-018-0098-6},
  doi          = {10.1007/S13675-018-0098-6},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/ZaghroutiHS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.