| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Benders squared (B2) framework for infinite-horizon stochastic linear programs
|
Nannicini, Giacomo
|
|
|
|
4 |
p. 645-681
|
artikel
|
| 2 |
A branch-and-bound algorithm for instrumental variable quantile regression
|
Xu, Guanglin
|
|
2017
|
|
4 |
p. 471-497
|
artikel
|
| 3 |
A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
|
Tahernejad, Sahar
|
|
|
|
4 |
p. 529-568
|
artikel
|
| 4 |
A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
|
Exler, Oliver
|
|
2012
|
|
4 |
p. 383-412
|
artikel
|
| 5 |
A computational study of perspective cuts
|
Bestuzheva, Ksenia
|
|
|
|
4 |
p. 703-731
|
artikel
|
| 6 |
A derivative-free Gauss–Newton method
|
Cartis, Coralia
|
|
2019
|
|
4 |
p. 631-674
|
artikel
|
| 7 |
ADMM for the SDP relaxation of the QAP
|
Oliveira, Danilo Elias
|
|
2018
|
|
4 |
p. 631-658
|
artikel
|
| 8 |
A factorization with update procedures for a KKT matrix arising in direct optimal control
|
Kirches, Christian
|
|
2011
|
|
4 |
p. 319-348
|
artikel
|
| 9 |
A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
|
Xiao, Yunhai
|
|
2018
|
|
4 |
p. 533-555
|
artikel
|
| 10 |
A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
|
Jalving, Jordan
|
|
|
|
4 |
p. 699-747
|
artikel
|
| 11 |
A hierarchy of spectral relaxations for polynomial optimization
|
Mai, Ngoc Hoang Anh
|
|
|
|
4 |
p. 651-701
|
artikel
|
| 12 |
A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery
|
Bi, Shujun
|
|
|
|
4 |
p. 569-602
|
artikel
|
| 13 |
An active set algorithm for robust combinatorial optimization based on separation oracles
|
Buchheim, Christoph
|
|
2019
|
|
4 |
p. 755-789
|
artikel
|
| 14 |
An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
|
Liuzzi, Giampaolo
|
|
|
|
4 |
p. 673-702
|
artikel
|
| 15 |
An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem
|
Cavaliere, Francesco
|
|
|
|
4 |
p. 749-779
|
artikel
|
| 16 |
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
|
Sinnl, Markus
|
|
2016
|
|
4 |
p. 461-490
|
artikel
|
| 17 |
An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
|
Janka, Dennis
|
|
2016
|
|
4 |
p. 435-459
|
artikel
|
| 18 |
A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty
|
Knueven, Bernard
|
|
|
|
4 |
p. 591-619
|
artikel
|
| 19 |
A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
|
Curtis, Frank E.
|
|
2015
|
|
4 |
p. 399-428
|
artikel
|
| 20 |
A recipe for finding good solutions to MINLPs
|
Liberti, Leo
|
|
2011
|
|
4 |
p. 349-390
|
artikel
|
| 21 |
A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs
|
Kannan, Rohit
|
|
|
|
4 |
p. 705-751
|
artikel
|
| 22 |
A structure-conveying modelling language for mathematical and stochastic programming
|
Colombo, Marco
|
|
2009
|
|
4 |
p. 223-247
|
artikel
|
| 23 |
Benders decomposition with adaptive oracles for large scale optimization
|
Mazzi, Nicolò
|
|
|
|
4 |
p. 683-703
|
artikel
|
| 24 |
Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
|
Song, Yongjia
|
|
2013
|
|
4 |
p. 397-432
|
artikel
|
| 25 |
Branch-and-cut for complementarity-constrained optimization
|
Farias, I. R. de
|
|
2014
|
|
4 |
p. 365-403
|
artikel
|
| 26 |
Capitalizing on live variables: new algorithms for efficient Hessian computation via automatic differentiation
|
Wang, Mu
|
|
2016
|
|
4 |
p. 393-433
|
artikel
|
| 27 |
Computational aspects of infeasibility analysis in mixed integer programming
|
Witzig, Jakob
|
|
|
|
4 |
p. 753-785
|
artikel
|
| 28 |
Computational study of decomposition algorithms for mean-risk stochastic linear programs
|
Cotton, Tanisha G.
|
|
2015
|
|
4 |
p. 471-499
|
artikel
|
| 29 |
Computing minimum-volume enclosing ellipsoids
|
Bowman, Nathaniel
|
|
|
|
4 |
p. 621-650
|
artikel
|
| 30 |
Cubic regularization in symmetric rank-1 quasi-Newton methods
|
Benson, Hande Y.
|
|
2018
|
|
4 |
p. 457-486
|
artikel
|
| 31 |
Customizing the solution process of COIN-OR’s linear solvers with Python
|
Towhidi, Mehdi
|
|
2015
|
|
4 |
p. 377-391
|
artikel
|
| 32 |
Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem
|
Becker, Henrique
|
|
|
|
4 |
p. 673-697
|
artikel
|
| 33 |
Exact methods for discrete Γ-robust interdiction problems with an application to the bilevel knapsack problem
|
Beck, Yasmine
|
|
|
|
4 |
p. 733-782
|
artikel
|
| 34 |
Implementation of an interior point method with basis preconditioning
|
Schork, Lukas
|
|
|
|
4 |
p. 603-635
|
artikel
|
| 35 |
Information-based branching schemes for binary linear mixed integer problems
|
Kılınç Karzan, Fatma
|
|
2009
|
|
4 |
p. 249-293
|
artikel
|
| 36 |
Learning customized and optimized lists of rules with mathematical programming
|
Rudin, Cynthia
|
|
2018
|
|
4 |
p. 659-702
|
artikel
|
| 37 |
Lift-and-project cuts for convex mixed integer nonlinear programs
|
Kılınç, Mustafa R.
|
|
2017
|
|
4 |
p. 499-526
|
artikel
|
| 38 |
Lifted collocation integrators for direct optimal control in ACADO toolkit
|
Quirynen, Rien
|
|
2017
|
|
4 |
p. 527-571
|
artikel
|
| 39 |
Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
|
Kocuk, Burak
|
|
2018
|
|
4 |
p. 557-596
|
artikel
|
| 40 |
Maximum-weight stable sets and safe lower bounds for graph coloring
|
Held, Stephan
|
|
2012
|
|
4 |
p. 363-381
|
artikel
|
| 41 |
New exact approaches to row layout problems
|
Fischer, Anja
|
|
2019
|
|
4 |
p. 703-754
|
artikel
|
| 42 |
On technical debt in mathematical programming: An exploratory study
|
Vidoni, Melina
|
|
|
|
4 |
p. 781-818
|
artikel
|
| 43 |
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
|
Frangioni, Antonio
|
|
2017
|
|
4 |
p. 573-604
|
artikel
|
| 44 |
On the safety of Gomory cut generators
|
Cornuéjols, Gérard
|
|
2013
|
|
4 |
p. 345-395
|
artikel
|
| 45 |
Optimal sensitivity based on IPOPT
|
Pirnay, Hans
|
|
2012
|
|
4 |
p. 307-331
|
artikel
|
| 46 |
OSQP: an operator splitting solver for quadratic programs
|
Stellato, Bartolomeo
|
|
|
|
4 |
p. 637-672
|
artikel
|
| 47 |
PEBBL: an object-oriented framework for scalable parallel branch and bound
|
Eckstein, Jonathan
|
|
2015
|
|
4 |
p. 429-469
|
artikel
|
| 48 |
Political districting to minimize cut edges
|
Validi, Hamidreza
|
|
|
|
4 |
p. 623-672
|
artikel
|
| 49 |
Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
|
Cornuéjols, Gerard
|
|
2011
|
|
4 |
p. 281-318
|
artikel
|
| 50 |
Progress in presolving for mixed integer programming
|
Gamrath, Gerald
|
|
2015
|
|
4 |
p. 367-398
|
artikel
|
| 51 |
qpOASES: a parametric active-set algorithm for quadratic programming
|
Ferreau, Hans Joachim
|
|
2014
|
|
4 |
p. 327-363
|
artikel
|
| 52 |
QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
|
Li, Xudong
|
|
2018
|
|
4 |
p. 703-743
|
artikel
|
| 53 |
RBFOpt: an open-source library for black-box optimization with costly function evaluations
|
Costa, Alberto
|
|
2018
|
|
4 |
p. 597-629
|
artikel
|
| 54 |
Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
|
Wen, Zaiwen
|
|
2012
|
|
4 |
p. 333-361
|
artikel
|
| 55 |
Structure-driven fix-and-propagate heuristics for mixed integer programming
|
Gamrath, Gerald
|
|
2019
|
|
4 |
p. 675-702
|
artikel
|
| 56 |
The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
|
Juhl, Daniel
|
|
2018
|
|
4 |
p. 487-532
|
artikel
|
| 57 |
Using symmetry to optimize over the Sherali–Adams relaxation
|
Ostrowski, James
|
|
2014
|
|
4 |
p. 405-428
|
artikel
|
Tijdschrift beschrijving