Ken Darby-Dowman

According to our database1, Ken Darby-Dowman authored at least 16 papers between 1996 and 2014.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Mejora de la exploracion y la explotacion de las heuristicas constructivas para el MLSTP.
CoRR, 2014

2011
Robust optimization and portfolio selection: The cost of robustness.
Eur. J. Oper. Res., 2011

2010
Heuristic Approaches for the Quartet Method of Hierarchical Clustering.
IEEE Trans. Knowl. Data Eng., 2010

Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem.
Nat. Comput., 2010

2009
Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem.
Eur. J. Oper. Res., 2009

Variable neighbourhood search for the minimum labelling Steiner tree problem.
Ann. Oper. Res., 2009

2007
Discrete Particle Swarm Optimization for the Minimum Labelling Steiner Tree Problem.
Proceedings of the Nature Inspired Cooperative Strategies for Optimization (NICSO 2007), 2007

2006
Portfolio construction based on stochastic dominance and target return distributions.
Math. Program., 2006

2005
A co-operative parallel heuristic for mixed zero-one linear programming: Combining simulated annealing with branch and bound.
Eur. J. Oper. Res., 2005

2002
Developments in linear and integer programming.
J. Oper. Res. Soc., 2002

Introduction.
J. Oper. Res. Soc., 2002

2000
A two-stage stochastic programming with recourse model for determining robust planting plans in horticulture.
J. Oper. Res. Soc., 2000

1998
Properties of Some Combinatorial Optimization Problems and Their Effect on the Performance of Integer Programming and Constraint Logic Programming.
INFORMS J. Comput., 1998

The Application of Preprocessing and Cutting Plane Techniques for a Class of Production Planning Problems.
Comput. Optim. Appl., 1998

1997
Constraint Logic Programming and Integer Programming Approaches and Their Collaboration in Solving an Assignment Scheduling Problem.
Constraints An Int. J., 1997

1996
A branch and bound procedure to minimize mean absolute lateness on a single processor.
Comput. Oper. Res., 1996


  Loading...