default search action
Andreas Grothey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Nagisa Sugishita
, Andreas Grothey
Use of Machine Learning Models to Warmstart Column Generation for Unit Commitment. INFORMS J. Comput. 36(4): 1129-1146 (2024) - 2023
- [j14]Andreas Grothey
On the effectiveness of sequential linear programming for the pooling problem. Ann. Oper. Res. 322(2): 691-711 (2023) - 2021
- [j13]Nicolò Mazzi, Andreas Grothey, Ken McKinnon, Nagisa Sugishita:
Benders decomposition with adaptive oracles for large scale optimization. Math. Program. Comput. 13(4): 683-703 (2021)
2010 – 2019
- 2017
- [j12]Tim Schulze, Andreas Grothey, Ken McKinnon:
A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems. Eur. J. Oper. Res. 261(1): 247-259 (2017) - 2013
- [j11]Marco Colombo
A decomposition-based crash-start for stochastic programming. Comput. Optim. Appl. 55(2): 311-340 (2013) - [i1]Paul A. Trodden, Waqquas A. Bukhsh, Andreas Grothey, K. I. M. McKinnon:
Optimization-based Islanding of Power Networks using Piecewise Linear AC Power Flow. CoRR abs/1310.6675 (2013) - 2012
- [j10]Andreas Grothey, Xinan Yang
Approximate dynamic programming with Bézier Curves/Surfaces for Top-percentile Traffic Routing. Eur. J. Oper. Res. 218(3): 698-707 (2012) - 2011
- [j9]Marco Colombo
A warm-start approach for large-scale stochastic linear programs. Math. Program. 127(2): 371-397 (2011) - [j8]Remigijus Paulavicius
Parallel branch and bound for global optimization with combination of Lipschitz bounds. Optim. Methods Softw. 26(3): 487-498 (2011) - 2010
- [j7]Remigijus Paulavicius
Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds. Optim. Lett. 4(2): 173-183 (2010) - [c2]Andreas Grothey:
Massively Parallel Asset and Liability Management. Euro-Par Workshops 2010: 423-430
2000 – 2009
- 2009
- [j6]Jacek Gondzio
Exploiting structure in parallel implementation of interior point methods for optimization. Comput. Manag. Sci. 6(2): 135-160 (2009) - [j5]Marco Colombo
A structure-conveying modelling language for mathematical and stochastic programming. Math. Program. Comput. 1(4): 223-247 (2009) - 2008
- [j4]Jacek Gondzio
A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis. SIAM J. Optim. 19(3): 1184-1210 (2008) - 2007
- [j3]Jacek Gondzio
Parallel interior-point solver for structured quadratic programs: Application to financial planning problems. Ann. Oper. Res. 152(1): 319-339 (2007) - [j2]Jacek Gondzio
Solving non-linear portfolio optimization problems with the primal-dual interior point method. Eur. J. Oper. Res. 181(3): 1019-1029 (2007) - 2005
- [c1]Jacek Gondzio
Direct Solution of Linear Systems of Size 109 Arising in Optimization with Interior Point Methods. PPAM 2005: 513-525 - 2002
- [j1]Jacek Gondzio
Reoptimization With the Primal-Dual Interior Point Method. SIAM J. Optim. 13(3): 842-864 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: