Views provided by UsageCounts
doi: 10.5281/zenodo.9820
Given a 0-1 single dimension knapsack problem, this algorithm generates the set of cutting planes required to reduce the feasible region of the problem to the convex hull of feasible integer points. See README for more information and instructions.
knapsack, binary knapsack
knapsack, binary knapsack
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 1 |

Views provided by UsageCounts