Printed from https://ideas.repec.org/s/spr/eurjco.html
Content
October 2020, Volume 8, Issue 3
- 201-203 Special issue on: Computational discrete optimization
by Arie M. C. A. Koster & Clemens Thielen - 205-240 Two-row and two-column mixed-integer presolve using hashing-based pairing methods
by Patrick Gemander & Wei-Kun Chen & Dieter Weninger & Leona Gottwald & Ambros Gleixner & Alexander Martin - 241-261 An exploratory computational analysis of dual degeneracy in mixed-integer programming
by Gerald Gamrath & Timo Berthold & Domenico Salvagnin - 263-288 A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber
by Heiner Ackermann & Erik Diessel - 289-308 An exact approach for the multi-constraint graph partitioning problem
by Diego Recalde & Ramiro Torres & Polo Vaca - 309-325 Computing Euclidean Steiner trees over segments
by Ernst Althaus & Felix Rauterberg & Sarah Ziegler - 327-343 The complete vertex p-center problem
by F. Antonio Medrano
June 2020, Volume 8, Issue 2
- 103-139 A robust p-Center problem under pressure to locate shelters in wildfire context
by Marc Demange & Virginie Gabrel & Marcel A. Haddad & Cécile Murat - 141-172 A distributionally robust optimization approach for two-stage facility location problems
by Arash Gourtani & Tri-Dung Nguyen & Huifu Xu - 173-199 On conditional cuts for stochastic dual dynamic programming
by W. Ackooij & X. Warin
March 2020, Volume 8, Issue 1
- 1-2 Special issue on bilevel optimization
by Luce Brotcorne & Bernard Fortz & Martine Labbé - 3-31 Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games
by Nicola Basilico & Stefano Coniglio & Nicola Gatti & Alberto Marchesi - 33-59 $$\varepsilon $$ε-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
by Vladimir Beresnev & Andrey Melnikov - 61-84 Joint location and pricing within a user-optimized environment
by Teodora Dan & Andrea Lodi & Patrice Marcotte - 85-101 Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent
by Wei Jiang & Sauleh Siddiqui
December 2019, Volume 7, Issue 4
- 325-357 A decomposition-based heuristic for large employee scheduling problems with inter-department transfers
by Dalia Attia & Reinhard Bürgy & Guy Desaulniers & François Soumis - 359-380 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
by Jean-Pierre Dussault & Mathieu Frappier & Jean Charles Gilbert - 381-419 Learning to steer nonlinear interior-point methods
by Renke Kuhlmann - 421-464 Integration of routing into a resource-constrained project scheduling problem
by Philippe Lacomme & Aziz Moukrim & Alain Quilliot & Marina Vinot
September 2019, Volume 7, Issue 3
- 209-242 A branch-and-cut algorithm for the target visitation problem
by Achim Hildenbrandt - 243-264 Core group placement: allocation and provisioning of heterogeneous resources
by Serdar Kadıoğlu - 265-297 Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
by François Clautiaux & Ruslan Sadykov & François Vanderbeck & Quentin Viaud - 299-323 Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
by Falk M. Hante & Martin Schmidt
June 2019, Volume 7, Issue 2
- 123-151 Improving the linear relaxation of maximum k-cut with semidefinite-based constraints
by Vilmar Jefté Rodrigues de Sousa & Miguel F. Anjos & Sébastien Le Digabel - 153-175 Alternative SDP and SOCP approximations for polynomial optimization
by Xiaolong Kuang & Bissan Ghaddar & Joe Naoum-Sawaya & Luis F. Zuluaga - 177-207 An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in $$\mathbb {R}^n$$ R n
by Cláudio P. Santiago & Sérgio Assunção Monteiro & Helder Inácio & Nelson Maculan & Maria Helena Jardim
March 2019, Volume 7, Issue 1
- 1-14 Ten years of feasibility pump, and counting
by Timo Berthold & Andrea Lodi & Domenico Salvagnin - 15-45 Formulations and algorithms for the recoverable $${\varGamma }$$ Γ -robust knapsack problem
by Christina Büsing & Sebastian Goderbauer & Arie M. C. A. Koster & Manuel Kutschka - 47-77 A polyhedral approach to the generalized minimum labeling spanning tree problem
by Thiago Gouveia da Silva & Serigne Gueye & Philippe Michelon & Luiz Satoru Ochi & Lucídio dos Anjos Formiga Cabral - 79-122 Real-time algorithms for the bilevel double-deck elevator dispatching problem
by Janne Sorsa
December 2018, Volume 6, Issue 4
- 315-337 Robust combinatorial optimization under budgeted–ellipsoidal uncertainty
by Jannis Kurtz - 339-365 Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation
by Christina Büsing & Sigrid Knust & Xuan Thanh Le - 367-393 Robust bilateral trade with discrete types
by Kamyar Kargar & Halil Ibrahim Bayrak & Mustafa Çelebi Pinar - 395-434 Multipolar robust optimization
by Walid Ben-Ameur & Adam Ouorou & Guanglei Wang & Mateusz Żotkiewicz
September 2018, Volume 6, Issue 3
- 207-209 Special issue on: robust combinatorial optimization
by Arie M. C. A. Koster & Michael Poss - 211-238 Robust combinatorial optimization under convex and discrete cost uncertainty
by Christoph Buchheim & Jannis Kurtz - 239-266 Robust balanced optimization
by Annette M. C. Ficker & Frits C. R. Spieksma & Gerhard J. Woeginger - 267-290 Portfolio optimization with pw-robustness
by Virginie Gabrel & Cécile Murat & Aurélie Thiele - 291-313 A robust basic cyclic scheduling problem
by Idir Hamaz & Laurent Houssin & Sonia Cafieri
June 2018, Volume 6, Issue 2
- 117-142 Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective
by Christian Artigues & Nicolas Jozefowiez & Boadu M. Sarpong - 143-184 The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
by Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron - 185-206 Improved integral simplex using decomposition for the set partitioning problem
by Abdelouahab Zaghrouti & Issmail El Hallaoui & François Soumis
March 2018, Volume 6, Issue 1
- 1-27 An improved cut-and-solve algorithm for the single-source capacitated facility location problem
by Sune Lauth Gadegaard & Andreas Klose & Lars Relund Nielsen - 29-54 A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights
by Anjulika Gupta & Prabha Sharma & Hemant Salwan - 55-83 Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
by Dimitri J. Papageorgiou & Francisco Trespalacios - 85-115 New exact solution approaches for the split delivery vehicle routing problem
by Gizem Ozbaygin & Oya Karasan & Hande Yaman
December 2017, Volume 5, Issue 4
- 455-466 Another pedagogy for mixed-integer Gomory
by Jon Lee & Angelika Wiegele - 467-498 Evaluating balancing on social networks through the efficient solution of correlation clustering problems
by Mario Levorato & Rosa Figueiredo & Yuri Frota & Lúcia Drummond - 499-499 Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems
by Mario Levorato & Rosa Figueiredo & Yuri Frota & Lúcia Drummond - 501-527 On the construction of quadratic models for derivative-free trust-region algorithms
by Adriano Verdério & Elizabeth W. Karas & Lucas G. Pedroso & Katya Scheinberg - 529-553 Nonsmooth spectral gradient methods for unconstrained optimization
by Milagros Loreto & Hugo Aponte & Debora Cores & Marcos Raydan
September 2017, Volume 5, Issue 3
- 309-337 On global optimization with indefinite quadratics
by Marcia Fampa & Jon Lee & Wendel Melo - 339-365 Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
by Thais Ávila & Ángel Corberán & Isaac Plana & José M. Sanchis - 367-392 Matheuristics for optimizing the network in German wagonload traffic
by Julia Sender & Thomas Siwczyk & Petra Mutzel & Uwe Clausen - 393-422 A unified matheuristic for solving multi-constrained traveling salesman problems with profits
by Rahma Lahyani & Mahdi Khemakhem & Frédéric Semet - 423-454 Variable neighborhood search: basics and variants
by Pierre Hansen & Nenad Mladenović & Raca Todosijević & Saïd Hanafi
March 2017, Volume 5, Issue 1
- 1-3 Special issue on: Nonlinear and combinatorial methods for energy optimization
by Claudia D’Ambrosio & Antonio Frangioni & Andrea Lodi & Martin Mevissen - 5-29 Uncontrolled inexact information within bundle methods
by Jérôme Malick & Welington Oliveira & Sofia Zaourar - 31-86 A multiplicative weights update algorithm for MINLP
by Luca Mencarelli & Youcef Sahraoui & Leo Liberti - 87-117 A bounded degree SOS hierarchy for polynomial optimization
by Jean B. Lasserre & Kim-Chuan Toh & Shouguang Yang - 119-147 A comparison of four approaches from stochastic programming for large-scale unit-commitment
by Wim Ackooij - 149-176 Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
by Nicolas Dupin - 177-201 A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
by C. Gentile & G. Morales-España & A. Ramos - 203-238 The summed start-up costs in a unit commitment problem
by René Brandenberg & Matthias Huber & Matthias Silbernagl - 239-261 Sufficient pruning conditions for MINLP in gas network design
by Jesco Humpola & Felipe Serrano - 263-284 A MIP framework for non-convex uniform price day-ahead electricity auctions
by Mehdi Madani & Mathieu Van Vyve - 285-307 Multi-machine energy-aware scheduling
by David Van Den Dooren & Thomas Sys & Túlio A. M. Toffolo & Tony Wauters & Greet Vanden Berghe
September 2016, Volume 4, Issue 3
- 215-217 SI: disaster risk management
by Marc Goerigk & Horst W. Hamacher - 219-239 Evacuation modeling: a case study on linear and nonlinear network flow models
by Simone Göttlich & Sebastian Kühn & Jan Peter Ohst & Stefan Ruzika - 241-270 Robust flows with losses and improvability in evacuation planning
by Marc Goerigk & Ismaila Abderhamane Ndiaye - 271-298 Network design to anticipate selfish evacuation routing
by A. Kimms & K. Seekircher - 299-323 A multi-period shelter location-allocation model with evacuation orders for flood disasters
by Melissa Gama & Bruno Filipe Santos & Maria Paola Scaparra - 325-347 Sink location to find optimal shelters in evacuation planning
by P. Heßler & H. W. Hamacher - 349-380 Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers
by Jens Poppenborg & Sigrid Knust - 381-402 Road network emergency accessibility planning after a major earthquake
by Celso Satoshi Sakuraba & Andréa Cynthia Santos & Christian Prins & Lucie Bouillot & Arnaud Durand & Bernard Allenbach - 403-445 Solution methodologies for debris removal in disaster response
by Nihal Berktaş & Bahar Yetiş Kara & Oya Ekin Karaşan - 447-481 Applying ranking and selection procedures to long-term mitigation for improved network restoration
by Emily A. Heath & John E. Mitchell & Thomas C. Sharkey
May 2016, Volume 4, Issue 2
- 123-124 Editorial
by Bernard Fortz & Luís Gouveia - 125-135 Models for video-on-demand scheduling with costs
by J.-Ch. Grégoire & Angèle M. Hamel - 137-166 Optimal capacitated ring trees
by Alessandro Hill & Stefan Voß - 167-188 Generalized minimum spanning tree games
by Phuoc Hoang Le & Tri-Dung Nguyen & Tolga Bektaş - 189-213 Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators
by Amaro Sousa & Carlos Borges Lopes & Paulo Monteiro
February 2016, Volume 4, Issue 1
- 1-2 Special issue on “Non-linear continuous optimization”
by Regina S. Burachik & C. Yalçın Kaya & Mustafa Ç. Pınar - 3-25 An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions
by Radu Ioan Boţ & Ernö Robert Csetnek & Szilárd Csaba László - 27-46 On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
by Ron Shefi & Marc Teboulle - 47-77 Dualization and discretization of linear-quadratic control problems with bang–bang solutions
by Walter Alt & C. Yalçın Kaya & Christopher Schneider - 79-92 On the application of an Augmented Lagrangian algorithm to some portfolio problems
by E. G. Birgin & J. M. Martínez - 93-121 A modification of the $$\alpha \hbox {BB}$$ α BB method for box-constrained optimization and an application to inverse kinematics
by Gabriele Eichfelder & Tobias Gerlach & Susanne Sumi