| 1 | -- | 2 | Karen I. Aardal, Laura Sanità. Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2022 |
| 3 | -- | 32 | Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen. Faster goal-oriented shortest path search for bulk and incremental detailed routing |
| 33 | -- | 59 | Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu. On the complexity of separating cutting planes for the knapsack polytope |
| 61 | -- | 89 | Gennadiy Averkov, Matthias Schymura. On the maximal number of columns of a Δ-modular integer matrix: bounds and computations |
| 91 | -- | 124 | Elisabeth Gaar, Jon Lee 0001, Ivana Ljubic, Markus Sinnl, Kübra Taninmis. On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs |
| 125 | -- | 143 | Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel. Total dual dyadicness and dyadic generating sets |
| 145 | -- | 173 | Max Gläser, Marc E. Pfetsch. On computing small variable disjunction branch-and-bound trees |
| 175 | -- | 202 | Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan 0002. An abstract model for branch and cut |
| 203 | -- | 238 | Alberto Del Pia, Matthias Walter. Simple odd β-cycle inequalities for binary polynomial optimization |
| 239 | -- | 281 | Omar El Housni, Ayoub Foussoul, Vineet Goyal. LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization |
| 283 | -- | 304 | Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge. A simple method for convex optimization in the oracle model |
| 305 | -- | 332 | Eric Balkanski, Yuri Faenza, Mathieu Kubik. The simultaneous semi-random model for TSP |
| 333 | -- | 356 | Sammy Khalife, Hongyu Cheng, Amitabh Basu. Neural networks with linear threshold activations: structure and algorithms |
| 357 | -- | 388 | Rui Chen, James R. Luedtke. Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables |
| 389 | -- | 427 | Meike Neuwohner. The limits of local search for weighted k-set packing |
| 429 | -- | 460 | José Correa 0001, Andrés Cristi, Andrés Fielbaum, Tristan Pollner, S. Matthew Weinberg. Optimal item pricing in online combinatorial auctions |
| 461 | -- | 477 | Martin Drees. Intersecting and dense restrictions of clutters in polynomial time |
| 479 | -- | 495 | Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo. A 2-approximation for the bounded treewidth sparsest cut problem in sfFPT Time |
| 497 | -- | 514 | Benjamin Moseley, Kirk Pruhs, Clifford Stein 0001, Rudy Zhou. A competitive algorithm for throughput maximization on identical machines |
| 515 | -- | 539 | Dimitris Fotakis 0001, Jannik Matuschke, Orestis Papadigenopoulos. A constant-factor approximation for generalized malleable scheduling under $M ^{\natural }$-concave processing speeds |
| 541 | -- | 576 | Anupam Gupta 0001, Euiwoong Lee, Jason Li 0006, Marcin Mucha, Heather Newman, Sherry Sarkar. Matroid-based TSP rounding for half-integral solutions |
| 577 | -- | 605 | Renee Mirka, Devin Smedira, David P. Williamson. Graph coloring and semidefinite rank |
| 607 | -- | 630 | Arindam Khan 0001, Aditya Subramanian, Andreas Wiese. A PTAS for the horizontal rectangle stabbing problem |
| 631 | -- | 662 | Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh. On circuit diameter bounds via circuit imbalances |