2023

2023: IPCO XXIV in Madison, USA Website Program Committee: Merve Bodur, University of Toronto José Correa, Universidad de Chile Alberto Del Pia, University of Wisconsin-Madison Yuri Faenza, Columbia University Volker Kaibel, OVGU Magdeburg (Chair) Simge Küçükyavuz, Northwestern University Andrea Lodi, Cornell Tech Diego Moran, Universidad Adolfo Ibañez Giacomo Nannicini, IBM Research Britta Peis, RWTH Aachen Mohit Singh, Georgia Tech Martin Skutella, TU Berlin Juan Pablo Vielma, Google Jens Vygen, Universität Bonn Stefan Weltge, TU München Giacomo Zambelli, London School of Economics Accepted Papers: Sabrina Bruckmeier, Christoph Hunkenschröder and Robert Weismantel. Sparse Approximation Over the Cube Yusuke Kobayashi. Optimal General Factor Problem and Jump System Intersection Jean Cardinal and Raphael Steiner. Inapproximability of shortest paths on perfect matching polytopes Da Wei Zheng and Monika Henzinger. Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching Billy Jin, Nathan Klein and David Williamson. A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP Christina Büsing, Timo Gersing and Arie Koster. Recycling Inequalities for Robust Combinatorial Optimization Nicole Megow and Jens Schlöter. Set Selection under Explorable Stochastic Uncertainty via Covering Techniques Matthew Gerstbrein, Laura Sanità and Lucy Verberk. Stabilization of Capacitated Matching Games Martin Nägele, Christian Nöbel, Richard Santiago and Rico Zenklusen. Advances on Strictly Δ-Modular IPs Sander Borst, Daniel Dadush, Sophie Huiberts and Danish Kashaev. A nearly optimal randomized algorithm for explorable heap selection Michael Joswig, Max Klimm and Sylvain Spitz. The Polyhedral Geometry of Truthful Auctions Satoru Fujshige, Tomonari Kitahara and László Végh. An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley and Rudy Zhou. Configuration Balancing for Stochastic Requests Edin Husić, Zhuan Khye Koh, Georg Loho and László A. Végh. On the Correlation Gap of Matroids Christoph Hertrich and Leon Sering. ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation Gonzalo Muñoz, Joseph Paat and Álinson S. Xavier. Compressing Branch-and-Bound Trees Oussama Hanguir, Will Ma and Christopher Thomas Ryan. Designing Optimization Problems with Diverse Solutions Ksenia Bestuzheva, Ambros Gleixner and Tobias Achterberg. Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products Noah Weninger and Ricardo Fukasawa. A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints Richard Santiago, Ivan Sergeev and Rico Zenklusen. Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid. Amitabh Basu, Hongyi Jiang, Phillip Kerger and Marco Molinaro. Information complexity of mixed-integer convex optimization Gonzalo Muñoz, David Salas and Anton Svensson. Exploiting the polyhedral geometry of stochastic linear bilevel programming Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard Woeginger and Lasse Wulf. A linear time algorithm for linearizing quadratic and higher-order shortest path problems Jannik Matuschke. Decomposition of Probability Marginals for Security Games in Abstract Networks Daniel Dadush, Friedrich Eisenbrand and Thomas Rothvoss. From approximate to exact integer programming Sven Jäger, Guillaume Sagnol, Daniel Schmidt Genannt Waldschmidt and Philipp Warode. Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling Daniel Dadush, Arthur Leonard, Lars Rohwedder and Jose Verschae. Optimizing Low Dimensional Functions over the Integers Pranav Nuti and Jan Vondrák. Towards an Optimal Contention Resolution Scheme for Matchings Anna Karlin, Nathan Klein and Shayan Oveis Gharan. A Deterministic Better-than-3/2 Approximation Algorithm for Metric TSP Gonzalo Muñoz, Joseph Paat and Felipe Serrano. Towards a characterization of maximal quadratic-free sets Joseph Poremba and F. Bruce Shepherd. Cut-Sufficient Directed 2-Commodity Multiflow Topologies Aleksandr M. Kazachkov and Egon Balas. Monoidal Strengthening of V-Polyhedral Disjunctive Cuts Antonia Chmiela, Gonzalo Muñoz and Felipe Serrano. Monoidal strengthening and unique lifting in MIQCPs