Special issue on: Computational discrete optimization Arie M. C. A. KosterClemens Thielen Editorial Open access 21 October 2020 Pages: 201 - 203
Two-row and two-column mixed-integer presolve using hashing-based pairing methods Patrick GemanderWei-Kun ChenAlexander Martin Original Paper Open access 18 August 2020 Pages: 205 - 240
The complete vertex p-center problem F. Antonio Medrano Original Paper 05 August 2020 Pages: 327 - 343
An exploratory computational analysis of dual degeneracy in mixed-integer programming Gerald GamrathTimo BertholdDomenico Salvagnin Original Paper Open access 01 August 2020 Pages: 241 - 261
A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber Heiner AckermannErik Diessel Original Paper Open access 12 July 2020 Pages: 263 - 288
An exact approach for the multi-constraint graph partitioning problem Diego RecaldeRamiro TorresPolo Vaca Original Paper 17 June 2020 Pages: 289 - 308
Computing Euclidean Steiner trees over segments Ernst AlthausFelix RauterbergSarah Ziegler Original Paper Open access 11 June 2020 Pages: 309 - 325
A robust p-Center problem under pressure to locate shelters in wildfire context Marc DemangeVirginie GabrelCécile Murat Original Paper 23 May 2020 Pages: 103 - 139
On conditional cuts for stochastic dual dynamic programming W. van AckooijX. Warin Original Paper 30 March 2020 Pages: 173 - 199
Special issue on bilevel optimization Luce BrotcorneBernard FortzMartine Labbé Editorial 13 March 2020 Pages: 1 - 2
A distributionally robust optimization approach for two-stage facility location problems Arash GourtaniTri-Dung NguyenHuifu Xu Original Paper Open access 04 February 2020 Pages: 141 - 172
Joint location and pricing within a user-optimized environment Teodora DanAndrea LodiPatrice Marcotte Original Paper 24 September 2019 Pages: 61 - 84
Learning to steer nonlinear interior-point methods Renke Kuhlmann Original Paper 19 August 2019 Pages: 381 - 419
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 Jean-Pierre DussaultMathieu FrappierJean Charles Gilbert Original Paper 16 August 2019 Pages: 359 - 380
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers Dalia AttiaReinhard BürgyFrançois Soumis Original Paper 10 August 2019 Pages: 325 - 357
\(\varepsilon \)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario Vladimir BeresnevAndrey Melnikov Original Paper 06 July 2019 Pages: 33 - 59
Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent Wei JiangSauleh Siddiqui Original Paper 19 June 2019 Pages: 85 - 101
Complementarity-based nonlinear programming techniques for optimal mixing in gas networks Falk M. HanteMartin Schmidt Original Paper 21 May 2019 Pages: 299 - 323
Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games Nicola BasilicoStefano ConiglioAlberto Marchesi Original Paper Open access 18 May 2019 Pages: 3 - 31
Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers François ClautiauxRuslan SadykovQuentin Viaud Original Paper 10 May 2019 Pages: 265 - 297
A branch-and-cut algorithm for the target visitation problem Achim Hildenbrandt Original Paper 27 April 2019 Pages: 209 - 242
Improving the linear relaxation of maximum k-cut with semidefinite-based constraints Vilmar Jefté Rodrigues de SousaMiguel F. AnjosSébastien Le Digabel Original Paper 16 March 2019 Pages: 123 - 151
Ten years of feasibility pump, and counting Timo BertholdAndrea LodiDomenico Salvagnin Review 29 November 2018 Pages: 1 - 14
Real-time algorithms for the bilevel double-deck elevator dispatching problem Janne Sorsa Original Paper 13 November 2018 Pages: 79 - 122
Formulations and algorithms for the recoverable \({\varGamma }\)-robust knapsack problem Christina BüsingSebastian GoderbauerManuel Kutschka Original Paper 30 October 2018 Pages: 15 - 45
Integration of routing into a resource-constrained project scheduling problem Philippe LacommeAziz MoukrimMarina Vinot Original Paper 23 October 2018 Pages: 421 - 464
An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in \(\mathbb {R}^n\) Cláudio P. SantiagoSérgio Assunção MonteiroMaria Helena Jardim Original Paper 16 October 2018 Pages: 177 - 207
Robust bilateral trade with discrete types Kamyar KargarHalil Ibrahim BayrakMustafa Çelebi Pinar Original Paper 12 October 2018 Pages: 367 - 393
Robust combinatorial optimization under convex and discrete cost uncertainty Christoph BuchheimJannis Kurtz Original Paper 05 September 2018 Pages: 211 - 238
Special issue on: robust combinatorial optimization Arie M. C. A. KosterMichael Poss Editorial 05 September 2018 Pages: 207 - 209
Alternative SDP and SOCP approximations for polynomial optimization Xiaolong KuangBissan GhaddarLuis F. Zuluaga Original Paper 13 August 2018 Pages: 153 - 175
A robust basic cyclic scheduling problem Idir HamazLaurent HoussinSonia Cafieri Original Paper 30 July 2018 Pages: 291 - 313
A polyhedral approach to the generalized minimum labeling spanning tree problem Thiago Gouveia da SilvaSerigne GueyeLucídio dos Anjos Formiga Cabral Original Paper 04 June 2018 Pages: 47 - 77
Improved integral simplex using decomposition for the set partitioning problem Abdelouahab ZaghroutiIssmail El HallaouiFrançois Soumis Original Paper 18 May 2018 Pages: 185 - 206
Robust combinatorial optimization under budgeted–ellipsoidal uncertainty Jannis Kurtz Original Paper 08 May 2018 Pages: 315 - 337
Core group placement: allocation and provisioning of heterogeneous resources Serdar Kadıoğlu Original Paper 16 April 2018 Pages: 243 - 264
Portfolio optimization with pw-robustness Virginie GabrelCécile MuratAurélie Thiele Original Paper 10 April 2018 Pages: 267 - 290
Robust balanced optimization Annette M. C. FickerFrits C. R. SpieksmaGerhard J. Woeginger Original Paper 12 February 2018 Pages: 239 - 266
Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation Christina BüsingSigrid KnustXuan Thanh Le Original Paper 12 February 2018 Pages: 339 - 365
Multipolar robust optimization Walid Ben-AmeurAdam OuorouMateusz Żotkiewicz Original Paper 13 December 2017 Pages: 395 - 434
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design Mervat ChoumanTeodor Gabriel CrainicBernard Gendron Original Paper 13 November 2017 Pages: 143 - 184
Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective Christian ArtiguesNicolas JozefowiezBoadu M. Sarpong Original Paper 02 November 2017 Pages: 117 - 142
New exact solution approaches for the split delivery vehicle routing problem Gizem OzbayginOya KarasanHande Yaman Original Paper 13 September 2017 Pages: 85 - 115
Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming Dimitri J. PapageorgiouFrancisco Trespalacios Original Paper 26 July 2017 Pages: 55 - 83
Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems Mario LevoratoRosa FigueiredoLúcia Drummond Erratum 19 July 2017 Pages: 499 - 499
A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights Anjulika GuptaPrabha SharmaHemant Salwan Original Paper 15 May 2017 Pages: 29 - 54
Another pedagogy for mixed-integer Gomory Jon LeeAngelika Wiegele Original Paper 05 April 2017 Pages: 455 - 466
An improved cut-and-solve algorithm for the single-source capacitated facility location problem Sune Lauth GadegaardAndreas KloseLars Relund Nielsen Original Paper 05 April 2017 Pages: 1 - 27
Special issue on: Nonlinear and combinatorial methods for energy optimization Claudia D’AmbrosioAntonio FrangioniMartin Mevissen Preface 21 February 2017 Pages: 1 - 3
On the construction of quadratic models for derivative-free trust-region algorithms Adriano VerdérioElizabeth W. KarasKatya Scheinberg Original Paper 09 February 2017 Pages: 501 - 527
