Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/ejco/AttiaBDS19,
  author       = {Dalia Attia and
                  Reinhard B{\"{u}}rgy and
                  Guy Desaulniers and
                  Fran{\c{c}}ois Soumis},
  title        = {A decomposition-based heuristic for large employee scheduling problems
                  with inter-department transfers},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {4},
  pages        = {325--357},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-019-00119-3},
  doi          = {10.1007/S13675-019-00119-3},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/AttiaBDS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/Berthold0S19,
  author       = {Timo Berthold and
                  Andrea Lodi and
                  Domenico Salvagnin},
  title        = {Ten years of feasibility pump, and counting},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {1},
  pages        = {1--14},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-018-0109-7},
  doi          = {10.1007/S13675-018-0109-7},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/Berthold0S19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/BusingGKK19,
  author       = {Christina B{\"{u}}sing and
                  Sebastian Goderbauer and
                  Arie M. C. A. Koster and
                  Manuel Kutschka},
  title        = {Formulations and algorithms for the recoverable {\(\Gamma\)}-robust
                  knapsack problem},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {1},
  pages        = {15--45},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-018-0107-9},
  doi          = {10.1007/S13675-018-0107-9},
  timestamp    = {Tue, 16 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/BusingGKK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/ClautiauxSVV19,
  author       = {Fran{\c{c}}ois Clautiaux and
                  Ruslan Sadykov and
                  Fran{\c{c}}ois Vanderbeck and
                  Quentin Viaud},
  title        = {Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock
                  problem with leftovers},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {3},
  pages        = {265--297},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-019-00113-9},
  doi          = {10.1007/S13675-019-00113-9},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/ClautiauxSVV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/DussaultFG19,
  author       = {Jean{-}Pierre Dussault and
                  Mathieu Frappier and
                  Jean Charles Gilbert},
  title        = {A lower bound on the iterative complexity of the Harker and Pang globalization
                  technique of the Newton-min algorithm for solving the linear complementarity
                  problem},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {4},
  pages        = {359--380},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-019-00116-6},
  doi          = {10.1007/S13675-019-00116-6},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/DussaultFG19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/HanteS19,
  author       = {Falk M. Hante and
                  Martin Schmidt},
  title        = {Complementarity-based nonlinear programming techniques for optimal
                  mixing in gas networks},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {3},
  pages        = {299--323},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-019-00112-w},
  doi          = {10.1007/S13675-019-00112-W},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/HanteS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/Hildenbrandt19,
  author       = {Achim Hildenbrandt},
  title        = {A branch-and-cut algorithm for the target visitation problem},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {3},
  pages        = {209--242},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-019-00111-x},
  doi          = {10.1007/S13675-019-00111-X},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/Hildenbrandt19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/Kadioglu19,
  author       = {Serdar Kadioglu},
  title        = {Core group placement: allocation and provisioning of heterogeneous
                  resources},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {3},
  pages        = {243--264},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-018-0095-9},
  doi          = {10.1007/S13675-018-0095-9},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/Kadioglu19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/KuangGNZ19,
  author       = {Xiaolong Kuang and
                  Bissan Ghaddar and
                  Joe Naoum{-}Sawaya and
                  Luis F. Zuluaga},
  title        = {Alternative {SDP} and {SOCP} approximations for polynomial optimization},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {2},
  pages        = {153--175},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-018-0101-2},
  doi          = {10.1007/S13675-018-0101-2},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejco/KuangGNZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/Kuhlmann19,
  author       = {Renke Kuhlmann},
  title        = {Learning to steer nonlinear interior-point methods},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {4},
  pages        = {381--419},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-019-00118-4},
  doi          = {10.1007/S13675-019-00118-4},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/Kuhlmann19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/LacommeMQV19,
  author       = {Philippe Lacomme and
                  Aziz Moukrim and
                  Alain Quilliot and
                  Marina Vinot},
  title        = {Integration of routing into a resource-constrained project scheduling
                  problem},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {4},
  pages        = {421--464},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-018-0104-z},
  doi          = {10.1007/S13675-018-0104-Z},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/LacommeMQV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/SantiagoMIMJ19,
  author       = {Cl{\'{a}}udio P. Santiago and
                  S{\'{e}}rgio Assun{\c{c}}{\~{a}}o Monteiro and
                  Helder In{\'{a}}cio and
                  Nelson Maculan and
                  Maria Helena Jardim},
  title        = {An efficient algorithm for the projection of a point on the intersection
                  of two hyperplanes and a box in {\textbackslash}({\textbackslash}mathbb
                  \{R\}n{\textbackslash})},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {2},
  pages        = {177--207},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-018-0105-y},
  doi          = {10.1007/S13675-018-0105-Y},
  timestamp    = {Tue, 16 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/SantiagoMIMJ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/SilvaGMOC19,
  author       = {Thiago Gouveia da Silva and
                  Serigne Gueye and
                  Philippe Michelon and
                  Luiz Satoru Ochi and
                  Luc{\'{\i}}dio dos Anjos Formiga Cabral},
  title        = {A polyhedral approach to the generalized minimum labeling spanning
                  tree problem},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {1},
  pages        = {47--77},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-018-0099-5},
  doi          = {10.1007/S13675-018-0099-5},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/SilvaGMOC19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/Sorsa19,
  author       = {Janne Sorsa},
  title        = {Real-time algorithms for the bilevel double-deck elevator dispatching
                  problem},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {1},
  pages        = {79--122},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-018-0108-8},
  doi          = {10.1007/S13675-018-0108-8},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/Sorsa19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejco/SousaAD19,
  author       = {Vilmar Jeft{\'{e}} Rodrigues de Sousa and
                  Miguel F. Anjos and
                  S{\'{e}}bastien Le Digabel},
  title        = {Improving the linear relaxation of maximum \emph{k}-cut with semidefinite-based
                  constraints},
  journal      = {{EURO} J. Comput. Optim.},
  volume       = {7},
  number       = {2},
  pages        = {123--151},
  year         = {2019},
  url          = {https://doi.org/10.1007/s13675-019-00110-y},
  doi          = {10.1007/S13675-019-00110-Y},
  timestamp    = {Mon, 18 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejco/SousaAD19.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.