On solving simple bilevel programs with a nonconvex lower level program.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 277, doi. 10.1007/s10107-013-0633-4
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2014 AND VI 144 AND IP 1/2
Results: 15
1
2
Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 247, doi. 10.1007/s10107-013-0631-6
- By:
- Publication type:
- Article
3
Disjunctive programming and relaxations of polyhedra.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 307, doi. 10.1007/s10107-013-0634-3
- By:
- Publication type:
- Article
4
New approximations for the cone of copositive matrices and its dual.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 265, doi. 10.1007/s10107-013-0632-5
- By:
- Publication type:
- Article
5
Solving quasi-variational inequalities via their KKT conditions.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 369, doi. 10.1007/s10107-013-0637-0
- By:
- Publication type:
- Article
6
The traveling salesman problem on cubic and subcubic graphs.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 227, doi. 10.1007/s10107-012-0620-1
- By:
- Publication type:
- Article
7
Relaxations of factorable functions with convex-transformable intermediates.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 107, doi. 10.1007/s10107-012-0618-8
- By:
- Publication type:
- Article
8
Chromatic Gallai identities operating on Lovász number.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 347, doi. 10.1007/s10107-013-0636-1
- By:
- Publication type:
- Article
9
On convex envelopes for bivariate functions over polytopes.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 65, doi. 10.1007/s10107-012-0616-x
- By:
- Publication type:
- Article
10
A unified approach for minimizing composite norms.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 181, doi. 10.1007/s10107-012-0622-z
- By:
- Publication type:
- Article
11
Undercover: a primal MINLP heuristic exploring a largest sub-MIP.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 315, doi. 10.1007/s10107-013-0635-2
- By:
- Publication type:
- Article
12
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 1, doi. 10.1007/s10107-012-0614-z
- By:
- Publication type:
- Article
13
On the complexity of finding first-order critical points in constrained nonlinear optimization.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 93, doi. 10.1007/s10107-012-0617-9
- By:
- Publication type:
- Article
14
An introduction to a class of matrix cone programming.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 141, doi. 10.1007/s10107-012-0619-7
- By:
- Publication type:
- Article
15
Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs.
- Published in:
- Mathematical Programming, 2014, v. 144, n. 1/2, p. 39, doi. 10.1007/s10107-012-0615-y
- By:
- Publication type:
- Article