1. On the diameter of partition polytopes and vertex-disjoint cycle cover

   • Steffen Borgwardt

   Full Length Paper 02 December 2011 Pages: 1 - 20

2. A branch-and-cut algorithm for the maximum benefit Chinese postman problem

   • Ángel Corberán
   • Isaac Plana
   • José M. Sanchis

   Full Length Paper 16 December 2011 Pages: 21 - 48

3. Equations on monotone graphs

   • Stephen M. Robinson

   Full Length Paper 06 January 2012 Pages: 49 - 101

4. An FPTAS for optimizing a class of low-rank functions over a polytope

   • Shashi Mittal
   • Andreas S. Schulz

   Full Length Paper 10 January 2012 Pages: 103 - 120

5. Computing clique and chromatic number of circular-perfect graphs in polynomial time

   • Arnaud Pêcher
   • Annegret K. Wagler

   Full Length Paper 12 January 2012 Pages: 121 - 133

6. Nonsmooth optimization via quasi-Newton methods

   • Adrian S. Lewis
   • Michael L. Overton

   Full Length Paper 16 February 2012 Pages: 135 - 163

7. Strong lift-and-project cutting planes for the stable set problem

   • Monia Giandomenico
   • Fabrizio Rossi
   • Stefano Smriglio

   Full Length Paper 21 January 2012 Pages: 165 - 192

8. Computing pure Nash and strong equilibria in bottleneck congestion games

   • Tobias Harks
   • Martin Hoefer
   • Alexander Skopalik

   Full Length Paper Open access 08 March 2012 Pages: 193 - 215

9. The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints

   • Ming Zhao
   • Ismael Regis de Farias Jr.

   Full Length Paper 17 February 2012 Pages: 217 - 255

10. Testing additive integrality gaps

    • Friedrich Eisenbrand
    • Nicolai Hähnle
    • Gennady Shmonin

    Full Length Paper 26 February 2012 Pages: 257 - 271

11. Sparse solutions to random standard quadratic optimization problems

    • Xin Chen
    • Jiming Peng
    • Shuzhong Zhang

    Full Length Paper 09 March 2012 Pages: 273 - 293

12. The GUS-property of second-order cone linear complementarity problems

    • Wei Hong Yang
    • Xiaoming Yuan

    Full Length Paper 15 March 2012 Pages: 295 - 317

13. A practical relative error criterion for augmented Lagrangians

    • Jonathan Eckstein
    • Paulo J. S. Silva

    Full Length Paper 24 March 2012 Pages: 319 - 348

14. Fast alternating linearization methods for minimizing the sum of two convex functions

    • Donald Goldfarb
    • Shiqian Ma
    • Katya Scheinberg

    Full Length Paper 24 March 2012 Pages: 349 - 382

15. Risk averse elastic shape optimization with parametrized fine scale geometry

    • Benedict Geihe
    • Martin Lenz
    • Rüdiger Schultz

    Full Length Paper 03 April 2012 Pages: 383 - 403

16. A robust optimization approach to experimental design for model discrimination of dynamical systems

    • Dominik Skanda
    • Dirk Lebiedz

    Full Length Paper 29 March 2012 Pages: 405 - 433

17. Semidefinite relaxations for non-convex quadratic mixed-integer programming

    • Christoph Buchheim
    • Angelika Wiegele

    Full Length Paper 30 March 2012 Pages: 435 - 452

18. A polyhedral approach to the single row facility layout problem

    • André R. S. Amaral
    • Adam N. Letchford

    Full Length Paper 21 March 2012 Pages: 453 - 477

19. On generalizations of network design problems with degree bounds

    • Nikhil Bansal
    • Rohit Khandekar
    • Britta Peis

    Full Length Paper 05 April 2012 Pages: 479 - 506

20. Some properties of convex hulls of integer points contained in general convex sets

    • Santanu S. Dey
    • Diego A. Morán R.

    Full Length Paper 17 April 2012 Pages: 507 - 526

21. A 3-approximation algorithm for the facility location problem with uniform capacities

    • Ankit Aggarwal
    • Anand Louis
    • Surabhi Jain

    Full Length Paper 09 June 2012 Pages: 527 - 547

22. A simple LP relaxation for the asymmetric traveling salesman problem

    • Thành Nguyen

    Full Length Paper 15 May 2012 Pages: 549 - 559

23. Unique lifting of integer variables in minimal inequalities

    • Amitabh Basu
    • Manoel Campêlo
    • Giacomo Zambelli

    Full Length Paper 02 June 2012 Pages: 561 - 576

24. Simple bounds for recovering low-complexity models

    • Emmanuel Candès
    • Benjamin Recht

    Short Communication 01 May 2012 Pages: 577 - 589

25. On t-branch split cuts for mixed-integer programs

    • Sanjeeb Dash
    • Oktay Günlük

    Short Communication 24 May 2012 Pages: 591 - 599

26. Erratum to: Convex approximations for complete integer recourse models

    • Maarten H. Van der Vlerk

    Erratum 12 July 2013 Pages: 601 - 602