Ken Darby-Dowman
According to our database1,
Ken Darby-Dowman
authored at least 16 papers
between 1996 and 2014.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2014
Mejora de la exploracion y la explotacion de las heuristicas constructivas para el MLSTP.
CoRR, 2014
2011
Eur. J. Oper. Res., 2011
2010
IEEE Trans. Knowl. Data Eng., 2010
Nat. Comput., 2010
2009
Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem.
Eur. J. Oper. Res., 2009
Ann. Oper. Res., 2009
2007
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
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