A hybrid genetic algorithm for an NP-complete problem with an expensive evaluation function

Richard Rankin, Ralph Wilkerson, Geoffrey Harris, Jo Spring

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

4 Citations (Scopus)
Original languageEnglish
Title of host publicationSAC '93: Proceedings of the 1993 ACM/SIGAPP symposium on Applied Computing: states of the art and practice
PublisherAssociation for Computing Machinery (ACM)
Pages251-256
DOIs
Publication statusPublished - 1993
Externally publishedYes

Cite this

Rankin, R., Wilkerson, R., Harris, G., & Spring, J. (1993). A hybrid genetic algorithm for an NP-complete problem with an expensive evaluation function. In SAC '93: Proceedings of the 1993 ACM/SIGAPP symposium on Applied Computing: states of the art and practice (pp. 251-256). Association for Computing Machinery (ACM). https://doi.org/10.1145/162754.162889
Rankin, Richard ; Wilkerson, Ralph ; Harris, Geoffrey ; Spring, Jo. / A hybrid genetic algorithm for an NP-complete problem with an expensive evaluation function. SAC '93: Proceedings of the 1993 ACM/SIGAPP symposium on Applied Computing: states of the art and practice. Association for Computing Machinery (ACM), 1993. pp. 251-256
@inproceedings{2dd33b50c50049fbafee5504ed7910f2,
title = "A hybrid genetic algorithm for an NP-complete problem with an expensive evaluation function",
author = "Richard Rankin and Ralph Wilkerson and Geoffrey Harris and Jo Spring",
year = "1993",
doi = "10.1145/162754.162889",
language = "English",
pages = "251--256",
booktitle = "SAC '93: Proceedings of the 1993 ACM/SIGAPP symposium on Applied Computing: states of the art and practice",
publisher = "Association for Computing Machinery (ACM)",
address = "United States",

}

Rankin, R, Wilkerson, R, Harris, G & Spring, J 1993, A hybrid genetic algorithm for an NP-complete problem with an expensive evaluation function. in SAC '93: Proceedings of the 1993 ACM/SIGAPP symposium on Applied Computing: states of the art and practice. Association for Computing Machinery (ACM), pp. 251-256. https://doi.org/10.1145/162754.162889

A hybrid genetic algorithm for an NP-complete problem with an expensive evaluation function. / Rankin, Richard; Wilkerson, Ralph; Harris, Geoffrey; Spring, Jo.

SAC '93: Proceedings of the 1993 ACM/SIGAPP symposium on Applied Computing: states of the art and practice. Association for Computing Machinery (ACM), 1993. p. 251-256.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

TY - GEN

T1 - A hybrid genetic algorithm for an NP-complete problem with an expensive evaluation function

AU - Rankin, Richard

AU - Wilkerson, Ralph

AU - Harris, Geoffrey

AU - Spring, Jo

PY - 1993

Y1 - 1993

U2 - 10.1145/162754.162889

DO - 10.1145/162754.162889

M3 - Conference contribution

SP - 251

EP - 256

BT - SAC '93: Proceedings of the 1993 ACM/SIGAPP symposium on Applied Computing: states of the art and practice

PB - Association for Computing Machinery (ACM)

ER -

Rankin R, Wilkerson R, Harris G, Spring J. A hybrid genetic algorithm for an NP-complete problem with an expensive evaluation function. In SAC '93: Proceedings of the 1993 ACM/SIGAPP symposium on Applied Computing: states of the art and practice. Association for Computing Machinery (ACM). 1993. p. 251-256 https://doi.org/10.1145/162754.162889