default search action
David K. Smith 0002
Person information
- affiliation: University of Exeter, School of Engineering, Computer Science and Mathematics, UK
- affiliation (former, PhD 1977): University of Lancaster, UK
Other persons with the same name
- David K. Smith — disambiguation page
- David K. Smith 0001
(aka: David Keith Smith) — University of Hong Kong (HKU), Department of Biochemistry, Hong Kong (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j11]David K. Smith:
The travelling confessor of Bere Ferrers. OR Insight 26(2): 140-148 (2013) - 2011
- [j10]David K. Smith:
A bibliography of applications of operational research in sub-Saharan Africa. Int. Trans. Oper. Res. 18(2): 149-182 (2011)
2000 – 2009
- 2009
- [j9]David K. Smith:
Open studios - Regional promotion of art tourism. OR Insight 22(3): 153-164 (2009) - 2008
- [j8]David K. Smith:
A bibliography of applications of operational research in West Africa. Int. Trans. Oper. Res. 15(2): 121-150 (2008) - 2007
- [j7]Tim Paulden, David K. Smith:
Developing New Locality Results for the Prüfer Code using a Remarkable Linear-Time Decoding Algorithm. Electron. J. Comb. 14(1) (2007) - [j6]David K. Smith:
Dynamic programming and board games: A survey. Eur. J. Oper. Res. 176(3): 1299-1318 (2007) - [j5]Roger M. Hill, Mehdi Seifbarghy
A two-echelon inventory model with lost sales. Eur. J. Oper. Res. 181(2): 753-766 (2007) - [j4]Evan Thompson, Tim Paulden, David K. Smith:
The Dandelion Code: A New Coding of Spanning Trees for Genetic Algorithms. IEEE Trans. Evol. Comput. 11(1): 91-100 (2007) - [c2]Tim Paulden, David K. Smith:
Some novel locality results for the blob code spanning tree representation. GECCO 2007: 1320-1327 - 2006
- [j3]Tim Paulden, David K. Smith:
From the Dandelion Code to the Rainbow Code: A Class of Bijective Spanning Tree Representations With Linear Complexity and Bounded Locality. IEEE Trans. Evol. Comput. 10(2): 108-123 (2006) - [c1]Tim Paulden, David K. Smith:
Recent Advances in the Study of the Dandelion Code, Happy Code, and Blob Code Spanning Tree Representations. IEEE Congress on Evolutionary Computation 2006: 2111-2118 - 2002
- [j2]David K. Smith:
Calculation of steady-state probabilities of M/M queues: further approaches. Adv. Decis. Sci. 6(1): 43-50 (2002)
1990 – 1999
- 1999
- [j1]Roger M. Hill, Mohd Omar, David K. Smith:
Stock replenishment policies for a stochastic exponentially-declining demand process. Eur. J. Oper. Res. 116(2): 374-388 (1999)
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 2024-04-24 23:17 CEST 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: