| 1 | -- | 14 | A. Rahmani, S. A. MirHassani. Lagrangean relaxation-based algorithm for bi-level problems |
| 15 | -- | 53 | Marc E. Pfetsch, Armin Fügenschuh, Björn Geißler, Nina Geißler, Ralf Gollmer, Benjamin Hiller, Jesco Humpola, Thorsten Koch, Thomas Lehmann, Alexander Martin, Antonio Morsi, Jessica Rövekamp, Lars Schewe, Martin Schmidt, Rüdiger Schultz, Robert Schwarz, Jonas Schweiger, Claudia Stangl, Marc C. Steinbach, Stefan Vigerske, Bernhard M. Willert. Validation of nominations in gas network optimization: models, methods, and solutions |
| 54 | -- | 80 | Michael N. Jung, Gerhard Reinelt, Sebastian Sager. The Lagrangian relaxation for the combinatorial integral approximation problem |
| 81 | -- | 93 | Rodrigo F. Toso, Mauricio G. C. Resende. A C++application programming interface for biased random-key genetic algorithms |
| 94 | -- | 127 | Péter Kovács. Minimum-cost flow algorithms: an experimental evaluation |
| 128 | -- | 161 | Sina Khoshfetrat Pakazad, Martin S. Andersen, Anders Hansson. Distributed solutions for loosely coupled feasibility problems using proximal splitting methods |
| 162 | -- | 190 | Mohammad Reza Ansari, Nezam Mahdavi-Amiri. A robust combined trust region-line search exact penalty projected structured scheme for constrained nonlinear least squares |
| 191 | -- | 214 | Attila Kozma, Christian Conte, Moritz Diehl. Benchmarking large-scale distributed convex quadratic programming algorithms |
| 215 | -- | 249 | Ruth Misener, James B. Smadbeck, Christodoulos A. Floudas. Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 |