| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
About the complexity of two-stage stochastic IPs
|
Klein, Kim-Manuel
|
|
|
192 |
1-2 |
p. 319-337
|
artikel
|
| 2 |
A fast (2+27)-approximation algorithm for capacitated cycle covering
|
Traub, Vera
|
|
|
192 |
1-2 |
p. 497-518
|
artikel
|
| 3 |
Algorithms for flows over time with scheduling costs
|
Frascaria, Dario
|
|
|
192 |
1-2 |
p. 177-206
|
artikel
|
| 4 |
A technique for obtaining true approximations for k-center with covering constraints
|
Anegg, Georg
|
|
|
192 |
1-2 |
p. 3-27
|
artikel
|
| 5 |
Constructing lattice-free gradient polyhedra in dimension two
|
Paat, Joseph
|
|
|
192 |
1-2 |
p. 293-317
|
artikel
|
| 6 |
Continuous facility location on graphs
|
Hartmann, Tim A.
|
|
|
192 |
1-2 |
p. 207-227
|
artikel
|
| 7 |
Correction to: Idealness of k-wise intersecting families
|
Abdi, Ahmad
|
|
|
192 |
1-2 |
p. 51-55
|
artikel
|
| 8 |
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
|
Conforti, Michele
|
|
|
192 |
1-2 |
p. 547-566
|
artikel
|
| 9 |
Fair colorful k-center clustering
|
Jia, Xinrui
|
|
|
192 |
1-2 |
p. 339-360
|
artikel
|
| 10 |
Flexible Graph Connectivity
|
Adjiashvili, David
|
|
|
192 |
1-2 |
p. 409-441
|
artikel
|
| 11 |
Graph coloring with decision diagrams
|
van Hoeve, Willem-Jan
|
|
|
192 |
1-2 |
p. 631-674
|
artikel
|
| 12 |
Ideal formulations for constrained convex optimization problems with indicator variables
|
Wei, Linchuan
|
|
|
192 |
1-2 |
p. 57-88
|
artikel
|
| 13 |
Idealness of k-wise intersecting families
|
Abdi, Ahmad
|
|
|
192 |
1-2 |
p. 29-50
|
artikel
|
| 14 |
Maximal quadratic-free sets
|
Muñoz, Gonzalo
|
|
|
192 |
1-2 |
p. 229-270
|
artikel
|
| 15 |
On a generalization of the Chvátal–Gomory closure
|
Dash, Sanjeeb
|
|
|
192 |
1-2 |
p. 149-175
|
artikel
|
| 16 |
On generalized surrogate duality in mixed-integer nonlinear programming
|
Müller, Benjamin
|
|
|
192 |
1-2 |
p. 89-118
|
artikel
|
| 17 |
Packing under convex quadratic constraints
|
Klimm, Max
|
|
|
192 |
1-2 |
p. 361-386
|
artikel
|
| 18 |
Persistency of linear programming relaxations for the stable set problem
|
Rodríguez-Heck, Elisabeth
|
|
|
192 |
1-2 |
p. 387-407
|
artikel
|
| 19 |
Popular branchings and their dual certificates
|
Kavitha, Telikepalli
|
|
|
192 |
1-2 |
p. 567-595
|
artikel
|
| 20 |
Single source unsplittable flows with arc-wise lower and upper bounds
|
Morell, Sarah
|
|
|
192 |
1-2 |
p. 477-496
|
artikel
|
| 21 |
Sparse graphs and an augmentation problem
|
Király, Csaba
|
|
|
192 |
1-2 |
p. 119-148
|
artikel
|
| 22 |
Sparse representation of vectors in lattices and semigroups
|
Aliev, Iskander
|
|
|
192 |
1-2 |
p. 519-546
|
artikel
|
| 23 |
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020
|
Bienstock, Daniel
|
|
|
192 |
1-2 |
p. 1-2
|
artikel
|
| 24 |
Stochastic makespan minimization in structured set systems
|
Gupta, Anupam
|
|
|
192 |
1-2 |
p. 597-630
|
artikel
|
| 25 |
The integrality number of an integer program
|
Paat, Joseph
|
|
|
192 |
1-2 |
p. 271-291
|
artikel
|
| 26 |
Tight approximation bounds for maximum multi-coverage
|
Barman, Siddharth
|
|
|
192 |
1-2 |
p. 443-476
|
artikel
|
| 27 |
Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles
|
Kobayashi, Yusuke
|
|
|
192 |
1-2 |
p. 675-702
|
artikel
|
Tijdschrift beschrijving