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