Ken Darby-Dowman

13 papers Journal 12
YearRankTypeTitle / Venue / Authors
2011 J jnl
Robust optimization and portfolio selection: The cost of robustness.
Eur. J. Oper. Res.
Christine Gregory, Ken Darby-Dowman, Gautam Mitra
2009 J jnl
Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem.
Eur. J. Oper. Res.
Sergio Consoli, Ken Darby-Dowman, Nenad Mladenovic, José A. Moreno-Pérez
2009 J jnl
Variable neighbourhood search for the minimum labelling Steiner tree problem.
Ann. Oper. Res.
Sergio Consoli, Ken Darby-Dowman, Nenad Mladenovic, José A. Moreno-Pérez
2007 — ch.
Discrete Particle Swarm Optimization for the Minimum Labelling Steiner Tree Problem.
NICSO
Sergio Consoli, José A. Moreno-Pérez, Ken Darby-Dowman, Nenad Mladenovic
2006 J jnl
Portfolio construction based on stochastic dominance and target return distributions.
Math. Program.
Diana Roman, Ken Darby-Dowman, Gautam Mitra
2005 J jnl
A co-operative parallel heuristic for mixed zero-one linear programming: Combining simulated annealing with branch and bound.
Eur. J. Oper. Res.
V. Nwana, Ken Darby-Dowman, Gautam Mitra
2002 J jnl
Developments in linear and integer programming.
J. Oper. Res. Soc.
Ken Darby-Dowman, John M. Wilson
2002 J jnl
Introduction.
J. Oper. Res. Soc.
John M. Wilson, Ken Darby-Dowman
2000 J jnl
A two-stage stochastic programming with recourse model for determining robust planting plans in horticulture.
J. Oper. Res. Soc.
Ken Darby-Dowman, Simon Barker, Eric Audsley, David Parsons
1998 J jnl
Properties of Some Combinatorial Optimization Problems and Their Effect on the Performance of Integer Programming and Constraint Logic Programming.
INFORMS J. Comput.
Ken Darby-Dowman, James Little
1998 J jnl
The Application of Preprocessing and Cutting Plane Techniques for a Class of Production Planning Problems.
Comput. Optim. Appl.
Ken Darby-Dowman, Socorro Rangel
1997 J jnl
Constraint Logic Programming and Integer Programming Approaches and Their Collaboration in Solving an Assignment Scheduling Problem.
Constraints An Int. J.
Ken Darby-Dowman, James Little, Gautam Mitra, Marco Zaffalon
1996 J jnl
A branch and bound procedure to minimize mean absolute lateness on a single processor.
Comput. Oper. Res.
Timothy D. Fry, Ronald D. Armstrong, Ken Darby-Dowman, Patrick R. Philipoom