Results: 12
Approximate min–max relations for odd cycles in planar graphs.
- Published in:
- Mathematical Programming, 2007, v. 110, n. 1, p. 71, doi. 10.1007/s10107-006-0063-7
- By:
- Publication type:
- Article
Foreword: Special issue on IPCO 2005.
- Published in:
- Mathematical Programming, 2007, v. 110, n. 1, p. 1, doi. 10.1007/s10107-006-0058-4
- By:
- Publication type:
- Article
Combinatorial algorithms for matchings, even factors and square-free 2-factors.
- Published in:
- Mathematical Programming, 2007, v. 110, n. 1, p. 57, doi. 10.1007/s10107-006-0053-9
- By:
- Publication type:
- Article
Computing the inertia from sign patterns.
- Published in:
- Mathematical Programming, 2007, v. 110, n. 1, p. 229, doi. 10.1007/s10107-006-0056-6
- By:
- Publication type:
- Article
Machine scheduling with resource dependent processing times.
- Published in:
- Mathematical Programming, 2007, v. 110, n. 1, p. 209, doi. 10.1007/s10107-006-0059-3
- By:
- Publication type:
- Article
On approximating complex quadratic optimization problems via semidefinite programming relaxations.
- Published in:
- Mathematical Programming, 2007, v. 110, n. 1, p. 93, doi. 10.1007/s10107-006-0064-6
- By:
- Publication type:
- Article
Power optimization for connectivity problems.
- Published in:
- Mathematical Programming, 2007, v. 110, n. 1, p. 195, doi. 10.1007/s10107-006-0057-5
- By:
- Publication type:
- Article
Optimizing over the first Chvátal closure.
- Published in:
- Mathematical Programming, 2007, v. 110, n. 1, p. 3, doi. 10.1007/s10107-006-0054-8
- By:
- Publication type:
- Article
On the graphical relaxation of the symmetric traveling salesman polytope.
- Published in:
- Mathematical Programming, 2007, v. 110, n. 1, p. 175, doi. 10.1007/s10107-006-0060-x
- By:
- Publication type:
- Article
On the L<sub>∞</sub>-norm of extreme points for crossing supermodular directed network LPs.
- Published in:
- Mathematical Programming, 2007, v. 110, n. 1, p. 111, doi. 10.1007/s10107-006-0061-9
- By:
- Publication type:
- Article
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials.
- Published in:
- Mathematical Programming, 2007, v. 110, n. 1, p. 145, doi. 10.1007/s10107-006-0062-8
- By:
- Publication type:
- Article
Smoothed analysis of integer programming.
- Published in:
- Mathematical Programming, 2007, v. 110, n. 1, p. 21, doi. 10.1007/s10107-006-0055-7
- By:
- Publication type:
- Article