Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand (Q1610376): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1011589804040 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1527373281 / rank | |||
Normal rank | |||
Latest revision as of 10:14, 30 July 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
