| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A branch-and-price algorithm for capacitated hypergraph vertex separation
|
Bastubbe, Michael
|
|
|
|
1 |
p. 39-68
|
artikel
|
| 2 |
acados—a modular open-source framework for fast embedded optimal control
|
Verschueren, Robin
|
|
|
|
1 |
p. 147-183
|
artikel
|
| 3 |
A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
|
Blado, Daniel
|
|
|
|
1 |
p. 185-223
|
artikel
|
| 4 |
A computational comparison of symmetry handling methods for mixed integer programs
|
Pfetsch, Marc E.
|
|
2018
|
|
1 |
p. 37-93
|
artikel
|
| 5 |
A data driven Dantzig–Wolfe decomposition framework
|
Basso, Saverio
|
|
|
|
1 |
p. 153-194
|
artikel
|
| 6 |
A dynamic programming approach for generalized nearly isotonic optimization
|
Yu, Zhensheng
|
|
|
|
1 |
p. 195-225
|
artikel
|
| 7 |
A hybrid quasi-Newton projected-gradient method with application to Lasso and basis-pursuit denoising
|
van den Berg, Ewout
|
|
|
|
1 |
p. 1-38
|
artikel
|
| 8 |
Alternating proximal gradient method for sparse nonnegative Tucker decomposition
|
Xu, Yangyang
|
|
2014
|
|
1 |
p. 39-70
|
artikel
|
| 9 |
A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines
|
Seth, Anupam
|
|
2015
|
|
1 |
p. 1-45
|
artikel
|
| 10 |
A new relaxation framework for quadratic assignment problems based on matrix splitting
|
Peng, Jiming
|
|
2010
|
|
1 |
p. 59-77
|
artikel
|
| 11 |
A primal–dual regularized interior-point method for convex quadratic programs
|
Friedlander, M. P.
|
|
2012
|
|
1 |
p. 71-107
|
artikel
|
| 12 |
A robust and scalable algorithm for the Steiner problem in graphs
|
Pajor, Thomas
|
|
2017
|
|
1 |
p. 69-118
|
artikel
|
| 13 |
Asynchronous Lagrangian scenario decomposition
|
Aravena, Ignacio
|
|
|
|
1 |
p. 1-50
|
artikel
|
| 14 |
Block splitting for distributed optimization
|
Parikh, Neal
|
|
2013
|
|
1 |
p. 77-102
|
artikel
|
| 15 |
Blossom V: a new implementation of a minimum cost perfect matching algorithm
|
Kolmogorov, Vladimir
|
|
2009
|
|
1 |
p. 43-67
|
artikel
|
| 16 |
Branch-and-cut for linear programs with overlapping SOS1 constraints
|
Fischer, Tobias
|
|
2017
|
|
1 |
p. 33-68
|
artikel
|
| 17 |
Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
|
Farias, I. R. de
|
|
2012
|
|
1 |
p. 75-112
|
artikel
|
| 18 |
CasADi: a software framework for nonlinear optimization and optimal control
|
Andersson, Joel A. E.
|
|
2018
|
|
1 |
p. 1-36
|
artikel
|
| 19 |
Computing compatible tours for the symmetric traveling salesman problem
|
Fortini, Matteo
|
|
2010
|
|
1 |
p. 59-78
|
artikel
|
| 20 |
Computing convex hulls and counting integer points with polymake
|
Assarf, Benjamin
|
|
2016
|
|
1 |
p. 1-38
|
artikel
|
| 21 |
Computing feasible points for binary MINLPs with MPECs
|
Schewe, Lars
|
|
2018
|
|
1 |
p. 95-118
|
artikel
|
| 22 |
CP-Lib: Benchmark Instances of the Clique Partitioning Problem
|
Sørensen, Michael M.
|
|
|
|
1 |
p. 93-111
|
artikel
|
| 23 |
Dantzig–Wolfe reformulations for binary quadratic problems
|
Ceselli, Alberto
|
|
|
|
1 |
p. 85-120
|
artikel
|
| 24 |
Deterministic “Snakes and Ladders” Heuristic for the Hamiltonian cycle problem
|
Baniasadi, Pouya
|
|
2013
|
|
1 |
p. 55-75
|
artikel
|
| 25 |
Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form
|
Karimi, Mehdi
|
|
|
|
1 |
p. 37-92
|
artikel
|
| 26 |
Enumeration of 2-level polytopes
|
Bohn, Adam
|
|
2018
|
|
1 |
p. 173-210
|
artikel
|
| 27 |
Exploiting sparsity for the min k-partition problem
|
Wang, Guanglei
|
|
|
|
1 |
p. 109-130
|
artikel
|
| 28 |
Faster min–max resource sharing in theory and practice
|
Müller, Dirk
|
|
2011
|
|
1 |
p. 1-35
|
artikel
|
| 29 |
Fast Fourier optimization
|
Vanderbei, Robert J.
|
|
2012
|
|
1 |
p. 53-69
|
artikel
|
| 30 |
Fast separation for the three-index assignment problem
|
Dokka, Trivikram
|
|
2016
|
|
1 |
p. 39-59
|
artikel
|
| 31 |
Globally solving nonconvex quadratic programming problems via completely positive programming
|
Chen, Jieqiu
|
|
2011
|
|
1 |
p. 33-52
|
artikel
|
| 32 |
Global optimization of nonconvex problems with multilinear intermediates
|
Bao, Xiaowei
|
|
2014
|
|
1 |
p. 1-37
|
artikel
|
| 33 |
Hard to solve instances of the Euclidean Traveling Salesman Problem
|
Hougardy, Stefan
|
|
|
|
1 |
p. 51-74
|
artikel
|
| 34 |
Implementation of a unimodularity test
|
Walter, Matthias
|
|
2012
|
|
1 |
p. 57-73
|
artikel
|
| 35 |
Improved branch-cut-and-price for capacitated vehicle routing
|
Pecin, Diego
|
|
2016
|
|
1 |
p. 61-100
|
artikel
|
| 36 |
Improving branch-and-cut performance by random sampling
|
Fischetti, Matteo
|
|
2015
|
|
1 |
p. 113-132
|
artikel
|
| 37 |
KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price
|
Arslan, Ayşe N.
|
|
|
|
1 |
p. 151-184
|
artikel
|
| 38 |
Large-scale optimization with the primal-dual column generation method
|
Gondzio, Jacek
|
|
2015
|
|
1 |
p. 47-82
|
artikel
|
| 39 |
Matrix-free interior point method for compressed sensing problems
|
Fountoulakis, Kimon
|
|
2013
|
|
1 |
p. 1-31
|
artikel
|
| 40 |
Methods for convex and general quadratic programming
|
Gill, Philip E.
|
|
2014
|
|
1 |
p. 71-112
|
artikel
|
| 41 |
MiniCP: a lightweight solver for constraint programming
|
Michel, L.
|
|
|
|
1 |
p. 133-184
|
artikel
|
| 42 |
Minimizing the sum of many rational functions
|
Bugarin, Florian
|
|
2015
|
|
1 |
p. 83-111
|
artikel
|
| 43 |
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
|
Shi, Xueyu
|
|
|
|
1 |
p. 1-51
|
artikel
|
| 44 |
Mixed-integer programming techniques for the connected max-k-cut problem
|
Hojny, Christopher
|
|
|
|
1 |
p. 75-132
|
artikel
|
| 45 |
New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
|
Luo, Hezhi
|
|
2018
|
|
1 |
p. 119-171
|
artikel
|
| 46 |
On efficiently combining limited-memory and trust-region techniques
|
Burdakov, Oleg
|
|
2016
|
|
1 |
p. 101-134
|
artikel
|
| 47 |
On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees
|
Andreani, R.
|
|
|
|
1 |
p. 121-146
|
artikel
|
| 48 |
On solving trust-region and other regularised subproblems in optimization
|
Gould, Nicholas I. M.
|
|
2010
|
|
1 |
p. 21-57
|
artikel
|
| 49 |
Optimal patchings for consecutive ones matrices
|
Pfetsch, Marc E.
|
|
|
|
1 |
p. 43-84
|
artikel
|
| 50 |
Optimizing a polyhedral-semidefinite relaxation of completely positive programs
|
Burer, Samuel
|
|
2010
|
|
1 |
p. 1-19
|
artikel
|
| 51 |
Parallelizing the dual revised simplex method
|
Huangfu, Q.
|
|
2017
|
|
1 |
p. 119-142
|
artikel
|
| 52 |
Partial hyperplane activation for generalized intersection cuts
|
Kazachkov, Aleksandr M.
|
|
|
|
1 |
p. 69-107
|
artikel
|
| 53 |
Performance enhancements for a generic conic interior point algorithm
|
Coey, Chris
|
|
|
|
1 |
p. 53-101
|
artikel
|
| 54 |
Quadratic factorization heuristics for copositive programming
|
Bomze, Immanuel M.
|
|
2011
|
|
1 |
p. 37-57
|
artikel
|
| 55 |
RENS
|
Berthold, Timo
|
|
2013
|
|
1 |
p. 33-54
|
artikel
|
| 56 |
Rounding-based heuristics for nonconvex MINLPs
|
Nannicini, Giacomo
|
|
2011
|
|
1 |
p. 1-31
|
artikel
|
| 57 |
Scalable branching on dual decomposition of stochastic mixed-integer programming problems
|
Kim, Kibaek
|
|
|
|
1 |
p. 1-41
|
artikel
|
| 58 |
SCIP: solving constraint integer programs
|
Achterberg, Tobias
|
|
2009
|
|
1 |
p. 1-41
|
artikel
|
| 59 |
Self-adaptive ADMM for semi-strongly convex problems
|
Tang, Tianyun
|
|
|
|
1 |
p. 113-150
|
artikel
|
| 60 |
Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
|
Papazaharias, Demetrios V.
|
|
|
|
1 |
p. 103-151
|
artikel
|
| 61 |
Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
|
Weisser, Tillmann
|
|
2017
|
|
1 |
p. 1-32
|
artikel
|
| 62 |
Structure-aware methods for expensive derivative-free nonsmooth composite optimization
|
Larson, Jeffrey
|
|
|
|
1 |
p. 1-36
|
artikel
|
| 63 |
Testing cut generators for mixed-integer linear programming
|
Margot, François
|
|
2009
|
|
1 |
p. 69-95
|
artikel
|
| 64 |
The time dependent traveling salesman problem: polyhedra and algorithm
|
Abeledo, Hernán
|
|
2012
|
|
1 |
p. 27-55
|
artikel
|
| 65 |
Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
|
Skajaa, Anders
|
|
2012
|
|
1 |
p. 1-25
|
artikel
|
Tijdschrift beschrijving