A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH (Q5267564)
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 6729952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH |
scientific article; zbMATH DE number 6729952 |
Statements
A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH (English)
0 references
13 June 2017
0 references
combinatorial optimization
0 references
approximation algorithms
0 references
minimum knapsack problem
0 references
forcing graph
0 references
covering integer program
0 references
0.9304684
0 references
0.8922735
0 references
0.89046174
0 references
0.8867671
0 references
0.88082975
0 references
0.8786175
0 references
0.8786175
0 references
0.87713146
0 references
0.87639195
0 references
