Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems (Q5459144): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: Knapsack / rank | |||
Normal rank |
Revision as of 15:32, 29 February 2024
scientific article; zbMATH DE number 5267615
Language | Label | Description | Also known as |
---|---|---|---|
English | Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems |
scientific article; zbMATH DE number 5267615 |
Statements
Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems (English)
0 references
24 April 2008
0 references