A note on dominance relation in unbounded knapsack problems (Q1180824): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q753683 |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Krzysztof Dudzinski / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Quicksort / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 |
Revision as of 14:51, 15 May 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