On the diameter of partition polytopes and vertex-disjoint cycle cover Steffen Borgwardt Full Length Paper 02 December 2011 Pages: 1 - 20
A branch-and-cut algorithm for the maximum benefit Chinese postman problem Ángel CorberánIsaac PlanaJosé M. Sanchis Full Length Paper 16 December 2011 Pages: 21 - 48
An FPTAS for optimizing a class of low-rank functions over a polytope Shashi MittalAndreas S. Schulz Full Length Paper 10 January 2012 Pages: 103 - 120
Computing clique and chromatic number of circular-perfect graphs in polynomial time Arnaud PêcherAnnegret K. Wagler Full Length Paper 12 January 2012 Pages: 121 - 133
Nonsmooth optimization via quasi-Newton methods Adrian S. LewisMichael L. Overton Full Length Paper 16 February 2012 Pages: 135 - 163
Strong lift-and-project cutting planes for the stable set problem Monia GiandomenicoFabrizio RossiStefano Smriglio Full Length Paper 21 January 2012 Pages: 165 - 192
Computing pure Nash and strong equilibria in bottleneck congestion games Tobias HarksMartin HoeferAlexander Skopalik Full Length Paper Open access 08 March 2012 Pages: 193 - 215
The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints Ming ZhaoIsmael Regis de Farias Jr. Full Length Paper 17 February 2012 Pages: 217 - 255
Testing additive integrality gaps Friedrich EisenbrandNicolai HähnleGennady Shmonin Full Length Paper 26 February 2012 Pages: 257 - 271
Sparse solutions to random standard quadratic optimization problems Xin ChenJiming PengShuzhong Zhang Full Length Paper 09 March 2012 Pages: 273 - 293
The GUS-property of second-order cone linear complementarity problems Wei Hong YangXiaoming Yuan Full Length Paper 15 March 2012 Pages: 295 - 317
A practical relative error criterion for augmented Lagrangians Jonathan EcksteinPaulo J. S. Silva Full Length Paper 24 March 2012 Pages: 319 - 348
Fast alternating linearization methods for minimizing the sum of two convex functions Donald GoldfarbShiqian MaKatya Scheinberg Full Length Paper 24 March 2012 Pages: 349 - 382
Risk averse elastic shape optimization with parametrized fine scale geometry Benedict GeiheMartin LenzRüdiger Schultz Full Length Paper 03 April 2012 Pages: 383 - 403
A robust optimization approach to experimental design for model discrimination of dynamical systems Dominik SkandaDirk Lebiedz Full Length Paper 29 March 2012 Pages: 405 - 433
Semidefinite relaxations for non-convex quadratic mixed-integer programming Christoph BuchheimAngelika Wiegele Full Length Paper 30 March 2012 Pages: 435 - 452
A polyhedral approach to the single row facility layout problem André R. S. AmaralAdam N. Letchford Full Length Paper 21 March 2012 Pages: 453 - 477
On generalizations of network design problems with degree bounds Nikhil BansalRohit KhandekarBritta Peis Full Length Paper 05 April 2012 Pages: 479 - 506
Some properties of convex hulls of integer points contained in general convex sets Santanu S. DeyDiego A. Morán R. Full Length Paper 17 April 2012 Pages: 507 - 526
A 3-approximation algorithm for the facility location problem with uniform capacities Ankit AggarwalAnand LouisSurabhi Jain Full Length Paper 09 June 2012 Pages: 527 - 547
A simple LP relaxation for the asymmetric traveling salesman problem Thành Nguyen Full Length Paper 15 May 2012 Pages: 549 - 559
Unique lifting of integer variables in minimal inequalities Amitabh BasuManoel CampêloGiacomo Zambelli Full Length Paper 02 June 2012 Pages: 561 - 576
Simple bounds for recovering low-complexity models Emmanuel CandèsBenjamin Recht Short Communication 01 May 2012 Pages: 577 - 589
On t-branch split cuts for mixed-integer programs Sanjeeb DashOktay Günlük Short Communication 24 May 2012 Pages: 591 - 599
Erratum to: Convex approximations for complete integer recourse models Maarten H. Van der Vlerk Erratum 12 July 2013 Pages: 601 - 602