A competitive local search heuristic for the subset sum problem (Q1302591)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1341110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A competitive local search heuristic for the subset sum problem |
scientific article; zbMATH DE number 1341110 |
Statements
A competitive local search heuristic for the subset sum problem (English)
0 references
22 September 1999
0 references
subset sum
0 references
local search
0 references
heuristics
0 references
0.7630881071090698
0 references
0.7580848336219788
0 references
0.7520530819892883
0 references
0.7392714023590088
0 references
