A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294)
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 559233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem |
scientific article; zbMATH DE number 559233 |
Statements
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (English)
0 references
28 April 1994
0 references
randomized algorithm
0 references
multidimensional knapsack problem
0 references
Markov chain
0 references
0.9225986
0 references
0.9206304
0 references
0.91716576
0 references
0.9141793
0 references
0.9139892
0 references
0.90968615
0 references
0.9081549
0 references
