Artificial Immune Systems can find arbitrarily good approximations for the NP-Hard partition problem

Corus, D., Oliveto, P.S. and Yazdani, D. (2018) Artificial Immune Systems can find arbitrarily good approximations for the NP-Hard partition problem. In: Auger, A., Fonseca, C., Lourenço, N., Machado , P., Paquete, L. and Whitley, D., (eds.) Parallel Problem Solving from Nature – PPSN XV, PT II. PPSN: 15th International Conference on Parallel Problem Solving from Nature, 08-12 Sep 2018, Coimbra, Portugal. Lecture Notes in Computer Science, 11102 . Springer, Cham , pp. 16-28. ISBN 9783319992587

Abstract

Metadata

Authors/Creators:
  • Corus, D.
  • Oliveto, P.S.
  • Yazdani, D.
Copyright, Publisher and Additional Information: © 2018 Springer Nature Switzerland AG. This is an author-produced version of a paper subsequently published in Auger A., Fonseca C., Lourenço N., Machado P., Paquete L., Whitley D. (eds) Parallel Problem Solving from Nature – PPSN XV. PPSN 2018. Lecture Notes in Computer Science, vol 11102. Uploaded in accordance with the publisher's self-archiving policy.
Dates:
  • Published (online): 21 August 2018
  • Published: 21 August 2018
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Funding Information:
FunderGrant number
ENGINEERING AND PHYSICAL SCIENCE RESEARCH COUNCIL (EPSRC)EP/M004252/1
Depositing User: Symplectic Sheffield
Date Deposited: 23 May 2019 12:02
Last Modified: 23 May 2019 12:08
Status: Published
Publisher: Springer, Cham
Series Name: Lecture Notes in Computer Science
Refereed: Yes
Identification Number: https://doi.org/10.1007/978-3-319-99259-4_2
Related URLs:

Export

Statistics