Accepted Papers (IPCO 2019)

  • Ky Vu, Pierre-Louis Poirion, Claudia D'Ambrosio and Leo Liberti.
    Random projections for quadratic programs over a Euclidean ball
  • Joseph Paat, Timm Oertel and Robert Weismantel. 
    Sparsity of integer solutions in the average case
  • Justin Toth, Kanstantsin Pashkovich and Jochen Koenemann. 
    Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
  • Yann Disser and Alexander V. Hopp.
    On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule
  • Anna Köhne, Vera Traub and Jens Vygen.
    The asymmetric traveling salesman path LP has constant integrality ratio
  • Federico Della Croce and Rosario Scatamacchia.
    Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints
  • Ahmad Abdi, Gerard Cornuejols and Dabeen Lee.
    Identically self-blocking clutters
  • Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior and Clifford Stein. 
    A general framework for handling commitment in online admission control
  • Miriam Schlöter.
    Earliest Arrival Transshipments in Networks With Multiple Sinks
  • Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király and Vivek Madan.
    Improving the Integrality Gap for Multiway Cut
  • Anupam Gupta, Haotian Jiang, Ziv Scully and Sahil Singla.
    The Markovian Price of Information
  • Szymon Dudycz, Mateusz Lewandowski and Jan Marcinkowski.
    Tight Approximation Ratio for Minimum Maximal Matching
  • Niv Buchbinder, Moran Feldman, Yuval Filmus and Mohit Garg. 
    Online Submodular Maximization: Beating 1/2 Made Simple
  • Elisabeth Gaar and Franz Rendl.
    A Bundle Approach for SDPs with Exact Subgraph Constraints
  • André Linhares, Neil Olver, Chaitanya Swamy and Rico Zenklusen.
    Approximate Multi-Matroid Intersection via Iterative Refinement
  • Lukas Graf and Tobias Harks.
    Dynamic Flows with Adaptive Route Choice
  • Ross Anderson, Joey Huchette, Christian Tjandraatmadja and Juan Pablo Vielma.
    Strong mixed-integer programming formulations for trained neural networks
  • Robert Hildebrand, Matthias Koeppe and Yuan Zhou.
    On perturbation spaces of minimal valid functions: Inverse semigroup theory and equivariant decomposition theorem
  • Zhuan Khye Koh and Laura Sanità.
    An Efficient Characterization of Submodular Spanning Tree Games
  • Manuel Aprile and Yuri Faenza.
    Extended formulations from communication protocols in output-efficient time
  • Christoph Hunkenschröder, Matthias Schymura and Gina Reuland.
    On compact representations of Voronoi cells
  • Martin Nägele and Rico Zenklusen. 
    A New Contraction Technique with Applications to Congruency-Constrained Cuts
  • Saba Ahmadi, Samir Khuller and Barna Saha.
    Min-Max Correlation Clustering via MultiCut
  • Eduard Eiben, Robert Ganian, Sebastian Ordyniak, Michal Philipczuk and Marcin Wrochna.
    Integer Programming and Incidence Treedepth
  • Victor Verdugo and José Verschae.
    Breaking symmetries to rescue SoS: The case of makespan scheduling
  • Thomas Bosman, Dario Frascaria, Neil Olver, René Sitters and Leen Stougie.
    Fixed-Order Scheduling on Parallel Machines
  • Artur Pessoa, Ruslan Sadykov, Eduardo Uchoa and Francois Vanderbeck.
    A Generic Exact Solver for Vehicle Routing and Related Problems
  • Felipe Serrano.
    Intersection cuts for factorable MINLP
  • Pascale Bendotti, Pierre Fouilhoux and Cécile Rottner.
    Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry
  • Daniel Bienstock, Chen Chen and Gonzalo Muñoz.
    Intersection Cuts for Polynomial Optimization
  • Chandra Chekuri, Kent Quanrud and Manuel Torres. 
    L1-sparsity Approximation Bounds for Packing Integer Programs
  • Giacomo Nannicini, Giorgio Sartor, Emiliano Traversi and Roberto Wolfler-Calvo.
    An exact algorithm for robust influence maximization
  • Dan Steffy and Ambros Gleixner.
    Linear Programming using Limited-Precision Oracles