Sciweavers

206 search results - page 13 / 42
» mp 2006
Sort
View
MP
2007
142views more  MP 2007»
14 years 9 months ago
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branc...
Jagat Patel, John W. Chinneck
MP
2010
157views more  MP 2010»
14 years 8 months ago
Newton's method for generalized equations: a sequential implicit function theorem
In the extension of Newton’s method to generalized equations, applying to variational inequalities as a special case, convergence analysis relates to a corresponding implicit fun...
Asen L. Dontchev, R. Tyrrell Rockafellar
MP
2010
128views more  MP 2010»
14 years 8 months ago
Copositivity cuts for improving SDP bounds on the clique number
Adding cuts based on copositive matrices, we propose to improve Lov´asz’ bound θ on the clique number and its tightening θ introduced by McEliece, Rodemich, Rumsey, and Schri...
Immanuel M. Bomze, Florian Frommlet, Marco Locatel...
75
Voted
EUROPAR
2006
Springer
15 years 1 months ago
Implementing Irregular Parallel Algorithms with OpenMP
Writing irregular parallel algorithms with OpenMP has been rarely practised in the past. Yet it is possible, and in this paper we will use a simple breadth
Michael Süß, Claudia Leopold
MP
2006
101views more  MP 2006»
14 years 9 months ago
Computational complexity of stochastic programming problems
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
Martin E. Dyer, Leen Stougie