Techniques for solving subset sum problems within a given tolerance (Q3410169)
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 5074818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Techniques for solving subset sum problems within a given tolerance |
scientific article; zbMATH DE number 5074818 |
Statements
Techniques for solving subset sum problems within a given tolerance (English)
0 references
22 November 2006
0 references
subset sum
0 references
enumeration
0 references
branch-and-bound
0 references
heuristics
0 references
0.7720957398414612
0 references
0.7710337042808533
0 references
0.7556230425834656
0 references
0.7543331980705261
0 references
0.7513747215270996
0 references
