Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand (Q1610376)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand |
scientific article; zbMATH DE number 1783567
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand |
scientific article; zbMATH DE number 1783567 |
Statements
Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand (English)
0 references
19 August 2002
0 references
double auction
0 references
indivisible demand
0 references
assignment constraints
0 references
generalized assignment problem
0 references
market clearing
0 references
