default search action
K. I. M. McKinnon
Person information
- affiliation: University of Edinburgh, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Hongyu Zhang
, Nicolò Mazzi
A stabilised Benders decomposition with adaptive oracles for large-scale stochastic programming with short-term and long-term uncertainty. Comput. Oper. Res. 167: 106665 (2024) - [j21]Nagisa Sugishita
Use of Machine Learning Models to Warmstart Column Generation for Unit Commitment. INFORMS J. Comput. 36(4): 1129-1146 (2024) - 2023
- [j20]Andreas Grothey
On the effectiveness of sequential linear programming for the pooling problem. Ann. Oper. Res. 322(2): 691-711 (2023) - 2021
- [j19]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
- [j18]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) - 2016
- [p1]Ken McKinnon, Yu Yu:
Solving Stochastic Ship Fleet Routing Problems with Inventory Management Using Branch and Price. Advances in Stochastic and Deterministic Global Optimization 2016: 141-165 - 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
- [j17]Vidar Gunnerud
Oil production optimization solved by piecewise linearization in a Branch & Price framework. Comput. Oper. Res. 39(11): 2469-2477 (2012)
2000 – 2009
- 2009
- [j16]Duan Li
Convergent Lagrangian and domain cut method for nonlinear knapsack problems. Comput. Optim. Appl. 42(1): 67-104 (2009) - 2006
- [j15]J. A. Julian Hall, Ken McKinnon:
COAP 2005 Best Paper Award. Comput. Optim. Appl. 35(2): 131-133 (2006) - 2005
- [j14]Duan Li
An Exact Solution Method for Reliability Optimization in Complex Systems. Ann. Oper. Res. 133(1-4): 129-148 (2005) - [j13]J. A. J. Hall, K. I. M. McKinnon:
Hyper-Sparsity in the Revised Simplex Method and How to Exploit it. Comput. Optim. Appl. 32(3): 259-283 (2005) - [j12]Xiaoling Sun, Duan Li
On Saddle Points of Augmented Lagrangians for Constrained Nonconvex Optimization. SIAM J. Optim. 15(4): 1128-1146 (2005) - 2004
- [j11]J. A. J. Hall, K. I. M. McKinnon:
The simplest examples where the simplex method cycles and conditions where expand fails to prevent cycling. Math. Program. 100(1): 133-150 (2004) - 2001
- [j10]C. S. Buchanan, K. I. M. McKinnon, G. K. Skondras:
The Recursive Definition of Stochastic Linear Programming Problems within an Algebraic Modeling Language. Ann. Oper. Res. 104(1-4): 15-32 (2001) - [j9]Thomas W. Archibald
Controlling multi-reservoir systems. Eur. J. Oper. Res. 129(3): 619-626 (2001) - [j8]Xiaoling Sun, K. I. M. McKinnon, Duan Li
A convexification method for a class of global optimization problems with applications to reliability optimization. J. Glob. Optim. 21(2): 185-199 (2001) - 2000
- [j7]Erich Steiner, Ken McKinnon:
Dynamic programming using the Fritz-John conditions. Eur. J. Oper. Res. 123(1): 145-153 (2000)
1990 – 1999
- 1999
- [j6]S. Berner, K. I. M. McKinnon, C. Millar:
A parallel algorithm for the global minimizationof Gibbs free energy. Ann. Oper. Res. 90: 271-291 (1999) - [j5]Thomas W. Archibald
Nested Benders decomposition and dynamic programming for reservoir optimisation. J. Oper. Res. Soc. 50(5): 468-479 (1999) - 1998
- [j4]J. A. J. Hall, K. I. M. McKinnon:
ASYNPLEX, an asynchronous parallelrevised simplex algorithm. Ann. Oper. Res. 81: 27-50 (1998) - [j3]Ken McKinnon, Marcel Mongeau:
A Generic Global Optimization Algorithm for the Chemical and Phase Equilibrium Problem. J. Glob. Optim. 12(4): 325-351 (1998) - [j2]K. I. M. McKinnon:
Convergence of the Nelder-Mead Simplex Method to a Nonstationary Point. SIAM J. Optim. 9(1): 148-158 (1998) - 1996
- [c2]J. A. J. Hall, K. I. M. McKinnon:
PARSMI, a Parallel Revised Simplex Algorithm Incorporating Minor Iterations and Devex Pricing. PARA 1996: 359-368 - 1995
- [j1]Thomas W. Archibald, K. I. M. McKinnon, Lyn C. Thomas:
Performance Issues for the Iterative Solution of Markov Decision Processes on Parallel Computers. INFORMS J. Comput. 7(3): 349-357 (1995)
1980 – 1989
- 1989
- [c1]Roland N. Ibbett, T. M. Hopkins, K. I. M. McKinnon:
Architectural Mechanisms to Support Sparse Vector Processing. ISCA 1989: 64-71
1970 – 1979
- 1975
- [b1]K. I. M. McKinnon:
Optimal Finite State Discrimination Procedures. University of Cambridge, UK, 1975
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-22 00:34 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: