K. I. M. McKinnon

Orcid: 0000-0003-1457-5668

Affiliations:
  • University of Edinburgh, UK


According to our database1, K. I. M. McKinnon authored at least 27 papers between 1975 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Use of Machine Learning Models to Warmstart Column Generation for Unit Commitment.
INFORMS J. Comput., 2024

A stabilised Benders decomposition with adaptive oracles for large-scale stochastic programming with short-term and long-term uncertainty.
Comput. Oper. Res., 2024

2023
On the effectiveness of sequential linear programming for the pooling problem.
Ann. Oper. Res., March, 2023

2021
Benders decomposition with adaptive oracles for large scale optimization.
Math. Program. Comput., 2021

2017
A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems.
Eur. J. Oper. Res., 2017

2016
Solving Stochastic Ship Fleet Routing Problems with Inventory Management Using Branch and Price.
Proceedings of the Advances in Stochastic and Deterministic Global Optimization., 2016

2013
Optimization-based Islanding of Power Networks using Piecewise Linear AC Power Flow.
CoRR, 2013

2012
Oil production optimization solved by piecewise linearization in a Branch & Price framework.
Comput. Oper. Res., 2012

2009
Convergent Lagrangian and domain cut method for nonlinear knapsack problems.
Comput. Optim. Appl., 2009

2006
COAP 2005 Best Paper Award.
Comput. Optim. Appl., 2006

2005
On Saddle Points of Augmented Lagrangians for Constrained Nonconvex Optimization.
SIAM J. Optim., 2005

Hyper-Sparsity in the Revised Simplex Method and How to Exploit it.
Comput. Optim. Appl., 2005

An Exact Solution Method for Reliability Optimization in Complex Systems.
Ann. Oper. Res., 2005

2004
The simplest examples where the simplex method cycles and conditions where expand fails to prevent cycling.
Math. Program., 2004

2001
A convexification method for a class of global optimization problems with applications to reliability optimization.
J. Glob. Optim., 2001

Controlling multi-reservoir systems.
Eur. J. Oper. Res., 2001

The Recursive Definition of Stochastic Linear Programming Problems within an Algebraic Modeling Language.
Ann. Oper. Res., 2001

2000
Dynamic programming using the Fritz-John conditions.
Eur. J. Oper. Res., 2000

1999
Nested Benders decomposition and dynamic programming for reservoir optimisation.
J. Oper. Res. Soc., 1999

A parallel algorithm for the global minimizationof Gibbs free energy.
Ann. Oper. Res., 1999

1998
Convergence of the Nelder-Mead Simplex Method to a Nonstationary Point.
SIAM J. Optim., 1998

A Generic Global Optimization Algorithm for the Chemical and Phase Equilibrium Problem.
J. Glob. Optim., 1998

ASYNPLEX, an asynchronous parallelrevised simplex algorithm.
Ann. Oper. Res., 1998

1996
PARSMI, a Parallel Revised Simplex Algorithm Incorporating Minor Iterations and Devex Pricing.
Proceedings of the Applied Parallel Computing, 1996

1995
Performance Issues for the Iterative Solution of Markov Decision Processes on Parallel Computers.
INFORMS J. Comput., 1995

1989
Architectural Mechanisms to Support Sparse Vector Processing.
Proceedings of the 16th Annual International Symposium on Computer Architecture. Jerusalem, 1989

1975
Optimal Finite State Discrimination Procedures.
PhD thesis, 1975


  Loading...