Abstract is missing.
- Idealness of k-wise Intersecting FamiliesAhmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee. 1-12 [doi]
- Flexible Graph ConnectivityDavid Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler. 13-26 [doi]
- Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum CutsHassene Aissi, S. Thomas McCormick, Maurice Queyranne. 27-39 [doi]
- Optimizing Sparsity over Lattices and SemigroupsIskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel. 40-51 [doi]
- A Technique for Obtaining True Approximations for k-Center with Covering ConstraintsGeorg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen. 52-65 [doi]
- Tight Approximation Bounds for Maximum Multi-coverageSiddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar. 66-77 [doi]
- Implementing Automatic Benders Decomposition in a Modern MIP SolverPierre Bonami, Domenico Salvagnin, Andrea Tramontani. 78-90 [doi]
- Improved Approximation Algorithms for Inventory ProblemsThomas Bosman, Neil Olver. 91-103 [doi]
- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd CyclesMichele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge. 104-116 [doi]
- On a Generalization of the Chvátal-Gomory ClosureSanjeeb Dash, Oktay Günlük, Dabeen Lee. 117-129 [doi]
- Algorithms for Flows over Time with Scheduling CostsDario Frascaria, Neil Olver. 130-143 [doi]
- Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-ApproximationNaveen Garg, Nikhil Kumar, András Sebö. 144-157 [doi]
- Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract)Anupam Gupta, Amit Kumar 0001, Viswanath Nagarajan, Xiangkun Shen. 158-170 [doi]
- Continuous Facility Location on GraphsTim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger. 171-181 [doi]
- Recognizing Even-Cycle and Even-Cut MatroidsCheolwon Heo, Bertrand Guenin. 182-195 [doi]
- A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 ˟ 2 SubmatricesHiroshi Hirai 0001, Yuni Iwamasa. 196-208 [doi]
- Fair Colorful k-Center ClusteringXinrui Jia, Kshiteej Sheth, Ola Svensson. 209-222 [doi]
- Popular Branchings and Their Dual CertificatesTelikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin. 223-237 [doi]
- Sparse Graphs and an Augmentation ProblemCsaba Király, András Mihálykó. 238-251 [doi]
- About the Complexity of Two-Stage Stochastic IPsKim-Manuel Klein. 252-265 [doi]
- Packing Under Convex Quadratic ConstraintsMax Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella. 266-279 [doi]
- Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden TrianglesYusuke Kobayashi. 280-293 [doi]
- Single Source Unsplittable Flows with Arc-Wise Lower and Upper BoundsSarah Morell, Martin Skutella. 294-306 [doi]
- Maximal Quadratic-Free SetsGonzalo Muñoz, Felipe Serrano. 307-321 [doi]
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear ProgrammingBenjamin Müller 0002, Gonzalo Muñoz, Maxime Gasse, Ambros M. Gleixner, Andrea Lodi 0001, Felipe Serrano. 322-337 [doi]
- The Integrality Number of an Integer ProgramJoseph Paat, Miriam Schlöter, Robert Weismantel. 338-350 [doi]
- Persistency of Linear Programming Relaxations for the Stable Set ProblemElisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter, Stefan Weltge. 351-363 [doi]
- Constructing Lattice-Free Gradient Polyhedra in Dimension TwoJoseph Paat, Miriam Schlöter, Emily Speakman. 364-377 [doi]
- Sequence Independent Lifting for the Set of Submodular Maximization ProblemXueyu Shi, Oleg A. Prokopyev, Bo Zeng 0001. 378-390 [doi]
- A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle CoveringVera Traub, Thorben Tröbst. 391-404 [doi]
- Graph Coloring Lower Bounds from Decision DiagramsWillem Jan van Hoeve. 405-418 [doi]
- On Convex Hulls of Epigraphs of QCQPsAlex L. Wang, Fatma Kilinç-Karzan. 419-432 [doi]
- On the Convexification of Constrained Quadratic Optimization Problems with Indicator VariablesLinchuan Wei, Andrés Gómez 0001, Simge Küçükyavuz. 433-447 [doi]