| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring
|
Gaar, Elisabeth
|
|
|
183 |
1-2 |
p. 283-308
|
artikel
|
| 2 |
A general framework for handling commitment in online throughput maximization
|
Chen, Lin
|
|
|
183 |
1-2 |
p. 215-247
|
artikel
|
| 3 |
A generic exact solver for vehicle routing and related problems
|
Pessoa, Artur
|
|
|
183 |
1-2 |
p. 483-523
|
artikel
|
| 4 |
An efficient characterization of submodular spanning tree games
|
Koh, Zhuan Khye
|
|
|
183 |
1-2 |
p. 359-377
|
artikel
|
| 5 |
A new contraction technique with applications to congruency-constrained cuts
|
Nägele, Martin
|
|
|
183 |
1-2 |
p. 455-481
|
artikel
|
| 6 |
An exact algorithm for robust influence maximization
|
Nannicini, Giacomo
|
|
|
183 |
1-2 |
p. 419-453
|
artikel
|
| 7 |
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
|
Della Croce, Federico
|
|
|
183 |
1-2 |
p. 249-281
|
artikel
|
| 8 |
Approximate multi-matroid intersection via iterative refinement
|
Linhares, André
|
|
|
183 |
1-2 |
p. 397-418
|
artikel
|
| 9 |
Breaking symmetries to rescue sum of squares in the case of makespan scheduling
|
Verdugo, Victor
|
|
|
183 |
1-2 |
p. 583-618
|
artikel
|
| 10 |
Computing the nucleolus of weighted cooperative matching games in polynomial time
|
Könemann, Jochen
|
|
|
183 |
1-2 |
p. 555-581
|
artikel
|
| 11 |
Dynamic flows with adaptive route choice
|
Graf, Lukas
|
|
|
183 |
1-2 |
p. 309-335
|
artikel
|
| 12 |
Extended formulations from communication protocols in output-efficient time
|
Aprile, Manuel
|
|
|
183 |
1-2 |
p. 41-59
|
artikel
|
| 13 |
Improving the integrality gap for multiway cut
|
Bérczi, Kristóf
|
|
|
183 |
1-2 |
p. 171-193
|
artikel
|
| 14 |
Linear programming using limited-precision oracles
|
Gleixner, Ambros
|
|
|
183 |
1-2 |
p. 525-554
|
artikel
|
| 15 |
On compact representations of Voronoi cells of lattices
|
Hunkenschröder, Christoph
|
|
|
183 |
1-2 |
p. 337-358
|
artikel
|
| 16 |
Online submodular maximization: beating 1/2 made simple
|
Buchbinder, Niv
|
|
|
183 |
1-2 |
p. 149-169
|
artikel
|
| 17 |
Outer-product-free sets for polynomial optimization and oracle-based cuts
|
Bienstock, Daniel
|
|
|
183 |
1-2 |
p. 105-148
|
artikel
|
| 18 |
Preface
|
|
|
|
183 |
1-2 |
p. 1
|
artikel
|
| 19 |
Random projections for quadratic programs
|
D’Ambrosio, Claudia
|
|
|
183 |
1-2 |
p. 619-647
|
artikel
|
| 20 |
ℓ1-Sparsity approximation bounds for packing integer programs
|
Chekuri, Chandra
|
|
|
183 |
1-2 |
p. 195-214
|
artikel
|
| 21 |
Strong mixed-integer programming formulations for trained neural networks
|
Anderson, Ross
|
|
|
183 |
1-2 |
p. 3-39
|
artikel
|
| 22 |
Symmetry-breaking inequalities for ILP with structured sub-symmetry
|
Bendotti, Pascale
|
|
|
183 |
1-2 |
p. 61-103
|
artikel
|
| 23 |
The asymmetric traveling salesman path LP has constant integrality ratio
|
Köhne, Anna
|
|
|
183 |
1-2 |
p. 379-395
|
artikel
|
Tijdschrift beschrijving