( en | de | ru )

 

Disambiguation of "Grothey, Andreas"

Author of the publication

copydeleteadd this publication to your clipboard
Parallel branch and bound for global optimization with combination of Lipschitz bounds.

, , and . Optim. Methods Softw., 26 (3): 487-498 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kurt Grothey

Albert Grothey

Walter Grothey

Axel Grothey

Albrecht Grothey

 

Other publications of authors with the same name

Benders decomposition with adaptive oracles for large scale optimization., , , and . Math. Program. Comput., 13 (4): 683-703 (2021)Solving non-linear portfolio optimization problems with the primal-dual interior point method., and . Eur. J. Oper. Res., 181 (3): 1019-1029 (2007)Parallel branch and bound for global optimization with combination of Lipschitz bounds., , and . Optim. Methods Softw., 26 (3): 487-498 (2011)Massively Parallel Asset and Liability Management.. Euro-Par Workshops, volume 6586 of Lecture Notes in Computer Science, page 423-430. Springer, (2010)Approximate dynamic programming with Bézier Curves/Surfaces for Top-percentile Traffic Routing., and . Eur. J. Oper. Res., 218 (3): 698-707 (2012)Parallel interior-point solver for structured quadratic programs: Application to financial planning problems., and . Ann. Oper. Res., 152 (1): 319-339 (2007)Exploiting structure in parallel implementation of interior point methods for optimization., and . Comput. Manag. Sci., 6 (2): 135-160 (2009)A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems., , and . Eur. J. Oper. Res., 261 (1): 247-259 (2017)A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis., and . SIAM J. Optim., 19 (3): 1184-1210 (2008)Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds., , and . Optim. Lett., 4 (2): 173-183 (2010)