| 2010 | On Column-Restricted and Priority Covering Integer Programs. | Deeparnab Chakrabarty, Elyot Grant, Jochen Knemann |
| 2010 | Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. | Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy |
| 2010 | An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming. | Christoph Buchheim, Alberto Caprara, Andrea Lodi |
| 2010 | Secretary Problems via Linear Programming. | Niv Buchbinder, Kamal Jain, Mohit Singh |
| 2010 | A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 2010 | Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems. | Andreas Bley, Jos Neto |
| 2010 | Solving LP Relaxations of Large-Scale Precedence Constrained Problems. | Daniel Bienstock, Mark Zuckerberg |
| 2010 | Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems. | Daniel Bienstock |
| 2010 | The Price of Collusion in Series-Parallel Networks. | Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang |
| 2010 | Restricted | Kristf Brczi, Lszl A. Vgh |
| 2010 | Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain. | Siavosh Benabbas, Avner Magen |
| 2010 | On Lifting Integer Variables in Minimal Inequalities. | Amitabh Basu, Manoel B. Camplo, Michele Conforti, Grard Cornujols, Giacomo Zambelli |
| 2010 | On | Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan |
| 2010 | On Generalizations of Network Design Problems with Degree Bounds. | Nikhil Bansal, Rohit Khandekar, Jochen Knemann, Viswanath Nagarajan, Britta Peis |
| 2010 | Zero-Coefficient Cuts. | Kent Andersen, Robert Weismantel |
| 2010 | Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. | Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi |
| 2010 | A 3-Approximation for Facility Location with Uniform Capacities. | Ankit Aggarwal, Anand Louis, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain |
| 2008 | Can Pure Cutting Plane Algorithms Work?. | Arrigo Zanette, Matteo Fischetti, Egon Balas |
| 2008 | Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints. | Juan Pablo Vielma, George L. Nemhauser |
| 2008 | A Weighted Kt, t-Free t-Factor Algorithm for Bipartite Graphs. | Kenjiro Takazawa |
| 2008 | A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem. | David B. Shmoys, Kunal Talwar |
| 2008 | Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs. | Anureet Saxena, Pierre Bonami, Jon Lee |
| 2008 | Constraint Orbital Branching. | James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio |
| 2008 | A Fast, Simpler Algorithm for the Matroid Parity Problem. | James B. Orlin |
| 2008 | A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs. | Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer |