| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers
|
Attia, Dalia
|
|
2019
|
|
4 |
p. 325-357
|
artikel
|
| 2 |
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers
|
Attia, Dalia
|
|
|
|
4 |
p. 325-357
|
artikel
|
| 3 |
A Lagrangian-ACO matheuristic for car sequencing
|
Thiruvady, Dhananjay
|
|
2014
|
|
4 |
p. 279-296
|
artikel
|
| 4 |
A Lagrangian-ACO matheuristic for car sequencing
|
Thiruvady, Dhananjay
|
|
|
|
4 |
p. 279-296
|
artikel
|
| 5 |
A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem
|
Dussault, Jean-Pierre
|
|
2019
|
|
4 |
p. 359-380
|
artikel
|
| 6 |
A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem
|
Dussault, Jean-Pierre
|
|
|
|
4 |
p. 359-380
|
artikel
|
| 7 |
An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
|
Schmidt, Martin
|
|
2015
|
|
4 |
p. 309-348
|
artikel
|
| 8 |
An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
|
Schmidt, Martin
|
|
|
|
4 |
p. 309-348
|
artikel
|
| 9 |
Another pedagogy for mixed-integer Gomory
|
Lee, Jon
|
|
2017
|
|
4 |
p. 455-466
|
artikel
|
| 10 |
Another pedagogy for mixed-integer Gomory
|
Lee, Jon
|
|
|
|
4 |
p. 455-466
|
artikel
|
| 11 |
A survey on matheuristics for routing problems
|
Archetti, Claudia
|
|
2014
|
|
4 |
p. 223-246
|
artikel
|
| 12 |
A survey on matheuristics for routing problems
|
Archetti, Claudia
|
|
|
|
4 |
p. 223-246
|
artikel
|
| 13 |
Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems
|
Levorato, Mario
|
|
2017
|
|
4 |
p. 499
|
artikel
|
| 14 |
Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems
|
Levorato, Mario
|
|
|
|
4 |
p. 499
|
artikel
|
| 15 |
Evaluating balancing on social networks through the efficient solution of correlation clustering problems
|
Levorato, Mario
|
|
2017
|
|
4 |
p. 467-498
|
artikel
|
| 16 |
Evaluating balancing on social networks through the efficient solution of correlation clustering problems
|
Levorato, Mario
|
|
|
|
4 |
p. 467-498
|
artikel
|
| 17 |
Integration of routing into a resource-constrained project scheduling problem
|
Lacomme, Philippe
|
|
2018
|
|
4 |
p. 421-464
|
artikel
|
| 18 |
Integration of routing into a resource-constrained project scheduling problem
|
Lacomme, Philippe
|
|
|
|
4 |
p. 421-464
|
artikel
|
| 19 |
Learning to steer nonlinear interior-point methods
|
Kuhlmann, Renke
|
|
2019
|
|
4 |
p. 381-419
|
artikel
|
| 20 |
Learning to steer nonlinear interior-point methods
|
Kuhlmann, Renke
|
|
|
|
4 |
p. 381-419
|
artikel
|
| 21 |
Multipolar robust optimization
|
Ben-Ameur, Walid
|
|
2017
|
|
4 |
p. 395-434
|
artikel
|
| 22 |
Multipolar robust optimization
|
Ben-Ameur, Walid
|
|
|
|
4 |
p. 395-434
|
artikel
|
| 23 |
Nonsmooth spectral gradient methods for unconstrained optimization
|
Loreto, Milagros
|
|
2017
|
|
4 |
p. 529-553
|
artikel
|
| 24 |
Nonsmooth spectral gradient methods for unconstrained optimization
|
Loreto, Milagros
|
|
|
|
4 |
p. 529-553
|
artikel
|
| 25 |
On the construction of quadratic models for derivative-free trust-region algorithms
|
Verdério, Adriano
|
|
2017
|
|
4 |
p. 501-527
|
artikel
|
| 26 |
On the construction of quadratic models for derivative-free trust-region algorithms
|
Verdério, Adriano
|
|
|
|
4 |
p. 501-527
|
artikel
|
| 27 |
Optimal selection of contracts and work shifts in multi-skill call centers
|
Cordone, Roberto
|
|
2014
|
|
4 |
p. 247-277
|
artikel
|
| 28 |
Optimal selection of contracts and work shifts in multi-skill call centers
|
Cordone, Roberto
|
|
|
|
4 |
p. 247-277
|
artikel
|
| 29 |
PANDA: a software for polyhedral transformations
|
Lörwald, Stefan
|
|
2015
|
|
4 |
p. 297-308
|
artikel
|
| 30 |
PANDA: a software for polyhedral transformations
|
Lörwald, Stefan
|
|
|
|
4 |
p. 297-308
|
artikel
|
| 31 |
Robust bilateral trade with discrete types
|
Kargar, Kamyar
|
|
2018
|
|
4 |
p. 367-393
|
artikel
|
| 32 |
Robust bilateral trade with discrete types
|
Kargar, Kamyar
|
|
|
|
4 |
p. 367-393
|
artikel
|
| 33 |
Robust combinatorial optimization under budgeted–ellipsoidal uncertainty
|
Kurtz, Jannis
|
|
2018
|
|
4 |
p. 315-337
|
artikel
|
| 34 |
Robust combinatorial optimization under budgeted–ellipsoidal uncertainty
|
Kurtz, Jannis
|
|
|
|
4 |
p. 315-337
|
artikel
|
| 35 |
Solving multistage quantified linear optimization problems with the alpha–beta nested Benders decomposition
|
Lorenz, Ulf
|
|
2015
|
|
4 |
p. 349-370
|
artikel
|
| 36 |
Solving multistage quantified linear optimization problems with the alpha–beta nested Benders decomposition
|
Lorenz, Ulf
|
|
|
|
4 |
p. 349-370
|
artikel
|
| 37 |
Special issue on: “matheuristics”
|
Archetti, Claudia
|
|
2014
|
|
4 |
p. 221-222
|
artikel
|
| 38 |
Special issue on: “matheuristics”
|
Archetti, Claudia
|
|
|
|
4 |
p. 221-222
|
artikel
|
| 39 |
Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation
|
Büsing, Christina
|
|
2018
|
|
4 |
p. 339-365
|
artikel
|
| 40 |
Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation
|
Büsing, Christina
|
|
|
|
4 |
p. 339-365
|
artikel
|
Tijdschrift beschrijving