Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem

Corus, D., Oliveto, P.S. and Yazdani, D. (2019) Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem. Artificial Intelligence, 274. pp. 180-196. ISSN 0004-3702

Abstract

Metadata

Authors/Creators:
  • Corus, D.
  • Oliveto, P.S.
  • Yazdani, D.
Copyright, Publisher and Additional Information: © 2019 Elsevier. This is an author produced version of a paper subsequently published in Artificial Intelligence. Uploaded in accordance with the publisher's self-archiving policy. Article available under the terms of the CC-BY-NC-ND licence (https://creativecommons.org/licenses/by-nc-nd/4.0/).
Keywords: Randomized search heuristics; Evolutionary algorithms; Artificial immune systems; Approximation algorithms; Makespan scheduling
Dates:
  • Accepted: 12 March 2019
  • Published (online): 27 March 2019
  • Published: September 2019
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: 11 Apr 2019 08:56
Last Modified: 11 Apr 2019 08:56
Status: Published
Publisher: Elsevier BV
Refereed: Yes
Identification Number: https://doi.org/10.1016/j.artint.2019.03.001

Download

Accepted Version


Embargoed until: 27 March 2020

Filename: 1-s2.0-S000437021830345X-main.pdf

Licence: CC-BY-NC-ND 4.0

Request a copy

Share / Export

Statistics