EURO Journal on Computational Optimization

2016 - 2020

Current editor(s): Martine C. Labbé

From:
Springer
EURO - The Association of European Operational Research Societies
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 8, issue 3, 2020

Special issue on: Computational discrete optimization pp. 201-203

Arie M. C. A. Koster and Clemens Thielen

Two-row and two-column mixed-integer presolve using hashing-based pairing methods pp. 205-240

Patrick Gemander, Wei-Kun Chen, Dieter Weninger, Leona Gottwald, Ambros Gleixner and Alexander Martin

An exploratory computational analysis of dual degeneracy in mixed-integer programming pp. 241-261

Gerald Gamrath, Timo Berthold and Domenico Salvagnin

A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber pp. 263-288

Heiner Ackermann and Erik Diessel

An exact approach for the multi-constraint graph partitioning problem pp. 289-308

Diego Recalde, Ramiro Torres and Polo Vaca

Computing Euclidean Steiner trees over segments pp. 309-325

Ernst Althaus, Felix Rauterberg and Sarah Ziegler

The complete vertex p-center problem pp. 327-343

F. Antonio Medrano

Volume 8, issue 2, 2020

A robust p-Center problem under pressure to locate shelters in wildfire context pp. 103-139

Marc Demange, Virginie Gabrel, Marcel A. Haddad and Cécile Murat

A distributionally robust optimization approach for two-stage facility location problems pp. 141-172

Arash Gourtani, Tri-Dung Nguyen and Huifu Xu

On conditional cuts for stochastic dual dynamic programming pp. 173-199

W. Ackooij and X. Warin

Volume 8, issue 1, 2020

Special issue on bilevel optimization pp. 1-2

Luce Brotcorne, Bernard Fortz and Martine Labbé

Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games pp. 3-31

Nicola Basilico, Stefano Coniglio, Nicola Gatti and Alberto Marchesi

$$\varepsilon $$ε-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario pp. 33-59

Vladimir Beresnev and Andrey Melnikov

Joint location and pricing within a user-optimized environment pp. 61-84

Teodora Dan, Andrea Lodi and Patrice Marcotte

Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent pp. 85-101

Wei Jiang and Sauleh Siddiqui

Volume 7, issue 4, 2019

A decomposition-based heuristic for large employee scheduling problems with inter-department transfers pp. 325-357

Dalia Attia, Reinhard Bürgy, Guy Desaulniers and François Soumis

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 pp. 359-380

Jean-Pierre Dussault, Mathieu Frappier and Jean Charles Gilbert

Learning to steer nonlinear interior-point methods pp. 381-419

Renke Kuhlmann

Integration of routing into a resource-constrained project scheduling problem pp. 421-464

Philippe Lacomme, Aziz Moukrim, Alain Quilliot and Marina Vinot

Volume 7, issue 3, 2019

A branch-and-cut algorithm for the target visitation problem pp. 209-242

Achim Hildenbrandt

Core group placement: allocation and provisioning of heterogeneous resources pp. 243-264

Serdar Kadıoğlu

Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers pp. 265-297

François Clautiaux, Ruslan Sadykov, François Vanderbeck and Quentin Viaud

Complementarity-based nonlinear programming techniques for optimal mixing in gas networks pp. 299-323

Falk M. Hante and Martin Schmidt

Volume 7, issue 2, 2019

Improving the linear relaxation of maximum k-cut with semidefinite-based constraints pp. 123-151

Vilmar Jefté Rodrigues de Sousa, Miguel F. Anjos and Sébastien Le Digabel

Alternative SDP and SOCP approximations for polynomial optimization pp. 153-175

Xiaolong Kuang, Bissan Ghaddar, Joe Naoum-Sawaya and Luis F. Zuluaga

An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in $$\mathbb {R}^n$$ R n pp. 177-207

Cláudio P. Santiago, Sérgio Assunção Monteiro, Helder Inácio, Nelson Maculan and Maria Helena Jardim

Volume 7, issue 1, 2019

Ten years of feasibility pump, and counting pp. 1-14

Timo Berthold, Andrea Lodi and Domenico Salvagnin

Formulations and algorithms for the recoverable $${\varGamma }$$ Γ -robust knapsack problem pp. 15-45

Christina Büsing, Sebastian Goderbauer, Arie M. C. A. Koster and Manuel Kutschka

A polyhedral approach to the generalized minimum labeling spanning tree problem pp. 47-77

Thiago Gouveia da Silva, Serigne Gueye, Philippe Michelon, Luiz Satoru Ochi and Lucídio dos Anjos Formiga Cabral

Real-time algorithms for the bilevel double-deck elevator dispatching problem pp. 79-122

Janne Sorsa

Volume 6, issue 4, 2018

Robust combinatorial optimization under budgeted–ellipsoidal uncertainty pp. 315-337

Jannis Kurtz

Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation pp. 339-365

Christina Büsing, Sigrid Knust and Xuan Thanh Le

Robust bilateral trade with discrete types pp. 367-393

Kamyar Kargar, Halil Ibrahim Bayrak and Mustafa Çelebi Pinar

Multipolar robust optimization pp. 395-434

Walid Ben-Ameur, Adam Ouorou, Guanglei Wang and Mateusz Żotkiewicz

Volume 6, issue 3, 2018

Special issue on: robust combinatorial optimization pp. 207-209

Arie M. C. A. Koster and Michael Poss

Robust combinatorial optimization under convex and discrete cost uncertainty pp. 211-238

Christoph Buchheim and Jannis Kurtz

Robust balanced optimization pp. 239-266

Annette M. C. Ficker, Frits C. R. Spieksma and Gerhard J. Woeginger

Portfolio optimization with pw-robustness pp. 267-290

Virginie Gabrel, Cécile Murat and Aurélie Thiele

A robust basic cyclic scheduling problem pp. 291-313

Idir Hamaz, Laurent Houssin and Sonia Cafieri

Volume 6, issue 2, 2018

Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective pp. 117-142

Christian Artigues, Nicolas Jozefowiez and Boadu M. Sarpong

The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design pp. 143-184

Mervat Chouman, Teodor Gabriel Crainic and Bernard Gendron

Improved integral simplex using decomposition for the set partitioning problem pp. 185-206

Abdelouahab Zaghrouti, Issmail El Hallaoui and François Soumis

Volume 6, issue 1, 2018

An improved cut-and-solve algorithm for the single-source capacitated facility location problem pp. 1-27

Sune Lauth Gadegaard, Andreas Klose and Lars Relund Nielsen

A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights pp. 29-54

Anjulika Gupta, Prabha Sharma and Hemant Salwan

Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming pp. 55-83

Dimitri J. Papageorgiou and Francisco Trespalacios

New exact solution approaches for the split delivery vehicle routing problem pp. 85-115

Gizem Ozbaygin, Oya Karasan and Hande Yaman

Volume 5, issue 4, 2017

Another pedagogy for mixed-integer Gomory pp. 455-466

Jon Lee and Angelika Wiegele

Evaluating balancing on social networks through the efficient solution of correlation clustering problems pp. 467-498

Mario Levorato, Rosa Figueiredo, Yuri Frota and Lúcia Drummond

Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems pp. 499-499

Mario Levorato, Rosa Figueiredo, Yuri Frota and Lúcia Drummond

On the construction of quadratic models for derivative-free trust-region algorithms pp. 501-527

Adriano Verdério, Elizabeth W. Karas, Lucas G. Pedroso and Katya Scheinberg

Nonsmooth spectral gradient methods for unconstrained optimization pp. 529-553

Milagros Loreto, Hugo Aponte, Debora Cores and Marcos Raydan

Volume 5, issue 3, 2017

On global optimization with indefinite quadratics pp. 309-337

Marcia Fampa, Jon Lee and Wendel Melo

Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem pp. 339-365

Thais Ávila, Ángel Corberán, Isaac Plana and José M. Sanchis

Matheuristics for optimizing the network in German wagonload traffic pp. 367-392

Julia Sender, Thomas Siwczyk, Petra Mutzel and Uwe Clausen

A unified matheuristic for solving multi-constrained traveling salesman problems with profits pp. 393-422

Rahma Lahyani, Mahdi Khemakhem and Frédéric Semet

Variable neighborhood search: basics and variants pp. 423-454

Pierre Hansen, Nenad Mladenović, Raca Todosijević and Saïd Hanafi

Volume 5, issue 1, 2017

Special issue on: Nonlinear and combinatorial methods for energy optimization pp. 1-3

Claudia D’Ambrosio, Antonio Frangioni, Andrea Lodi and Martin Mevissen

Uncontrolled inexact information within bundle methods pp. 5-29

Jérôme Malick, Welington Oliveira and Sofia Zaourar

A multiplicative weights update algorithm for MINLP pp. 31-86

Luca Mencarelli, Youcef Sahraoui and Leo Liberti

A bounded degree SOS hierarchy for polynomial optimization pp. 87-117

Jean B. Lasserre, Kim-Chuan Toh and Shouguang Yang

A comparison of four approaches from stochastic programming for large-scale unit-commitment pp. 119-147

Wim Ackooij

Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints pp. 149-176

Nicolas Dupin

A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints pp. 177-201

C. Gentile, G. Morales-España and A. Ramos

The summed start-up costs in a unit commitment problem pp. 203-238

René Brandenberg, Matthias Huber and Matthias Silbernagl

Sufficient pruning conditions for MINLP in gas network design pp. 239-261

Jesco Humpola and Felipe Serrano

A MIP framework for non-convex uniform price day-ahead electricity auctions pp. 263-284

Mehdi Madani and Mathieu Van Vyve

Multi-machine energy-aware scheduling pp. 285-307

David Van Den Dooren, Thomas Sys, Túlio A. M. Toffolo, Tony Wauters and Greet Vanden Berghe