A branch and bound procedure to minimize mean absolute lateness on a single processor. - Timothy D. Fry; Ronald D. Armstrong; Ken Darby-Dowman; Patrick R. Philipoom (Comput. Oper. Res., 1996)

Constraint Logic Programming and Integer Programming Approaches and Their Collaboration in Solving an Assignment Scheduling Problem. - Ken Darby-Dowman; James Little 002; Gautam Mitra; Marco Zaffalon (Constraints An Int. J., 1997)

The Application of Preprocessing and Cutting Plane Techniques for a Class of Production Planning Problems. - Ken Darby-Dowman; Socorro Rangel (Comput. Optim. Appl., 1998)

Properties of Some Combinatorial Optimization Problems and Their Effect on the Performance of Integer Programming and Constraint Logic Programming. - Ken Darby-Dowman; James Little 002 (INFORMS J. Comput., 1998)

A two-stage stochastic programming with recourse model for determining robust planting plans in horticulture. - Ken Darby-Dowman; Simon Barker; Eric Audsley; David Parsons (J. Oper. Res. Soc., 2000)

Introduction. - John M. Wilson 001; Ken Darby-Dowman (J. Oper. Res. Soc., 2002)

Developments in linear and integer programming. - Ken Darby-Dowman; John M. Wilson 001 (J. Oper. Res. Soc., 2002)

A co-operative parallel heuristic for mixed zero-one linear programming: Combining simulated annealing with branch and bound. - V. Nwana; Ken Darby-Dowman; Gautam Mitra (Eur. J. Oper. Res., 2005)

Portfolio construction based on stochastic dominance and target return distributions. - Diana Roman; Ken Darby-Dowman; Gautam Mitra (Math. Program., 2006)

Discrete Particle Swarm Optimization for the Minimum Labelling Steiner Tree Problem. - Sergio Consoli; José A. Moreno-Pérez; Ken Darby-Dowman; Nenad Mladenovic (NICSO, 2007)

Variable neighbourhood search for the minimum labelling Steiner tree problem. - Sergio Consoli; Ken Darby-Dowman; Nenad Mladenovic; José A. Moreno-Pérez (Ann. Oper. Res., 2009)

Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem. - Sergio Consoli; Ken Darby-Dowman; Nenad Mladenovic; José A. Moreno-Pérez (Eur. J. Oper. Res., 2009)

Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem. - Sergio Consoli; José Andrés Moreno-Pérez; Kenneth Darby-Dowman; Nenad Mladenovic (Nat. Comput., 2010)

Heuristic Approaches for the Quartet Method of Hierarchical Clustering. - Sergio Consoli; Kenneth Darby-Dowman; Gijs Geleijnse; Jan H. M. Korst; Steffen Pauws (IEEE Trans. Knowl. Data Eng., 2010)

Robust optimization and portfolio selection: The cost of robustness. - Christine Gregory; Ken Darby-Dowman; Gautam Mitra (Eur. J. Oper. Res., 2011)

Mejora de la exploracion y la explotacion de las heuristicas constructivas para el MLSTP. - Sergio Consoli; José Andrés Moreno-Pérez; Kenneth Darby-Dowman; Nenad Mladenovic (CoRR, 2014)