Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 1496.90005].
Indexed articles:
Blauth, Jannis; Traub, Vera; Vygen, Jens, Improving the approximation ratio for capacitated vehicle routing, 1-14 [Zbl 1482.90119]
Buchbinder, Niv; Coester, Christian; Naor, Joseph Seffi, Online \(k\)-taxi via double coverage and time-reverse primal-dual, 15-29 [Zbl 1482.90177]
Daboul, Siad; Held, Stephan; Vygen, Jens, Approximating the discrete time-cost tradeoff problem with bounded depth, 30-42 [Zbl 1482.90179]
Slot, Lucas; Laurent, Monique, Sum-of-squares hierarchies for binary polynomial optimization, 43-57 [Zbl 1482.90142]
Bienstock, Daniel; Del Pia, Alberto; Hildebrand, Robert, Complexity, exactness, and rationality in polynomial optimization, 58-72 [Zbl 1482.90141]
Verschae, José; Villagra, Matías; von Niederhäusern, Léonard, On the geometry of symmetry breaking inequalities, 73-88 [Zbl 1482.90124]
Faenza, Yuri; Zhang, Xuan, Affinely representable lattices, stable matchings, and choice functions, 89-103 [Zbl 1482.90181]
Graf, Lukas; Harks, Tobias, A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows, 104-118 [Zbl 1482.91055]
Iwamasa, Yuni, A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices, 119-133 [Zbl 1483.15003]
Chmiela, Antonia; Muñoz, Gonzalo; Serrano, Felipe, On the implementation and strengthening of intersection cuts for QCQPs, 134-147 [Zbl 1482.90131]
Gu, Xiaoyi; Dey, Santanu S.; Richard, Jean-Philippe P., Lifting convex inequalities for bipartite bilinear programs, 148-162 [Zbl 1482.90132]
Eifler, Leon; Gleixner, Ambros, A computational status update for exact rational mixed integer programming, 163-177 [Zbl 1482.90125]
de Lima, Vinícius L.; Iori, Manuel; Miyazawa, Flávio K., New exact techniques applied to a class of network flow formulations, 178-192 [Zbl 1482.90228]
Del Pia, Alberto; Linderoth, Jeff; Zhu, Haoran, Multi-cover inequalities for totally-ordered multiple knapsack sets, 193-207 [Zbl 1482.90180]
Garg, Paritosh; Jordan, Linus; Svensson, Ola, Semi-streaming algorithms for submodular matroid intersection, 208-222 [Zbl 1490.90245]
Matoya, Kazuki; Oki, Taihei, Pfaffian pairs and parities: counting on linear matroid intersection and parity problems, 223-237 [Zbl 1482.90231]
Glanzer, Christoph; Stallknecht, Ingo; Weismantel, Robert, On the recognition of \(\{a,b,c\}\)-modular matrices, 238-251 [Zbl 1484.15038]
El Housni, Omar; Goyal, Vineet; Shmoys, David, On the power of static assignment policies for robust facility location problems, 252-267 [Zbl 1483.90071]
Chakrabarty, Deeparnab; Negahbani, Maryam, Robust \(k\)-center with two types of radii, 268-282 [Zbl 1482.90178]
Eberle, Franziska; Hoeksma, Ruben; Megow, Nicole; Nölke, Lukas; Schewior, Kevin; Simon, Bertrand, Speed-robust scheduling. Sand, bricks, and rocks, 283-296 [Zbl 1483.90052]
Jansen, Klaus; Klein, Kim-Manuel; Lassota, Alexandra, The double exponential runtime is tight for 2-stage stochastic ILPs, 297-310 [Zbl 1482.90122]
Nannicini, Giacomo, Fast quantum subroutines for the simplex method, 311-325 [Zbl 1482.90244]
Naves, Guyslain; Shepherd, Bruce; Xia, Henry, Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators, 326-339 [Zbl 1482.90232]
Aprile, Manuel; Drescher, Matthew; Fiorini, Samuel; Huynh, Tony, A tight approximation algorithm for the cluster vertex deletion problem, 340-353 [Zbl 1482.90176]
Chandrasekaran, Karthekeyan; Wang, Weihang, Fixed parameter approximation scheme for min-max \(k\)-cut, 354-367 [Zbl 1483.90133]
Averkov, Gennadiy; Hojny, Christopher; Schymura, Matthias, Computational aspects of relaxation complexity, 368-382 [Zbl 1497.90223]
Basu, Amitabh; Conforti, Michele; Di Summa, Marco; Jiang, Hongyi, Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II, 383-398 [Zbl 1483.90083]
Walter, Matthias, Face dimensions of general-purpose cutting planes for mixed-integer linear programs, 399-412 [Zbl 1483.90087]
Celaya, Marcel; Henk, Martin, Proximity bounds for random integer programs, 413-426 [Zbl 1483.90080]
Borst, Sander; Dadush, Daniel; Huiberts, Sophie; Tiwari, Samarth, On the integrality gap of binary integer programs with Gaussian data, 427-442 [Zbl 1483.90079]
Mazumder, Rahul; Wang, Haoyue, Linear regression with mismatched data: a provably optimal local search algorithm, 443-457 [Zbl 1483.90141]
Carr, Robert D.; Simonetti, Neil, A new integer programming formulation of the graphical traveling salesman problem, 458-472 [Zbl 1483.90132]
Rehfeldt, Daniel; Koch, Thorsten, Implications, conflicts, and reductions for Steiner trees, 473-487 [Zbl 1483.90144]