Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand (Q1610376): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:03, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand |
scientific article |
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
