David K. Smith

Affiliations:
  • University of Exeter, School of Engineering, Computer Science and Mathematics, UK
  • University of Lancaster, UK (former, PhD 1977)


According to our database1, David K. Smith authored at least 13 papers between 1999 and 2013.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2013
The travelling confessor of Bere Ferrers.
OR Insight, 2013

2011
A bibliography of applications of operational research in sub-Saharan Africa.
Int. Trans. Oper. Res., 2011

2009
Open studios - Regional promotion of art tourism.
OR Insight, 2009

2008
A bibliography of applications of operational research in West Africa.
Int. Trans. Oper. Res., 2008

2007
The Dandelion Code: A New Coding of Spanning Trees for Genetic Algorithms.
IEEE Trans. Evol. Comput., 2007

Dynamic programming and board games: A survey.
Eur. J. Oper. Res., 2007

A two-echelon inventory model with lost sales.
Eur. J. Oper. Res., 2007

Developing New Locality Results for the Prüfer Code using a Remarkable Linear-Time Decoding Algorithm.
Electron. J. Comb., 2007

Some novel locality results for the blob code spanning tree representation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

2006
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., 2006

Recent Advances in the Study of the Dandelion Code, Happy Code, and Blob Code Spanning Tree Representations.
Proceedings of the IEEE International Conference on Evolutionary Computation, 2006

2002
Calculation of steady-state probabilities of M/M queues: further approaches.
Adv. Decis. Sci., 2002

1999
Stock replenishment policies for a stochastic exponentially-declining demand process.
Eur. J. Oper. Res., 1999


  Loading...