Abstract is missing.
- The Cycling Property for the Clutter of Odd st-WalksAhmad Abdi, Bertrand Guenin. 1-12 [doi]
- On Simplex Pivoting Rules and Complexity TheoryIlan Adler, Christos H. Papadimitriou, Aviad Rubinstein. 13-24 [doi]
- A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum CutsHassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne. 25-36 [doi]
- Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf's TheoremIskander Aliev, Jesús A. De Loera, Quentin Louveaux. 37-51 [doi]
- Centrality of Trees for Capacitated k-CenterHyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson. 52-63 [doi]
- Sequence Independent, Simultaneous and Multidimensional Lifting of Generalized Flow Covers for the Semi-Continuous Knapsack Problem with Generalized Upper Bounds ConstraintsAlejandro Angulo, Daniel Espinoza, Rodrigo Palma. 64-75 [doi]
- On the Unique-Lifting PropertyGennadiy Averkov, Amitabh Basu. 76-87 [doi]
- Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic GraphsMourad Baïou, Francisco Barahona. 88-101 [doi]
- n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing ProblemManish Bansal, Kiavash Kianfar. 102-113 [doi]
- On the Adaptivity Gap of Stochastic OrienteeringNikhil Bansal, Viswanath Nagarajan. 114-125 [doi]
- A Utility Equivalence Theorem for Concave FunctionsAnand Bhalgat, Sanjeev Khanna. 126-137 [doi]
- Network Improvement for Equilibrium RoutingUmang Bhaskar, Katrina Ligett, Leonard J. Schulman. 138-149 [doi]
- Finding Small Stabilizers for Unstable GraphsAdrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità. 150-161 [doi]
- The Triangle Splitting Method for Biobjective Mixed Integer ProgrammingNatashia Boland, Hadi Charkhgard, Martin W. P. Savelsbergh. 162-173 [doi]
- Cut Generation through BinarizationPierre Bonami, François Margot. 174-185 [doi]
- A $\frac{5}{4}$ -Approximation for Subcubic 2EC Using CirculationsSylvia Boyd, Yao Fu, Yu Sun. 186-197 [doi]
- Box-Constrained Mixed-Integer Polynomial Optimization Using Separable UnderestimatorsChristoph Buchheim, Claudia D'Ambrosio. 198-209 [doi]
- Submodular Maximization Meets Streaming: Matchings, Matroids, and MoreAmit Chakrabarti, Sagar Kale. 210-221 [doi]
- The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand PairsChandra Chekuri, Alina Ene. 222-233 [doi]
- Reverse Split RankMichele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza. 234-248 [doi]
- Strong LP Formulations for Scheduling Splittable Jobs on Unrelated MachinesJosé R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Victor Verdugo, José Verschae. 249-260 [doi]
- How Good Are Sparse Cutting-Planes?Santanu S. Dey, Marco Molinaro, Qianyi Wang. 261-272 [doi]
- Short Tours through Large Linear ForestsUriel Feige, R. Ravi, Mohit Singh. 273-284 [doi]
- Linear Programming Hierarchies Suffice for Directed Steiner TreeZachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani. 285-296 [doi]
- An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided TiesChien-Chung Huang, Telikepalli Kavitha. 297-308 [doi]
- Simple Extensions of PolytopesVolker Kaibel, Matthias Walter. 309-320 [doi]
- Lower Bounds on the Sizes of Integer Programs without Additional VariablesVolker Kaibel, Stefan Weltge. 321-332 [doi]
- On the Configuration LP for Maximum Budgeted AllocationChristos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, Ola Svensson. 333-344 [doi]
- Two-Term Disjunctions on the Second-Order ConeFatma Kilinç-Karzan, Sercan Yildiz. 345-356 [doi]
- Coupled and k-Sided Placements: Generalizing Generalized AssignmentMadhukar R. Korupolu, Adam Meyerson, Rajmohan Rajaraman, Brian Tagiku. 357-368 [doi]
- A Unified Algorithm for Degree Bounded Survivable Network DesignLap Chi Lau, Hong Zhou. 369-380 [doi]
- Scheduling and Fixed-Parameter TractabilityMatthias Mnich, Andreas Wiese. 381-392 [doi]
- Improved Branch-Cut-and-Price for Capacitated Vehicle RoutingDiego Pecin, Artur Alves Pessoa, Marcus Poggi, Eduardo Uchoa. 393-403 [doi]
- Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial TimeHenning Bruhn, Oliver Schaudt. 404-415 [doi]