| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
|
Zverovich, Victor
|
|
2012
|
|
3 |
p. 211-238
|
artikel
|
| 2 |
A hybrid branch-and-bound approach for exact rational mixed-integer programming
|
Cook, William
|
|
2013
|
|
3 |
p. 305-344
|
artikel
|
| 3 |
A hybrid LP/NLP paradigm for global optimization relaxations
|
Khajavirad, Aida
|
|
2018
|
|
3 |
p. 383-421
|
artikel
|
| 4 |
Allocation of fungible resources via a fast, scalable price discovery method
|
Agrawal, Akshay
|
|
|
|
3 |
p. 593-622
|
artikel
|
| 5 |
An adaptive primal-dual framework for nonsmooth convex minimization
|
Tran-Dinh, Quoc
|
|
|
|
3 |
p. 451-491
|
artikel
|
| 6 |
An exact cooperative method for the uncapacitated facility location problem
|
Posta, Marius
|
|
2014
|
|
3 |
p. 199-231
|
artikel
|
| 7 |
An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization
|
Li, Fei
|
|
|
|
3 |
p. 583-644
|
artikel
|
| 8 |
A nonmonotone GRASP
|
Santis, M. De
|
|
2016
|
|
3 |
p. 271-309
|
artikel
|
| 9 |
A note on “On fast trust region methods for quadratic models with linear constraints”, by Michael J.D. Powell
|
Bienstock, Daniel
|
|
2015
|
|
3 |
p. 235
|
artikel
|
| 10 |
A parallel quadratic programming method for dynamic optimization problems
|
Frasch, Janick V.
|
|
2015
|
|
3 |
p. 289-329
|
artikel
|
| 11 |
A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
|
Jiang, Kaifeng
|
|
2014
|
|
3 |
p. 281-325
|
artikel
|
| 12 |
A penalized method of alternating projections for weighted low-rank hankel matrix optimization
|
Shen, Jian
|
|
|
|
3 |
p. 417-450
|
artikel
|
| 13 |
A rotation-based branch-and-price approach for the nurse scheduling problem
|
Legrain, Antoine
|
|
|
|
3 |
p. 417-450
|
artikel
|
| 14 |
Asynchronously parallel optimization solver for finding multiple minima
|
Larson, Jeffrey
|
|
2018
|
|
3 |
p. 303-332
|
artikel
|
| 15 |
A triangulation and fill-reducing initialization procedure for the simplex algorithm
|
Ploskas, Nikolaos
|
|
|
|
3 |
p. 491-508
|
artikel
|
| 16 |
Boosting the feasibility pump
|
Boland, Natashia L.
|
|
2014
|
|
3 |
p. 255-279
|
artikel
|
| 17 |
Certifiably optimal sparse principal component analysis
|
Berk, Lauren
|
|
2019
|
|
3 |
p. 381-420
|
artikel
|
| 18 |
Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
|
Hijazi, Hassan
|
|
2016
|
|
3 |
p. 321-367
|
artikel
|
| 19 |
Cutting plane versus compact formulations for uncertain (integer) linear programs
|
Fischetti, Matteo
|
|
2012
|
|
3 |
p. 239-273
|
artikel
|
| 20 |
Design and implementation of a modular interior-point solver for linear optimization
|
Tanneau, Mathieu
|
|
|
|
3 |
p. 509-551
|
artikel
|
| 21 |
Deterministic global optimization with Gaussian processes embedded
|
Schweidtmann, Artur M.
|
|
|
|
3 |
p. 553-581
|
artikel
|
| 22 |
Efficient MIP techniques for computing the relaxation complexity
|
Averkov, Gennadiy
|
|
|
|
3 |
p. 549-580
|
artikel
|
| 23 |
Extended formulations in mixed integer conic quadratic programming
|
Vielma, Juan Pablo
|
|
2016
|
|
3 |
p. 369-418
|
artikel
|
| 24 |
Faster exact solution of sparse MaxCut and QUBO problems
|
Rehfeldt, Daniel
|
|
|
|
3 |
p. 445-470
|
artikel
|
| 25 |
Generation techniques for linear programming instances with controllable properties
|
Bowly, Simon
|
|
|
|
3 |
p. 389-415
|
artikel
|
| 26 |
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
|
Bonami, Pierre
|
|
2018
|
|
3 |
p. 333-382
|
artikel
|
| 27 |
GPU accelerated greedy algorithms for compressed sensing
|
Blanchard, Jeffrey D.
|
|
2013
|
|
3 |
p. 267-304
|
artikel
|
| 28 |
Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems
|
Maher, Stephen J.
|
|
|
|
3 |
p. 509-548
|
artikel
|
| 29 |
Intersection cuts for single row corner relaxations
|
Fukasawa, Ricardo
|
|
2018
|
|
3 |
p. 423-455
|
artikel
|
| 30 |
JuMP 1.0: recent improvements to a modeling language for mathematical optimization
|
Lubin, Miles
|
|
|
|
3 |
p. 581-589
|
artikel
|
| 31 |
Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization
|
Lee, Ching-pei
|
|
|
|
3 |
p. 543-591
|
artikel
|
| 32 |
LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
|
Armbruster, Michael
|
|
2012
|
|
3 |
p. 275-306
|
artikel
|
| 33 |
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
|
Gleixner, Ambros
|
|
|
|
3 |
p. 443-490
|
artikel
|
| 34 |
New computer-based search strategies for extreme functions of the Gomory–Johnson infinite group problem
|
Köppe, Matthias
|
|
2016
|
|
3 |
p. 419-469
|
artikel
|
| 35 |
OAR Lib: an open source arc routing library
|
Lum, Oliver
|
|
2019
|
|
3 |
p. 587-629
|
artikel
|
| 36 |
On fast trust region methods for quadratic models with linear constraints
|
Powell, M. J. D.
|
|
2015
|
|
3 |
p. 237-267
|
artikel
|
| 37 |
Optimal linear arrangements using betweenness variables
|
Caprara, Alberto
|
|
2011
|
|
3 |
p. 261-280
|
artikel
|
| 38 |
Optimization of algorithms with OPAL
|
Audet, Charles
|
|
2014
|
|
3 |
p. 233-254
|
artikel
|
| 39 |
Parallel and distributed asynchronous adaptive stochastic gradient methods
|
Xu, Yangyang
|
|
|
|
3 |
p. 471-508
|
artikel
|
| 40 |
Parsimonious formulations for low-diameter clusters
|
Salemi, Hosseinali
|
|
|
|
3 |
p. 493-528
|
artikel
|
| 41 |
Phase retrieval for imaging problems
|
Fogel, Fajwel
|
|
2016
|
|
3 |
p. 311-335
|
artikel
|
| 42 |
Pyomo: modeling and solving mathematical programs in Python
|
Hart, William E.
|
|
2011
|
|
3 |
p. 219-260
|
artikel
|
| 43 |
QPALM: a proximal augmented lagrangian method for nonconvex quadratic programs
|
Hermans, Ben
|
|
|
|
3 |
p. 497-541
|
artikel
|
| 44 |
Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization
|
Kanzow, Christian
|
|
|
|
3 |
p. 417-444
|
artikel
|
| 45 |
Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
|
Vanderbei, Robert
|
|
2016
|
|
3 |
p. 253-269
|
artikel
|
| 46 |
RLT-POS: Reformulation-Linearization Technique-based optimization software for solving polynomial programming problems
|
Dalkiran, Evrim
|
|
2016
|
|
3 |
p. 337-375
|
artikel
|
| 47 |
Robust Euclidean embedding via EDM optimization
|
Zhou, Shenglong
|
|
|
|
3 |
p. 337-387
|
artikel
|
| 48 |
SDPNAL$$+$$+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
|
Yang, Liuqin
|
|
2015
|
|
3 |
p. 331-366
|
artikel
|
| 49 |
Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
|
Zhu, Yuzixuan
|
|
2019
|
|
3 |
p. 503-586
|
artikel
|
| 50 |
Solving equilibrium problems using extended mathematical programming
|
Kim, Youngdae
|
|
2019
|
|
3 |
p. 457-501
|
artikel
|
| 51 |
Solving quadratic programs to high precision using scaled iterative refinement
|
Weber, Tobias
|
|
2019
|
|
3 |
p. 421-455
|
artikel
|
| 52 |
Solving the equality generalized traveling salesman problem using the Lin–Kernighan–Helsgaun Algorithm
|
Helsgaun, Keld
|
|
2015
|
|
3 |
p. 269-287
|
artikel
|
| 53 |
TACO: a toolkit for AMPL control optimization
|
Kirches, Christian
|
|
2013
|
|
3 |
p. 227-265
|
artikel
|
| 54 |
Templates for convex cone problems with applications to sparse signal recovery
|
Becker, Stephen R.
|
|
2011
|
|
3 |
p. 165-218
|
artikel
|
| 55 |
Tenscalc: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria
|
Hespanha, João P.
|
|
|
|
3 |
p. 451-496
|
artikel
|
Tijdschrift beschrijving