| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A computational status update for exact rational mixed integer programming
|
Eifler, Leon
|
|
|
197 |
2 |
p. 793-812
|
artikel
|
| 2 |
Affinely representable lattices, stable matchings, and choice functions
|
Faenza, Yuri
|
|
|
197 |
2 |
p. 721-760
|
artikel
|
| 3 |
A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows
|
Graf, Lukas
|
|
|
197 |
2 |
p. 761-792
|
artikel
|
| 4 |
A new integer programming formulation of the graphical traveling salesman problem
|
Carr, Robert
|
|
|
197 |
2 |
p. 877-902
|
artikel
|
| 5 |
Approximating the discrete time-cost tradeoff problem with bounded depth
|
Daboul, Siad
|
|
|
197 |
2 |
p. 529-547
|
artikel
|
| 6 |
A tight approximation algorithm for the cluster vertex deletion problem
|
Aprile, Manuel
|
|
|
197 |
2 |
p. 1069-1091
|
artikel
|
| 7 |
Complexity, exactness, and rationality in polynomial optimization
|
Bienstock, Daniel
|
|
|
197 |
2 |
p. 661-692
|
artikel
|
| 8 |
Computational aspects of relaxation complexity: possibilities and limitations
|
Averkov, Gennadiy
|
|
|
197 |
2 |
p. 1173-1200
|
artikel
|
| 9 |
Exact solution of network flow models with strong relaxations
|
de Lima, VinÃcius Loti
|
|
|
197 |
2 |
p. 813-846
|
artikel
|
| 10 |
Fixed parameter approximation scheme for min-max k-cut
|
Chandrasekaran, Karthekeyan
|
|
|
197 |
2 |
p. 1093-1144
|
artikel
|
| 11 |
Implications, conflicts, and reductions for Steiner trees
|
Rehfeldt, Daniel
|
|
|
197 |
2 |
p. 903-966
|
artikel
|
| 12 |
Improving the approximation ratio for capacitated vehicle routing
|
Blauth, Jannis
|
|
|
197 |
2 |
p. 451-497
|
artikel
|
| 13 |
Lifting convex inequalities for bipartite bilinear programs
|
Gu, Xiaoyi
|
|
|
197 |
2 |
p. 587-619
|
artikel
|
| 14 |
Linear regression with partially mismatched data: local search with theoretical guarantees
|
Mazumder, Rahul
|
|
|
197 |
2 |
p. 1265-1303
|
artikel
|
| 15 |
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
|
Naves, Guyslain
|
|
|
197 |
2 |
p. 1049-1067
|
artikel
|
| 16 |
Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
|
Del Pia, Alberto
|
|
|
197 |
2 |
p. 847-875
|
artikel
|
| 17 |
Online k-taxi via Double Coverage and time-reverse primal-dual
|
Buchbinder, Niv
|
|
|
197 |
2 |
p. 499-527
|
artikel
|
| 18 |
On the geometry of symmetry breaking inequalities
|
Verschae, José
|
|
|
197 |
2 |
p. 693-719
|
artikel
|
| 19 |
On the implementation and strengthening of intersection cuts for QCQPs
|
Chmiela, Antonia
|
|
|
197 |
2 |
p. 549-586
|
artikel
|
| 20 |
On the integrality gap of binary integer programs with Gaussian data
|
Borst, Sander
|
|
|
197 |
2 |
p. 1221-1263
|
artikel
|
| 21 |
Proximity bounds for random integer programs
|
Celaya, Marcel
|
|
|
197 |
2 |
p. 1201-1219
|
artikel
|
| 22 |
Robust k-center with two types of radii
|
Chakrabarty, Deeparnab
|
|
|
197 |
2 |
p. 991-1007
|
artikel
|
| 23 |
Semi-streaming algorithms for submodular matroid intersection
|
Garg, Paritosh
|
|
|
197 |
2 |
p. 967-990
|
artikel
|
| 24 |
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2021
|
Dey, Santanu
|
|
|
197 |
2 |
p. 449-450
|
artikel
|
| 25 |
Speed-robust scheduling: sand, bricks, and rocks
|
Eberle, Franziska
|
|
|
197 |
2 |
p. 1009-1048
|
artikel
|
| 26 |
Sum-of-squares hierarchies for binary polynomial optimization
|
Slot, Lucas
|
|
|
197 |
2 |
p. 621-660
|
artikel
|
| 27 |
The double exponential runtime is tight for 2-stage stochastic ILPs
|
Jansen, Klaus
|
|
|
197 |
2 |
p. 1145-1172
|
artikel
|
Tijdschrift beschrijving