nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A bounded degree SOS hierarchy for polynomial optimization
|
Lasserre, Jean B. |
|
2015 |
|
1-2 |
p. 87-117 |
artikel |
2 |
A bounded degree SOS hierarchy for polynomial optimization
|
Lasserre, JeanB. |
|
|
|
1-2 |
p. 87-117 |
artikel |
3 |
A comparison of four approaches from stochastic programming for large-scale unit-commitment
|
Ackooij, Wim van |
|
2015 |
|
1-2 |
p. 119-147 |
artikel |
4 |
A comparison of four approaches from stochastic programming for large-scale unit-commitment
|
van Ackooij, Wim |
|
|
|
1-2 |
p. 119-147 |
artikel |
5 |
A complete search method for the relaxed traveling tournament problem
|
Brandão, Filipe |
|
2013 |
|
1-2 |
p. 77-86 |
artikel |
6 |
A complete search method for the relaxed traveling tournament problem
|
Brandão, Filipe |
|
|
|
1-2 |
p. 77-86 |
artikel |
7 |
A hybrid approach to the solution of a pricing model with continuous demand segmentation
|
Marcotte, Patrice |
|
2013 |
|
1-2 |
p. 117-142 |
artikel |
8 |
A hybrid approach to the solution of a pricing model with continuous demand segmentation
|
Marcotte, Patrice |
|
|
|
1-2 |
p. 117-142 |
artikel |
9 |
A MIP framework for non-convex uniform price day-ahead electricity auctions
|
Madani, Mehdi |
|
2015 |
|
1-2 |
p. 263-284 |
artikel |
10 |
A MIP framework for non-convex uniform price day-ahead electricity auctions
|
Madani, Mehdi |
|
|
|
1-2 |
p. 263-284 |
artikel |
11 |
A multiplicative weights update algorithm for MINLP
|
Mencarelli, Luca |
|
2016 |
|
1-2 |
p. 31-86 |
artikel |
12 |
A multiplicative weights update algorithm for MINLP
|
Mencarelli, Luca |
|
|
|
1-2 |
p. 31-86 |
artikel |
13 |
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
|
Gentile, C. |
|
2016 |
|
1-2 |
p. 177-201 |
artikel |
14 |
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
|
Gentile, C. |
|
|
|
1-2 |
p. 177-201 |
artikel |
15 |
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
|
Gendron, Bernard |
|
2014 |
|
1-2 |
p. 55-75 |
artikel |
16 |
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
|
Gendron, Bernard |
|
|
|
1-2 |
p. 55-75 |
artikel |
17 |
Column generation for extended formulations
|
Sadykov, Ruslan |
|
2013 |
|
1-2 |
p. 81-115 |
artikel |
18 |
Column generation for extended formulations
|
Sadykov, Ruslan |
|
|
|
1-2 |
p. 81-115 |
artikel |
19 |
Editorial
|
Labbé, Martine |
|
2013 |
|
1-2 |
p. 1-2 |
artikel |
20 |
Editorial
|
Labbé, Martine |
|
|
|
1-2 |
p. 1-2 |
artikel |
21 |
Evaluating performance of image segmentation criteria and techniques
|
Hochbaum, Dorit S. |
|
2012 |
|
1-2 |
p. 155-180 |
artikel |
22 |
Evaluating performance of image segmentation criteria and techniques
|
Hochbaum, DoritS. |
|
|
|
1-2 |
p. 155-180 |
artikel |
23 |
Intersection cuts from multiple rows: a disjunctive programming approach
|
Balas, Egon |
|
2013 |
|
1-2 |
p. 3-49 |
artikel |
24 |
Intersection cuts from multiple rows: a disjunctive programming approach
|
Balas, Egon |
|
|
|
1-2 |
p. 3-49 |
artikel |
25 |
Multi-machine energy-aware scheduling
|
Van Den Dooren, David |
|
2016 |
|
1-2 |
p. 285-307 |
artikel |
26 |
Multi-machine energy-aware scheduling
|
Van Den Dooren, David |
|
|
|
1-2 |
p. 285-307 |
artikel |
27 |
Open problems on graph eigenvalues studied with AutoGraphiX
|
Aouchiche, Mustapha |
|
2012 |
|
1-2 |
p. 181-199 |
artikel |
28 |
Open problems on graph eigenvalues studied with AutoGraphiX
|
Aouchiche, Mustapha |
|
|
|
1-2 |
p. 181-199 |
artikel |
29 |
Optimizing compatible sets in wireless networks through integer programming
|
Li, Yuan |
|
2013 |
|
1-2 |
p. 1-15 |
artikel |
30 |
Optimizing compatible sets in wireless networks through integer programming
|
Li, Yuan |
|
|
|
1-2 |
p. 1-15 |
artikel |
31 |
Reflections on generating (disjunctive) cuts
|
Cadoux, Florent |
|
2013 |
|
1-2 |
p. 51-69 |
artikel |
32 |
Reflections on generating (disjunctive) cuts
|
Cadoux, Florent |
|
|
|
1-2 |
p. 51-69 |
artikel |
33 |
Restrict-and-relax search for 0-1 mixed-integer programs
|
Guzelsoy, Menal |
|
2013 |
|
1-2 |
p. 201-218 |
artikel |
34 |
Restrict-and-relax search for 0-1 mixed-integer programs
|
Guzelsoy, Menal |
|
|
|
1-2 |
p. 201-218 |
artikel |
35 |
Special issue on: Nonlinear and combinatorial methods for energy optimization
|
D’Ambrosio, Claudia |
|
2017 |
|
1-2 |
p. 1-3 |
artikel |
36 |
Special issue on: Nonlinear and combinatorial methods for energy optimization
|
D’Ambrosio, Claudia |
|
|
|
1-2 |
p. 1-3 |
artikel |
37 |
Strong and compact relaxations in the original space using a compact extended formulation
|
Van Vyve, Mathieu |
|
2012 |
|
1-2 |
p. 71-80 |
artikel |
38 |
Strong and compact relaxations in the original space using a compact extended formulation
|
Van Vyve, Mathieu |
|
|
|
1-2 |
p. 71-80 |
artikel |
39 |
Sufficient pruning conditions for MINLP in gas network design
|
Humpola, Jesco |
|
2016 |
|
1-2 |
p. 239-261 |
artikel |
40 |
Sufficient pruning conditions for MINLP in gas network design
|
Humpola, Jesco |
|
|
|
1-2 |
p. 239-261 |
artikel |
41 |
The summed start-up costs in a unit commitment problem
|
Brandenberg, René |
|
2016 |
|
1-2 |
p. 203-238 |
artikel |
42 |
The summed start-up costs in a unit commitment problem
|
Brandenberg, René |
|
|
|
1-2 |
p. 203-238 |
artikel |
43 |
Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
|
Dupin, Nicolas |
|
2016 |
|
1-2 |
p. 149-176 |
artikel |
44 |
Tighter MIP formulations for the discretised unit commitment problem with min-stop ramping constraints
|
Dupin, Nicolas |
|
|
|
1-2 |
p. 149-176 |
artikel |
45 |
Towards optimizing the deployment of optical access networks
|
Grötschel, Martin |
|
2013 |
|
1-2 |
p. 17-53 |
artikel |
46 |
Towards optimizing the deployment of optical access networks
|
Grötschel, Martin |
|
|
|
1-2 |
p. 17-53 |
artikel |
47 |
Uncontrolled inexact information within bundle methods
|
Malick, Jérôme |
|
2016 |
|
1-2 |
p. 5-29 |
artikel |
48 |
Uncontrolled inexact information within bundle methods
|
Malick, Jérôme |
|
|
|
1-2 |
p. 5-29 |
artikel |
49 |
Worst case complexity of direct search
|
Vicente, L. N. |
|
2012 |
|
1-2 |
p. 143-153 |
artikel |
50 |
Worst case complexity of direct search
|
Vicente, L.N. |
|
|
|
1-2 |
p. 143-153 |
artikel |