IPCO_220519_1400x300

Accepted Papers

The IPCO proceedings will be made available here. All conference attendees will be given 4 weeks free access at the time of the conference.

IPCO XXI Accepted Papers:

  • Ahmad Abdi, Gérard Cornuéjols, Tony Huynh and Dabeen Lee. Idealness of k-wise intersecting families
  • David Adjiashvili, Felix Hommelsheim and Moritz Muehlenthaler. Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity
  • Hassene Aissi, S. Thomas McCormick and Maurice Queyranne. Faster Algorithms for Parametric Global Minimum Cut Problems
  • Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera and Timm Oertel. Optimizing Sparsity over Lattices and Semigroups
  • Georg Anegg, Haris Angelidakis, Adam Kurpisz and Rico Zenklusen. A Technique for Obtaining True Approximations for k-Center with Covering Constraints
  • Siddharth Barman, Omar Fawzi, Suprovat Ghoshal and Emirhan Gurpinar. Tight Approximation Bounds for Maximum Multi-Coverage
  • Pierre Bonami, Domenico Salvagnin and Andrea Tramontani. Implementing automatic Benders decomposition in a modern MIP solver
  • Thomas Bosman and Neil Olver. Improved Approximation Algorithms for Inventory Problems
  • Michele Conforti, Samuel Fiorini, Tony Huynh and Stefan Weltge. Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
  • Sanjeeb Dash, Oktay Günlük and Dabeen Lee. On a generalization of the Chvátal-Gomory closure
  • Dario Frascaria and Neil Olver. Algorithms for flows over time with scheduling costs
  • Naveen Garg, Nikhil Kumar, András Sebő. Flow-Cut Gaps in Seymour Instances
  • Anupam Gupta, Amit Kumar, Viswanath Nagarajan and Xiangkun Shen. Stochastic Makespan Minimization in Structured Set Systems
  • Tim A. Hartmann, Stefan Lendl and Gerhard J. Woeginger. Continuous facility location on graphs
  • Cheolwon Heo and Bertrand Guenin. Recognizing even-cycle and even-cut matroids
  • Hiroshi Hirai and Yuni Iwamasa. A combinatorial algorithm for computing the rank of a generic partitioned matrix with $2 \times 2$ submatrices
  • Xinrui Jia, Kshiteej Sheth and Ola Svensson. Fair Colorful k-Center Clustering
  • Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter and Ulrike Schmidt-Kraepelin. Popular Branchings and Their Dual Certificates
  • Csaba Király and András Mihálykó. Sparse graphs and an augmentation problem
  • Kim-Manuel Klein. About the Complexity of Two-Stage Stochastic IPs
    (IPCO best paper award)
  • Max Klimm, Marc Pfetsch, Rico Raber and Martin Skutella. Packing under Convex Quadratic Constraints
  • Yusuke Kobayashi. Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles
  • Sarah Morell and Martin Skutella. Single source unsplittable flows with arc-wise lower and upper bounds
  • Benjamin Müller, Gonzalo Muñoz, Maxime Gasse, Ambors Gleixner, Andrea Lodi and Felipe Serrano. On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming
  • Gonzalo Muñoz and Felipe Serrano. Maximal quadratic-free sets
  • Elisabeth Rodrı́guez-Heck, Karl Stickler, Matthias Walter and Stefan Weltge. Persistency of Linear Programming Relaxations for the Stable Set Problem
  • Miriam Schlöter, Joseph Paat and Emily Speakman. Constructing lattice-free gradient polyhedra in dimension two
  • Miriam Schlöter, Joseph Paat and Robert Weismantel. The integrality number of an integer program
  • Xueyu Shi, Oleg Prokopyev and Bo Zeng. Sequence independent lifting for the set of submodular maximization problem
  • Vera Traub and Thorben Tröbst. A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering
  • Willem-Jan Van Hoeve. Graph Coloring Lower Bounds from Decision Diagrams
  • Alex L. Wang and Fatma Kilinc-Karzan. On convex hulls of epigraphs of QCQPs
  • Linchuan Wei, Andres Gomez and Simge Kucukyavuz. On the convexification of constrained quadratic optimization problems with indicator variables