Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems (Q5459144)

From MaRDI portal
Revision as of 15:32, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
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
    0 references
    24 April 2008
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references