default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKen Darby-Dowman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[i1]Sergio Consoli, José Andrés Moreno-Pérez, Kenneth Darby-Dowman, Nenad Mladenovic:
Mejora de la exploracion y la explotacion de las heuristicas constructivas para el MLSTP. CoRR abs/1405.1980 (2014)- 2011
- [j14]Christine Gregory, Ken Darby-Dowman, Gautam Mitra:
Robust optimization and portfolio selection: The cost of robustness. Eur. J. Oper. Res. 212(2): 417-428 (2011) - 2010
- [j13]Sergio Consoli
, José Andrés Moreno-Pérez, Kenneth Darby-Dowman, Nenad Mladenovic:
Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem. Nat. Comput. 9(1): 29-46 (2010) - [j12]Sergio Consoli, Kenneth Darby-Dowman, Gijs Geleijnse, Jan H. M. Korst, Steffen Pauws:
Heuristic Approaches for the Quartet Method of Hierarchical Clustering. IEEE Trans. Knowl. Data Eng. 22(10): 1428-1443 (2010)
2000 – 2009
- 2009
- [j11]Sergio Consoli, Ken Darby-Dowman, Nenad Mladenovic, José A. Moreno-Pérez:
Variable neighbourhood search for the minimum labelling Steiner tree problem. Ann. Oper. Res. 172(1): 71-96 (2009) - [j10]Sergio Consoli, Ken Darby-Dowman, Nenad Mladenovic, José A. Moreno-Pérez:
Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem. Eur. J. Oper. Res. 196(2): 440-449 (2009) - 2007
- [p1]Sergio Consoli, José A. Moreno-Pérez, Ken Darby-Dowman, Nenad Mladenovic:
Discrete Particle Swarm Optimization for the Minimum Labelling Steiner Tree Problem. NICSO 2007: 313-322 - 2006
- [j9]Diana Roman, Ken Darby-Dowman, Gautam Mitra:
Portfolio construction based on stochastic dominance and target return distributions. Math. Program. 108(2-3): 541-569 (2006) - 2005
- [j8]V. Nwana, Ken Darby-Dowman, Gautam Mitra:
A co-operative parallel heuristic for mixed zero-one linear programming: Combining simulated annealing with branch and bound. Eur. J. Oper. Res. 164(1): 12-23 (2005) - 2002
- [j7]John M. Wilson, Ken Darby-Dowman:
Introduction. J. Oper. Res. Soc. 53(10): 1063-1064 (2002) - [j6]Ken Darby-Dowman, John M. Wilson:
Developments in linear and integer programming. J. Oper. Res. Soc. 53(10): 1065-1071 (2002) - 2000
- [j5]Ken Darby-Dowman, Simon Barker, Eric Audsley, David Parsons:
A two-stage stochastic programming with recourse model for determining robust planting plans in horticulture. J. Oper. Res. Soc. 51(1): 83-89 (2000)
1990 – 1999
- 1998
- [j4]Ken Darby-Dowman, Socorro Rangel:
The Application of Preprocessing and Cutting Plane Techniques for a Class of Production Planning Problems. Comput. Optim. Appl. 11(3): 297-318 (1998) - [j3]Ken Darby-Dowman, James Little:
Properties of Some Combinatorial Optimization Problems and Their Effect on the Performance of Integer Programming and Constraint Logic Programming. INFORMS J. Comput. 10(3): 276-286 (1998) - 1997
- [j2]Ken Darby-Dowman, James Little, Gautam Mitra, Marco Zaffalon:
Constraint Logic Programming and Integer Programming Approaches and Their Collaboration in Solving an Assignment Scheduling Problem. Constraints An Int. J. 1(3): 245-264 (1997) - 1996
- [j1]Timothy D. Fry, Ronald D. Armstrong, Ken Darby-Dowman, Patrick R. Philipoom:
A branch and bound procedure to minimize mean absolute lateness on a single processor. Comput. Oper. Res. 23(2): 171-182 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
