A note on dominance relation in unbounded knapsack problems (Q1180824): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3882211 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4149228 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An exact algorithm for large unbounded knapsack problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Implementing Quicksort programs / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(91)90044-p / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2127864387 / rank | |||
Normal rank | |||
Latest revision as of 11:51, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on dominance relation in unbounded knapsack problems |
scientific article |
Statements
A note on dominance relation in unbounded knapsack problems (English)
0 references
27 June 1992
0 references
dominance relation
0 references
elimination of dominated items
0 references
unbounded knapsack problem
0 references
partial order
0 references
