| 1 | -- | 2 | Alberto Del Pia, Volker Kaibel. Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2023 |
| 3 | -- | 45 | Amitabh Basu, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro 0001. Information complexity of mixed-integer convex optimization |
| 47 | -- | 74 | Ksenia Bestuzheva, Ambros M. Gleixner, Tobias Achterberg. Efficient separation of RLT cuts for implicit and explicit bilinear terms |
| 75 | -- | 96 | Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev. A nearly optimal randomized algorithm for explorable heap selection |
| 97 | -- | 146 | Christina Büsing, Timo Gersing, Arie M. C. A. Koster. Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty |
| 147 | -- | 163 | Jean Cardinal, Raphael Steiner. Inapproximability of shortest paths on perfect matching polytopes |
| 165 | -- | 188 | Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf. A linear time algorithm for linearizing quadratic and higher-order shortest path problems |
| 189 | -- | 222 | Antonia Chmiela, Gonzalo Muñoz 0001, Felipe Serrano 0001. Monoidal strengthening and unique lifting in MIQCPs |
| 223 | -- | 241 | Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss. From approximate to exact integer programming |
| 243 | -- | 279 | Franziska Eberle, Anupam Gupta 0001, Nicole Megow, Benjamin Moseley, Rudy Zhou. Configuration balancing for stochastic requests |
| 281 | -- | 311 | Satoru Fujishige, Tomonari Kitahara, László A. Végh. An update-and-stabilize framework for the minimum-norm-point problem |
| 313 | -- | 334 | Matthew Gerstbrein, Laura Sanità, Lucy Verberk. Stabilization of capacitated matching games |
| 335 | -- | 376 | Oussama Hanguir, Will Ma, Jiangze Han, Christopher Thomas Ryan. Optimizing for strategy diversity in the design of video games |
| 377 | -- | 406 | Christoph Hertrich, Leon Sering. ReLU neural networks of polynomial size for exact maximum flow computation |
| 407 | -- | 456 | Edin Husic, Zhuan Khye Koh, Georg Loho, László A. Végh. On the correlation gap of matroids |
| 457 | -- | 509 | Sven Jäger 0001, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Philipp Warode. Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling |
| 511 | -- | 538 | Billy Jin, Nathan Klein, David P. Williamson. A $\frac{4}{3}$-approximation algorithm for half-integral cycle cut instances of the TSP |
| 539 | -- | 566 | Michael Joswig, Max Klimm, Sylvain Spitz. The polyhedral geometry of truthful auctions |
| 567 | -- | 590 | Aleksandr M. Kazachkov, Egon Balas. V-polyhedral disjunctive cuts |
| 591 | -- | 610 | Yusuke Kobayashi 0001. Optimal general factor problem and jump system intersection |
| 611 | -- | 640 | Jannik Matuschke. Decomposition of probability marginals for security games in max-flow/min-cut systems |
| 641 | -- | 668 | Gonzalo Muñoz 0001, Joseph Paat, Felipe Serrano 0001. A characterization of maximal homogeneous-quadratic-free sets |
| 669 | -- | 694 | Gonzalo Muñoz 0001, Joseph Paat, Álinson S. Xavier. Compressing branch-and-bound trees |
| 695 | -- | 730 | Gonzalo Muñoz 0001, David Salas, Anton Svensson. Exploiting the polyhedral geometry of stochastic linear bilevel programming |
| 731 | -- | 760 | Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen. Advances on strictly Δ-modular IPs |
| 761 | -- | 792 | Pranav Nuti, Jan Vondrák. Towards an optimal contention resolution scheme for matchings |
| 793 | -- | 814 | Joseph Poremba, F. Bruce Shepherd. Cut-sufficient directed 2-commodity multiflow topologies |
| 815 | -- | 846 | Richard Santiago, Ivan Sergeev, Rico Zenklusen. Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid |
| 847 | -- | 879 | Noah Weninger, Ricardo Fukasawa. A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints |
| 881 | -- | 894 | Da-Wei Zheng, Monika Henzinger. Multiplicative auction algorithm for approximate maximum weight bipartite matching |