2019

2019: IPCO XX in Ann Arbor, Michigan Website Program Committee: Amitabh Basu (Johns Hopkins U) Pierre Bonami (IBM) Jose Correa (U Chile) Sanjeeb Dash (IBM) Volker Kaibel (U Magdeburg) Simge Küçükyavuz (U Washington) Retsef Levi (Massachusetts Institute of Technology) James Luedtke (U Wisconsin-Madison) Andrea Lodi (Polytechnique Montreal, Chair) Tom McCormick (U British Columbia) Ruth Misener (Imperial College London) Viswanath Nagarajan (U Michigan) Marc Pfetsch (TU Darmstadt) Martin Skutella (TU Berlin) Gautier Stauffer (Kedge Business School) Angelika Wiegele (U Klagenfurt) Accepted Papers: Ahmad Abdi, Gérard Cornuéjols and Dabeen Lee. Identically Self-blocking Clutters Saba Ahmadi, Samir Khuller and Barna Saha. Min-Max Correlation Clustering via MultiCut Ross Anderson, Joey Huchette, Christian Tjandraatmadja and Juan Pablo Vielma. Strong Mixed-Integer Programming Formulations for Trained Neural Networks Manuel Aprile and Yuri Faenza. Extended Formulations from Communication Protocols in Output-Efficient Time 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 Thomas Bosman, Dario Frascaria, Neil Olver, René Sitters and Leen Stougie. Fixed-Order Scheduling on Parallel Machines Niv Buchbinder, Moran Feldman, Yuval Filmus and Mohit Garg. Online Submodular Maximization: Beating 1/2 Made Simple Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király and Vivek Madan. Improving the Integrality Gap for Multiway Cut Chandra Chekuri, Kent Quanrud and Manuel R. Torres. ℓ1-sparsity Approximation Bounds for Packing Integer Programs Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior and Cliff Stein. A General Framework for Handling Commitment in Online Throughput Maximization Federico Della Croce and Rosario Scatamacchia. Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints Yann Disser and Alexander V. Hopp. On Friedmann’s Subexponential Lower Bound for Zadeh’s Pivot Rule Szymon Dudycz, Mateusz Lewandowski and Jan Marcinkowski. Tight Approximation Ratio for Minimum Maximal Matching Eduard Eiben, Robert Ganian, Dušan Knop, Sebastian Ordyniak, Michał Pilipczuk and Marcin Wrochna. Integer Programming and Incidence Treedepth Elisabeth Gaar and Franz Rendl. A Bundle Approach for SDPs with Exact Subgraph Constraints Lukas Graf and Tobias Harks. Dynamic Flows with Adaptive Route Choice Anupam Gupta, Haotian Jiang, Ziv Scully and Sahil Singla. The Markovian Price of Information Robert Hildebrand, Matthias Köppe and Yuan Zhou. On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem Christoph Hunkenschröder, Gina Reuland and Matthias Schymura. On Compact Representations of Voronoi Cells of Lattices Zhuan Khye Koh and Laura Sanità. An Efficient Characterization of Submodular Spanning Tree Games Anna Köhne, Vera Traub and Jens Vygen. The Asymmetric Traveling Salesman Path LP Has Constant Integrality Ratio André Linhares, Neil Olver, Chaitanya Swamy and Rico Zenklusen. Approximate Multi-matroid Intersection via Iterative Refinement Giacomo Nannicini, Giorgio Sartor, Emiliano Traversi and Roberto Wolfler-Calvo. An Exact Algorithm for Robust Influence Maximization Martin Nägele and Rico Zenklusen. A New Contraction Technique with Applications to Congruency-Constrained Cuts Timm Oertel, Joseph Paat and Robert Weismantel. Sparsity of Integer Solutions in the Average Case Artur Pessoa, Ruslan Sadykov, Eduardo Uchoa and François Vanderbeck. A Generic Exact Solver for Vehicle Routing and Related Problems Miriam Schlöter. Earliest Arrival Transshipments in Networks with Multiple Sinks Felipe Serrano. Intersection Cuts for Factorable MINLP Ambros Gleixner and Daniel E. Steffy. Linear Programming Using Limited-Precision Oracles Jochen Könemann, Kanstantsin Pashkovich and Justin Toth. Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time Victor Verdugo and José Verschae. Breaking Symmetries to Rescue Sum of Squares: The Case of Makespan Scheduling Ky Vu, Pierre-Louis Poirion, Claudia D’Ambrosio and Leo Liberti. Random Projections for Quadratic Programs over a Euclidean Ball