| 2011 | A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems. Mario Ruthmair, Günther R. Raidl |
| 2011 | A New Approach to the Stable Set Problem Based on Ellipsoids. Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio |
| 2011 | A Primal-Dual Algorithm for Weighted Abstract Cut Packing. S. Thomas McCormick, Britta Peis |
| 2011 | A Probabilistic Analysis of the Strength of the Split and Triangle Closures. Amitabh Basu, Gérard Cornuéjols, Marco Molinaro |
| 2011 | A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games. Oliver Friedmann |
| 2011 | An Exact Rational Mixed-Integer Programming Solver. William J. Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter |
| 2011 | An Excluded Minor Characterization of Seymour Graphs. Alexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti |
| 2011 | An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming. Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos |
| 2011 | Approximability of Capacitated Network Design. Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula |
| 2011 | Approximation Algorithms for Single and Multi-Commodity Connected Facility Location. Fabrizio Grandoni, Thomas Rothvoß |
| 2011 | Backdoor Branching. Matteo Fischetti, Michele Monaci |
| 2011 | Capacitated Vehicle Routing with Non-uniform Speeds. Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi |
| 2011 | Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes. Yu Hin Au, Levent Tunçel |
| 2011 | Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. Satoru Iwata, Mizuyo Takamatsu |
| 2011 | Constructing Extended Formulations from Reflection Relations. Volker Kaibel, Kanstantsin Pashkovich |
| 2011 | Contact Center Scheduling with Strict Resource Requirements. Aman Dhesi, Pranav Gupta, Amit Kumar, Gyana R. Parija, Sambuddha Roy |
| 2011 | Convexification Techniques for Linear Complementarity Constraints. Trang T. Nguyen, Mohit Tawarmalani, Jean-Philippe P. Richard |
| 2011 | Degree Bounded Forest Covering. Tamás Király, Lap Chi Lau |
| 2011 | Design and Verify: A New Scheme for Generating Cutting-Planes. Santanu S. Dey, Sebastian Pokutta |
| 2011 | Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. Deeparnab Chakrabarty, Chaitanya Swamy |
| 2011 | Fixed-Charge Transportation on a Path: Linear Programming Formulations. Mathieu Van Vyve |
| 2011 | Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings Oktay Günlük, Gerhard J. Woeginger |
| 2011 | Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack. Anna R. Karlin, Claire Mathieu, C. Thach Nguyen |
| 2011 | Iterative Packing for Demand and Hypergraph Matching. Ojas Parekh |
| 2011 | Jump Number of Two-Directional Orthogonal Ray Graphs. José A. Soto, Claudio Telha |
| 2011 | Lift-and-Project Cuts for Mixed Integer Convex Programs. Pierre Bonami |
| 2011 | On the Chvátal-Gomory Closure of a Compact Convex Set. Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma |
| 2011 | Optimal Matching Forests and Valuated Delta-Matroids. Kenjiro Takazawa |
| 2011 | Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. Martin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi |
| 2011 | Safe Lower Bounds for Graph Coloring. Stephan Held, William J. Cook, Edward C. Sewell |
| 2011 | Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità |
| 2011 | TSP on Cubic and Subcubic Graphs. Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie |
| 2011 | Universal Packet Routing with Arbitrary Bandwidths and Transit Times. Britta Peis, Andreas Wiese |
| 2011 | Valid Inequalities for the Pooling Problem with Binary Variables. Claudia D'Ambrosio, Jeff T. Linderoth, James R. Luedtke |