| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A 2-approximation for the bounded treewidth sparsest cut problem in FPT Time
|
Cohen-Addad, Vincent
|
|
|
206 |
1-2 |
p. 479-495
|
artikel
|
| 2 |
A competitive algorithm for throughput maximization on identical machines
|
Moseley, Benjamin
|
|
|
206 |
1-2 |
p. 497-514
|
artikel
|
| 3 |
A constant-factor approximation for generalized malleable scheduling under M♮-concave processing speeds
|
Fotakis, Dimitris
|
|
|
206 |
1-2 |
p. 515-539
|
artikel
|
| 4 |
An abstract model for branch and cut
|
Kazachkov, Aleksandr M.
|
|
|
206 |
1-2 |
p. 175-202
|
artikel
|
| 5 |
A PTAS for the horizontal rectangle stabbing problem
|
Khan, Arindam
|
|
|
206 |
1-2 |
p. 607-630
|
artikel
|
| 6 |
A simple method for convex optimization in the oracle model
|
Dadush, Daniel
|
|
|
206 |
1-2 |
p. 283-304
|
artikel
|
| 7 |
Faster goal-oriented shortest path search for bulk and incremental detailed routing
|
Ahrens, Markus
|
|
|
206 |
1-2 |
p. 3-32
|
artikel
|
| 8 |
Graph coloring and semidefinite rank
|
Mirka, Renee
|
|
|
206 |
1-2 |
p. 577-605
|
artikel
|
| 9 |
Intersecting and dense restrictions of clutters in polynomial time
|
Drees, Martin
|
|
|
206 |
1-2 |
p. 461-477
|
artikel
|
| 10 |
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
|
El Housni, Omar
|
|
|
206 |
1-2 |
p. 239-281
|
artikel
|
| 11 |
Matroid-based TSP rounding for half-integral solutions
|
Gupta, Anupam
|
|
|
206 |
1-2 |
p. 541-576
|
artikel
|
| 12 |
Neural networks with linear threshold activations: structure and algorithms
|
Khalife, Sammy
|
|
|
206 |
1-2 |
p. 333-356
|
artikel
|
| 13 |
On circuit diameter bounds via circuit imbalances
|
Dadush, Daniel
|
|
|
206 |
1-2 |
p. 631-662
|
artikel
|
| 14 |
On computing small variable disjunction branch-and-bound trees
|
Gläser, Max
|
|
|
206 |
1-2 |
p. 145-173
|
artikel
|
| 15 |
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
|
Gaar, Elisabeth
|
|
|
206 |
1-2 |
p. 91-124
|
artikel
|
| 16 |
On the complexity of separating cutting planes for the knapsack polytope
|
Del Pia, Alberto
|
|
|
206 |
1-2 |
p. 33-59
|
artikel
|
| 17 |
On the maximal number of columns of a Δ-modular integer matrix: bounds and computations
|
Averkov, Gennadiy
|
|
|
206 |
1-2 |
p. 61-89
|
artikel
|
| 18 |
Optimal item pricing in online combinatorial auctions
|
Correa, José
|
|
|
206 |
1-2 |
p. 429-460
|
artikel
|
| 19 |
Simple odd β-cycle inequalities for binary polynomial optimization
|
Del Pia, Alberto
|
|
|
206 |
1-2 |
p. 203-238
|
artikel
|
| 20 |
Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
|
Chen, Rui
|
|
|
206 |
1-2 |
p. 357-388
|
artikel
|
| 21 |
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2022
|
Aardal, Karen
|
|
|
206 |
1-2 |
p. 1-2
|
artikel
|
| 22 |
The limits of local search for weighted k-set packing
|
Neuwohner, Meike
|
|
|
206 |
1-2 |
p. 389-427
|
artikel
|
| 23 |
The simultaneous semi-random model for TSP
|
Balkanski, Eric
|
|
|
206 |
1-2 |
p. 305-332
|
artikel
|
| 24 |
Total dual dyadicness and dyadic generating sets
|
Abdi, Ahmad
|
|
|
206 |
1-2 |
p. 125-143
|
artikel
|
Tijdschrift beschrijving