Hope: A genetic algorithm for the unequal area facility layout problem. (Q1406662): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127015361, #quickstatements; #temporary_batch_1724813321913 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0305-0548(97)00100-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968746198 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127015361 / rank | |||
Normal rank | |||
Latest revision as of 09:32, 28 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hope: A genetic algorithm for the unequal area facility layout problem. |
scientific article |
Statements
Hope: A genetic algorithm for the unequal area facility layout problem. (English)
0 references
7 September 2003
0 references
Genetic algorithm
0 references
quadratic assignment problem
0 references
facility layout problem
0 references
heuristics
0 references
