| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A branch and bound algorithm for robust binary optimization with budget uncertainty
|
Büsing, Christina
|
|
|
|
2 |
p. 269-326
|
artikel
|
| 2 |
A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
|
Bettinelli, Andrea
|
|
2014
|
|
2 |
p. 171-197
|
artikel
|
| 3 |
Adaptive large neighborhood search for mixed integer programming
|
Hendel, Gregor
|
|
|
|
2 |
p. 185-221
|
artikel
|
| 4 |
Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs
|
Yan, Yonggui
|
|
|
|
2 |
p. 319-363
|
artikel
|
| 5 |
Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization
|
Bollapragada, Raghu
|
|
|
|
2 |
p. 327-364
|
artikel
|
| 6 |
A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
|
Monteiro, Renato D. C.
|
|
2013
|
|
2 |
p. 103-150
|
artikel
|
| 7 |
Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
|
Kim, Kibaek
|
|
2017
|
|
2 |
p. 225-266
|
artikel
|
| 8 |
A library of local search heuristics for the vehicle routing problem
|
Groër, Chris
|
|
2010
|
|
2 |
p. 79-101
|
artikel
|
| 9 |
A memetic procedure for global multi-objective optimization
|
Lapucci, Matteo
|
|
|
|
2 |
p. 227-267
|
artikel
|
| 10 |
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems
|
Lin, Meixia
|
|
|
|
2 |
p. 223-270
|
artikel
|
| 11 |
A Newton’s method for the continuous quadratic knapsack problem
|
Cominetti, Roberto
|
|
2014
|
|
2 |
p. 151-169
|
artikel
|
| 12 |
A novel matching formulation for startup costs in unit commitment
|
Knueven, Bernard
|
|
|
|
2 |
p. 225-248
|
artikel
|
| 13 |
A penalty-interior-point algorithm for nonlinear constrained optimization
|
Curtis, Frank E.
|
|
2012
|
|
2 |
p. 181-209
|
artikel
|
| 14 |
A practical volume algorithm
|
Cousins, Ben
|
|
2015
|
|
2 |
p. 133-160
|
artikel
|
| 15 |
A relax-and-cut framework for Gomory mixed-integer cuts
|
Fischetti, Matteo
|
|
2011
|
|
2 |
p. 79-102
|
artikel
|
| 16 |
CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
|
Friberg, Henrik A.
|
|
2015
|
|
2 |
p. 191-214
|
artikel
|
| 17 |
Communication protocols for options and results in a distributed optimization environment
|
Gassmann, Horand
|
|
2015
|
|
2 |
p. 161-189
|
artikel
|
| 18 |
Correction to: Asynchronous Lagrangian scenario decomposition
|
Aravena, Ignacio
|
|
|
|
2 |
p. 415-416
|
artikel
|
| 19 |
Detecting almost symmetries of graphs
|
Knueven, Ben
|
|
2017
|
|
2 |
p. 143-185
|
artikel
|
| 20 |
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
|
Hougardy, Stefan
|
|
2016
|
|
2 |
p. 135-202
|
artikel
|
| 21 |
Efficient block-coordinate descent algorithms for the Group Lasso
|
Qin, Zhiwei
|
|
2013
|
|
2 |
p. 143-169
|
artikel
|
| 22 |
Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization
|
Gunnels, John
|
|
2010
|
|
2 |
p. 103-124
|
artikel
|
| 23 |
Efficient unconstrained black box optimization
|
Kimiaei, Morteza
|
|
|
|
2 |
p. 365-414
|
artikel
|
| 24 |
Erratum to: CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
|
Friberg, Henrik A.
|
|
2015
|
|
2 |
p. 215-216
|
artikel
|
| 25 |
Feasibility Jump: an LP-free Lagrangian MIP heuristic
|
Luteberget, Bjørnar
|
|
|
|
2 |
p. 365-388
|
artikel
|
| 26 |
Generalized alternating direction method of multipliers: new theoretical insights and applications
|
Fang, Ethan X.
|
|
2015
|
|
2 |
p. 149-187
|
artikel
|
| 27 |
Incorporating bounds from decision diagrams into integer programming
|
Tjandraatmadja, Christian
|
|
|
|
2 |
p. 225-256
|
artikel
|
| 28 |
K-adaptability in two-stage mixed-integer robust optimization
|
Subramanyam, Anirudh
|
|
|
|
2 |
p. 193-224
|
artikel
|
| 29 |
LMBOPT: a limited memory method for bound-constrained optimization
|
Kimiaei, Morteza
|
|
|
|
2 |
p. 271-318
|
artikel
|
| 30 |
Local cuts for mixed-integer programming
|
Chvátal, Vašek
|
|
2013
|
|
2 |
p. 171-200
|
artikel
|
| 31 |
Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization
|
Mihić, Krešimir
|
|
|
|
2 |
p. 339-413
|
artikel
|
| 32 |
Minotaur: a mixed-integer nonlinear optimization toolkit
|
Mahajan, Ashutosh
|
|
|
|
2 |
p. 301-338
|
artikel
|
| 33 |
MIPLIB 2010
|
Koch, Thorsten
|
|
2011
|
|
2 |
p. 103-163
|
artikel
|
| 34 |
mplrs: A scalable parallel vertex/facet enumeration code
|
Avis, David
|
|
2017
|
|
2 |
p. 267-302
|
artikel
|
| 35 |
On integer and bilevel formulations for the k-vertex cut problem
|
Furini, Fabio
|
|
|
|
2 |
p. 133-164
|
artikel
|
| 36 |
On optimizing over lift-and-project closures
|
Bonami, Pierre
|
|
2012
|
|
2 |
p. 151-179
|
artikel
|
| 37 |
On solving a hard quadratic 3-dimensional assignment problem
|
Mittelmann, Hans D.
|
|
2015
|
|
2 |
p. 219-234
|
artikel
|
| 38 |
On the generation of metric TSP instances with a large integrality gap by branch-and-cut
|
Vercesi, Eleonora
|
|
|
|
2 |
p. 389-416
|
artikel
|
| 39 |
On the impact of running intersection inequalities for globally solving polynomial optimization problems
|
Del Pia, Alberto
|
|
|
|
2 |
p. 165-191
|
artikel
|
| 40 |
Optimizing over pure stationary equilibria in consensus stopping games
|
Dehghanian, Amin
|
|
2018
|
|
2 |
p. 341-380
|
artikel
|
| 41 |
Outer approximation with conic certificates for mixed-integer convex problems
|
Coey, Chris
|
|
|
|
2 |
p. 249-293
|
artikel
|
| 42 |
Parallel stochastic gradient algorithms for large-scale matrix completion
|
Recht, Benjamin
|
|
2013
|
|
2 |
p. 201-226
|
artikel
|
| 43 |
Polytope volume by descent in the face lattice and applications in social choice
|
Bruns, Winfried
|
|
|
|
2 |
p. 415-442
|
artikel
|
| 44 |
Publisher Correction to: Signomial and polynomial optimization via relative entropy and partial dualization
|
Murray, Riley
|
|
|
|
2 |
p. 297-299
|
artikel
|
| 45 |
pyomo.dae: a modeling and automatic discretization framework for optimization with differential and algebraic equations
|
Nicholson, Bethany
|
|
2017
|
|
2 |
p. 187-223
|
artikel
|
| 46 |
PySP: modeling and solving stochastic programs in Python
|
Watson, Jean-Paul
|
|
2012
|
|
2 |
p. 109-149
|
artikel
|
| 47 |
QPLIB: a library of quadratic programming instances
|
Furini, Fabio
|
|
2018
|
|
2 |
p. 237-265
|
artikel
|
| 48 |
SCIP-Jack—a solver for STP and variants with parallelization extensions
|
Gamrath, Gerald
|
|
2016
|
|
2 |
p. 231-296
|
artikel
|
| 49 |
Signomial and polynomial optimization via relative entropy and partial dualization
|
Murray, Riley
|
|
|
|
2 |
p. 257-295
|
artikel
|
| 50 |
Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
|
Atamtürk, Alper
|
|
2018
|
|
2 |
p. 311-340
|
artikel
|
| 51 |
Solving linear programs with complementarity constraints using branch-and-cut
|
Yu, Bin
|
|
2018
|
|
2 |
p. 267-310
|
artikel
|
| 52 |
Solving network design problems via iterative aggregation
|
Bärmann, Andreas
|
|
2015
|
|
2 |
p. 189-217
|
artikel
|
| 53 |
Special issue forward: the 2018 Mixed Integer Programming workshop
|
Bienstock, Daniel
|
|
|
|
2 |
p. 131
|
artikel
|
| 54 |
Split cuts from sparse disjunctions
|
Fukasawa, Ricardo
|
|
|
|
2 |
p. 295-335
|
artikel
|
| 55 |
Swap-vertex based neighborhood for Steiner tree problems
|
Fu, Zhang-Hua
|
|
2016
|
|
2 |
p. 297-320
|
artikel
|
| 56 |
The L-shape search method for triobjective integer programming
|
Boland, Natashia
|
|
2015
|
|
2 |
p. 217-251
|
artikel
|
| 57 |
The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs
|
Achterberg, Tobias
|
|
2010
|
|
2 |
p. 125-165
|
artikel
|
| 58 |
The (not so) trivial lifting in two dimensions
|
Fukasawa, Ricardo
|
|
2018
|
|
2 |
p. 211-235
|
artikel
|
| 59 |
The strength of multi-row models
|
Louveaux, Quentin
|
|
2014
|
|
2 |
p. 113-148
|
artikel
|
| 60 |
Thinning out Steiner trees: a node-based model for uniform edge costs
|
Fischetti, Matteo
|
|
2016
|
|
2 |
p. 203-229
|
artikel
|
| 61 |
Trajectory-following methods for large-scale degenerate convex quadratic programming
|
Gould, Nicholas I. M.
|
|
2013
|
|
2 |
p. 113-142
|
artikel
|
Tijdschrift beschrijving