7092 search results - page 344 / 1419 » Parallelizing constraint programs |
125
Voted
MP
2008
15 years 2 months ago
2008
We analyze the rate of local convergence of the augmented Lagrangian method for nonlinear semidefinite optimization. The presence of the positive semidefinite cone constraint requ...
113
click to vote
ANOR
2005
15 years 2 months ago
2005
Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subprobl...
109
click to vote
COR
2011
14 years 10 months ago
2011
Branching in mixed-integer (or integer) linear programming requires choosing both the branching variable and the branching direction. This paper develops a number of new methods f...
145
click to vote
OL
2011
14 years 5 months ago
2011
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
122
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...