Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints.
Saved in:
| Title: | Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints. |
|---|---|
| Authors: | Roostapour, Vahid1, vahid.roostapour@adelaide.edu.au, Neumann, Aneta1, aneta.neumann@adelaide.edu.au, Neumann, Frank1, frank.neumann@adelaide.edu.au |
| Source: | Theoretical Computer Science; Jul2022, Vol. 924, p129-147, 19p |
| Database: | Applied Science & Technology Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: aci DbLabel: Applied Science & Technology Source An: 157356616 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AU" term="%22Roostapour%2C+Vahid%22">Roostapour, Vahid</searchLink><relatesTo>1</relatesTo>, <i>vahid.roostapour@adelaide.edu.au</i><br /><searchLink fieldCode="AU" term="%22Neumann%2C+Aneta%22">Neumann, Aneta</searchLink><relatesTo>1</relatesTo>, <i>aneta.neumann@adelaide.edu.au</i><br /><searchLink fieldCode="AU" term="%22Neumann%2C+Frank%22">Neumann, Frank</searchLink><relatesTo>1</relatesTo>, <i>frank.neumann@adelaide.edu.au</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Theoretical+Computer+Science%22">Theoretical Computer Science</searchLink>; Jul2022, Vol. 924, p129-147, 19p |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=157356616 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.tcs.2022.05.008 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 19 StartPage: 129 Titles: – TitleFull: Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Roostapour, Vahid – PersonEntity: Name: NameFull: Neumann, Aneta – PersonEntity: Name: NameFull: Neumann, Frank IsPartOfRelationships: – BibEntity: Dates: – D: 30 M: 07 Text: Jul2022 Type: published Y: 2022 Identifiers: – Type: issn-print Value: 03043975 Numbering: – Type: volume Value: 924 Titles: – TitleFull: Theoretical Computer Science Type: main |
| ResultId | 1 |