IPCO B

34 papers

YearTitle / Authors
2023A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP.
Billy Jin, Nathan Klein, David P. Williamson
2023A Deterministic Better-than-3/2 Approximation Algorithm for Metric TSP.
Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan
2023A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints.
Noah Weninger, Ricardo Fukasawa
2023A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems.
Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2023A Nearly Optimal Randomized Algorithm for Explorable Heap Selection.
Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
2023Advances on Strictly $\varDelta $-Modular IPs.
Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen
2023An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem.
Satoru Fujishige, Tomonari Kitahara, László A. Végh
2023Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling.
Sven Jäger, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Philipp Warode
2023Compressing Branch-and-Bound Trees.
Gonzalo Muñoz, Joseph Paat, Álinson S. Xavier
2023Configuration Balancing for Stochastic Requests.
Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou
2023Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid.
Richard Santiago, Ivan Sergeev, Rico Zenklusen
2023Cut-Sufficient Directed 2-Commodity Multiflow Topologies.
Joseph Poremba, F. Bruce Shepherd
2023Decomposition of Probability Marginals for Security Games in Abstract Networks.
Jannik Matuschke
2023Designing Optimization Problems with Diverse Solutions.
Oussama Hanguir, Will Ma, Christopher Thomas Ryan
2023Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products.
Ksenia Bestuzheva, Ambros M. Gleixner, Tobias Achterberg
2023Exploiting the Polyhedral Geometry of Stochastic Linear Bilevel Programming.
Gonzalo Muñoz, David Salas, Anton Svensson
2023From Approximate to Exact Integer Programming.
Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
2023Inapproximability of Shortest Paths on Perfect Matching Polytopes.
Jean Cardinal, Raphael Steiner
2023Information Complexity of Mixed-Integer Convex Optimization.
Amitabh Basu, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro
2023Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings
Alberto Del Pia, Volker Kaibel
2023Monoidal Strengthening and Unique Lifting in MIQCPs.
Antonia Chmiela, Gonzalo Muñoz, Felipe Serrano
2023Monoidal Strengthening of Simple
Aleksandr M. Kazachkov, Egon Balas
2023Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.
Da Wei Zheng, Monika Henzinger
2023On the Correlation Gap of Matroids.
Edin Husic, Zhuan Khye Koh, Georg Loho, László A. Végh
2023Optimal General Factor Problem and Jump System Intersection.
Yusuke Kobayashi
2023Optimizing Low Dimensional Functions over the Integers.
Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae
2023ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation.
Christoph Hertrich, Leon Sering
2023Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty.
Christina Büsing, Timo Gersing, Arie M. C. A. Koster
2023Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques.
Nicole Megow, Jens Schlöter
2023Sparse Approximation over the Cube.
Sabrina Bruckmeier, Christoph Hunkenschröder, Robert Weismantel
2023Stabilization of Capacitated Matching Games.
Matthew Gerstbrein, Laura Sanità, Lucy Verberk
2023The Polyhedral Geometry of Truthful Auctions.
Michael Joswig, Max Klimm, Sylvain Spitz
2023Towards a Characterization of Maximal Quadratic-Free Sets.
Gonzalo Muñoz, Joseph Paat, Felipe Serrano
2023Towards an Optimal Contention Resolution Scheme for Matchings.
Pranav Nuti, Jan Vondrák