An FPTAS for optimizing a class of low-rank functions over a polytope.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 103, doi. 10.1007/s10107-011-0511-x
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2013 AND VI 141 AND IP 1/2
Results: 26
1
2
Strong lift-and-project cutting planes for the stable set problem.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 165, doi. 10.1007/s10107-012-0513-3
- By:
- Publication type:
- Article
3
The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 217, doi. 10.1007/s10107-012-0517-z
- By:
- Publication type:
- Article
4
Testing additive integrality gaps.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 257, doi. 10.1007/s10107-012-0518-y
- By:
- Publication type:
- Article
5
Computing clique and chromatic number of circular-perfect graphs in polynomial time.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 121, doi. 10.1007/s10107-012-0512-4
- By:
- Publication type:
- Article
6
Semidefinite relaxations for non-convex quadratic mixed-integer programming.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 435, doi. 10.1007/s10107-012-0534-y
- By:
- Publication type:
- Article
7
A branch-and-cut algorithm for the maximum benefit Chinese postman problem.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 21, doi. 10.1007/s10107-011-0507-6
- By:
- Publication type:
- Article
8
Some properties of convex hulls of integer points contained in general convex sets.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 507, doi. 10.1007/s10107-012-0538-7
- By:
- Publication type:
- Article
9
A simple LP relaxation for the asymmetric traveling salesman problem.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 549, doi. 10.1007/s10107-012-0544-9
- By:
- Publication type:
- Article
10
Nonsmooth optimization via quasi-Newton methods.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 135, doi. 10.1007/s10107-012-0514-2
- By:
- Publication type:
- Article
11
Computing pure Nash and strong equilibria in bottleneck congestion games.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 193, doi. 10.1007/s10107-012-0521-3
- By:
- Publication type:
- Article
12
A polyhedral approach to the single row facility layout problem.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 453, doi. 10.1007/s10107-012-0533-z
- By:
- Publication type:
- Article
13
Equations on monotone graphs.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 49, doi. 10.1007/s10107-011-0509-4
- By:
- Publication type:
- Article
14
On <i>t</i>-branch split cuts for mixed-integer programs.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 591, doi. 10.1007/s10107-012-0542-y
- By:
- Publication type:
- Article
15
Erratum to: Convex approximations for complete integer recourse models.
- Published in:
- 2013
- By:
- Publication type:
- Correction Notice
16
Simple bounds for recovering low-complexity models.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 577, doi. 10.1007/s10107-012-0540-0
- By:
- Publication type:
- Article
17
Sparse solutions to random standard quadratic optimization problems.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 273, doi. 10.1007/s10107-012-0519-x
- By:
- Publication type:
- Article
18
A 3-approximation algorithm for the facility location problem with uniform capacities.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 527, doi. 10.1007/s10107-012-0565-4
- By:
- Publication type:
- Article
19
The GUS-property of second-order cone linear complementarity problems.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 295, doi. 10.1007/s10107-012-0523-1
- By:
- Publication type:
- Article
20
A robust optimization approach to experimental design for model discrimination of dynamical systems.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 405, doi. 10.1007/s10107-012-0532-0
- By:
- Publication type:
- Article
21
On the diameter of partition polytopes and vertex-disjoint cycle cover.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 1, doi. 10.1007/s10107-011-0504-9
- By:
- Publication type:
- Article
22
Unique lifting of integer variables in minimal inequalities.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 561, doi. 10.1007/s10107-012-0560-9
- By:
- Publication type:
- Article
23
Risk averse elastic shape optimization with parametrized fine scale geometry.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 383, doi. 10.1007/s10107-012-0531-1
- By:
- Publication type:
- Article
24
On generalizations of network design problems with degree bounds.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 479, doi. 10.1007/s10107-012-0537-8
- By:
- Publication type:
- Article
25
Fast alternating linearization methods for minimizing the sum of two convex functions.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 349, doi. 10.1007/s10107-012-0530-2
- By:
- Publication type:
- Article
26
A practical relative error criterion for augmented Lagrangians.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 319, doi. 10.1007/s10107-012-0528-9
- By:
- Publication type:
- Article