| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A 3-approximation algorithm for the facility location problem with uniform capacities
|
Aggarwal, Ankit
|
|
2012
|
141 |
1-2 |
p. 527-547
|
article
|
| 2 |
A branch-and-cut algorithm for the maximum benefit Chinese postman problem
|
Corberán, Ángel
|
|
2011
|
141 |
1-2 |
p. 21-48
|
article
|
| 3 |
An FPTAS for optimizing a class of low-rank functions over a polytope
|
Mittal, Shashi
|
|
2012
|
141 |
1-2 |
p. 103-120
|
article
|
| 4 |
A polyhedral approach to the single row facility layout problem
|
Amaral, André R. S.
|
|
2012
|
141 |
1-2 |
p. 453-477
|
article
|
| 5 |
A practical relative error criterion for augmented Lagrangians
|
Eckstein, Jonathan
|
|
2012
|
141 |
1-2 |
p. 319-348
|
article
|
| 6 |
A robust optimization approach to experimental design for model discrimination of dynamical systems
|
Skanda, Dominik
|
|
2012
|
141 |
1-2 |
p. 405-433
|
article
|
| 7 |
A simple LP relaxation for the asymmetric traveling salesman problem
|
Nguyen, Thành
|
|
2012
|
141 |
1-2 |
p. 549-559
|
article
|
| 8 |
Computing clique and chromatic number of circular-perfect graphs in polynomial time
|
Pêcher, Arnaud
|
|
2012
|
141 |
1-2 |
p. 121-133
|
article
|
| 9 |
Computing pure Nash and strong equilibria in bottleneck congestion games
|
Harks, Tobias
|
|
2012
|
141 |
1-2 |
p. 193-215
|
article
|
| 10 |
Equations on monotone graphs
|
Robinson, Stephen M.
|
|
2012
|
141 |
1-2 |
p. 49-101
|
article
|
| 11 |
Erratum to: Convex approximations for complete integer recourse models
|
Vlerk, Maarten H. Van der
|
|
2013
|
141 |
1-2 |
p. 601-602
|
article
|
| 12 |
Fast alternating linearization methods for minimizing the sum of two convex functions
|
Goldfarb, Donald
|
|
2012
|
141 |
1-2 |
p. 349-382
|
article
|
| 13 |
Nonsmooth optimization via quasi-Newton methods
|
Lewis, Adrian S.
|
|
2012
|
141 |
1-2 |
p. 135-163
|
article
|
| 14 |
On generalizations of network design problems with degree bounds
|
Bansal, Nikhil
|
|
2012
|
141 |
1-2 |
p. 479-506
|
article
|
| 15 |
On t-branch split cuts for mixed-integer programs
|
Dash, Sanjeeb
|
|
2012
|
141 |
1-2 |
p. 591-599
|
article
|
| 16 |
On the diameter of partition polytopes and vertex-disjoint cycle cover
|
Borgwardt, Steffen
|
|
2011
|
141 |
1-2 |
p. 1-20
|
article
|
| 17 |
Risk averse elastic shape optimization with parametrized fine scale geometry
|
Geihe, Benedict
|
|
2012
|
141 |
1-2 |
p. 383-403
|
article
|
| 18 |
Semidefinite relaxations for non-convex quadratic mixed-integer programming
|
Buchheim, Christoph
|
|
2012
|
141 |
1-2 |
p. 435-452
|
article
|
| 19 |
Simple bounds for recovering low-complexity models
|
Candès, Emmanuel
|
|
2012
|
141 |
1-2 |
p. 577-589
|
article
|
| 20 |
Some properties of convex hulls of integer points contained in general convex sets
|
Dey, Santanu S.
|
|
2012
|
141 |
1-2 |
p. 507-526
|
article
|
| 21 |
Sparse solutions to random standard quadratic optimization problems
|
Chen, Xin
|
|
2012
|
141 |
1-2 |
p. 273-293
|
article
|
| 22 |
Strong lift-and-project cutting planes for the stable set problem
|
Giandomenico, Monia
|
|
2012
|
141 |
1-2 |
p. 165-192
|
article
|
| 23 |
Testing additive integrality gaps
|
Eisenbrand, Friedrich
|
|
2012
|
141 |
1-2 |
p. 257-271
|
article
|
| 24 |
The GUS-property of second-order cone linear complementarity problems
|
Yang, Wei Hong
|
|
2012
|
141 |
1-2 |
p. 295-317
|
article
|
| 25 |
The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
|
Zhao, Ming
|
|
2012
|
141 |
1-2 |
p. 217-255
|
article
|
| 26 |
Unique lifting of integer variables in minimal inequalities
|
Basu, Amitabh
|
|
2012
|
141 |
1-2 |
p. 561-576
|
article
|
Journal description