nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A polyhedral approach to online bipartite matching
|
Torrico, Alfredo |
|
2017 |
172 |
1-2 |
p. 443-465 |
artikel |
2 |
Approximating graph-constrained max-cut
|
Shen, Xiangkun |
|
2017 |
172 |
1-2 |
p. 35-58 |
artikel |
3 |
Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems
|
Linhares, André |
|
2017 |
172 |
1-2 |
p. 17-34 |
artikel |
4 |
Better s–t-tours by Gao trees
|
Gottschalk, Corinna |
|
2017 |
172 |
1-2 |
p. 191-207 |
artikel |
5 |
Constant factor approximation for ATSP with two edge weights
|
Svensson, Ola |
|
2017 |
172 |
1-2 |
p. 371-397 |
artikel |
6 |
Ellipsoidal mixed-integer representability
|
Del Pia, Alberto |
|
2017 |
172 |
1-2 |
p. 351-369 |
artikel |
7 |
Exact algorithms for the chance-constrained vehicle routing problem
|
Dinh, Thai |
|
2017 |
172 |
1-2 |
p. 105-138 |
artikel |
8 |
Extreme functions with an arbitrary number of slopes
|
Basu, Amitabh |
|
2017 |
172 |
1-2 |
p. 303-327 |
artikel |
9 |
Improved approximations for cubic bipartite and cubic TSP
|
Zuylen, Anke van |
|
2017 |
172 |
1-2 |
p. 399-413 |
artikel |
10 |
k-Trails: recognition, complexity, and approximations
|
Singh, Mohit |
|
2017 |
172 |
1-2 |
p. 169-189 |
artikel |
11 |
Maximizing monotone submodular functions over the integer lattice
|
Soma, Tasuku |
|
2018 |
172 |
1-2 |
p. 539-563 |
artikel |
12 |
Minimal cut-generating functions are nearly extreme
|
Basu, Amitabh |
|
2017 |
172 |
1-2 |
p. 329-349 |
artikel |
13 |
On approximation algorithms for concave mixed-integer quadratic programming
|
Del Pia, Alberto |
|
2017 |
172 |
1-2 |
p. 3-16 |
artikel |
14 |
On quantile cuts and their closure for chance constrained optimization problems
|
Xie, Weijun |
|
2017 |
172 |
1-2 |
p. 621-646 |
artikel |
15 |
On some polytopes contained in the 0, 1 hypercube that have a small Chvátal rank
|
Cornuéjols, Gérard |
|
2018 |
172 |
1-2 |
p. 467-503 |
artikel |
16 |
On the use of intersection cuts for bilevel optimization
|
Fischetti, Matteo |
|
2017 |
172 |
1-2 |
p. 77-103 |
artikel |
17 |
Polyhedral approximation in mixed-integer convex optimization
|
Lubin, Miles |
|
2017 |
172 |
1-2 |
p. 139-168 |
artikel |
18 |
Popular edges and dominant matchings
|
Cseh, Ágnes |
|
2017 |
172 |
1-2 |
p. 209-229 |
artikel |
19 |
Preface
|
Louveaux, Quentin |
|
2018 |
172 |
1-2 |
p. 1-2 |
artikel |
20 |
Robust monotone submodular function maximization
|
Orlin, James B. |
|
2018 |
172 |
1-2 |
p. 505-537 |
artikel |
21 |
Round-robin tournaments generated by the Circle Method have maximum carry-over
|
Lambrechts, Erik |
|
2017 |
172 |
1-2 |
p. 277-302 |
artikel |
22 |
Semidefinite and linear programming integrality gaps for scheduling identical machines
|
Kurpisz, Adam |
|
2017 |
172 |
1-2 |
p. 231-248 |
artikel |
23 |
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
|
Baïou, Mourad |
|
2018 |
172 |
1-2 |
p. 59-75 |
artikel |
24 |
Stabilizing network bargaining games by blocking players
|
Ahmadian, Sara |
|
2017 |
172 |
1-2 |
p. 249-275 |
artikel |
25 |
Strong reductions for extended formulations
|
Braun, Gábor |
|
2018 |
172 |
1-2 |
p. 591-620 |
artikel |
26 |
Submodular unsplittable flow on trees
|
Adamaszek, Anna |
|
2018 |
172 |
1-2 |
p. 565-589 |
artikel |
27 |
Valid inequalities for separable concave constraints with indicator variables
|
Lim, Cong Han |
|
2017 |
172 |
1-2 |
p. 415-442 |
artikel |