| 2011 | Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. | Deeparnab Chakrabarty, Chaitanya Swamy |
| 2011 | Approximability of Capacitated Network Design. | Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula |
| 2011 | TSP on Cubic and Subcubic Graphs. | Sylvia C. Boyd, Ren Sitters, Suzanne van der Ster, Leen Stougie |
| 2011 | Lift-and-Project Cuts for Mixed Integer Convex Programs. | Pierre Bonami |
| 2011 | Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. | Martin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lbbecke, Enrico Malaguti, Emiliano Traversi |
| 2011 | A Probabilistic Analysis of the Strength of the Split and Triangle Closures. | Amitabh Basu, Grard Cornujols, Marco Molinaro |
| 2011 | Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes. | Yu Hin Au, Levent Tunel |
| 2011 | An Excluded Minor Characterization of Seymour Graphs. | Alexander A. Ageev, Yohann Benchetrit, Andrs Seb, Zoltn Szigeti |
| 2010 | A Polyhedral Study of the Mixed Integer Cut. | Steve Tyber, Ellis L. Johnson |
| 2010 | Efficient Algorithms for Average Completion Time Scheduling. | Ren Sitters |
| 2010 | On the Rank of Cutting-Plane Proof Systems. | Sebastian Pokutta, Andreas S. Schulz |
| 2010 | An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs. | James R. Luedtke |
| 2010 | Integer Quadratic Quasi-polyhedra. | Adam N. Letchford |
| 2010 | Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities. | Lap Chi Lau, Chun Kong Yung |
| 2010 | Symmetry Matters for the Sizes of Extended Formulations. | Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis |
| 2010 | Branched Polyhedral Systems. | Volker Kaibel, Andreas Loos |
| 2010 | An | Klaus Jansen, Roberto Solis-Oba |
| 2010 | A Polynomial-Time Algorithm for Optimizing over | Raymond Hemmecke, Matthias Kppe, Robert Weismantel |
| 2010 | Prize-Collecting Steiner Network Problems. | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
| 2010 | Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings. | Takuro Fukunaga |
| 2010 | Hitting Diamonds and Growing Cacti. | Samuel Fiorini, Gwenal Joret, Ugo Pietropaoli |
| 2010 | Universal Sequencing on a Single Machine. | Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julin Mestre, Martin Skutella, Leen Stougie |
| 2010 | The Chvtal-Gomory Closure of an Ellipsoid Is a Polyhedron. | Santanu S. Dey, Juan Pablo Vielma |
| 2010 | Experiments with Two Row Tableau Cuts. | Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey |
| 2010 | Hypergraphic LP Relaxations for Steiner Trees. | Deeparnab Chakrabarty, Jochen Knemann, David Pritchard |