Solving the combinatorial double auction problem (Q707121): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2003.11.018 / rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Investment in Knowledge Within a Firm Using a Market Mechanism / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computationally Manageable Combinational Auctions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2003.11.018 / rank | |||
Normal rank | |||
Latest revision as of 02:22, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the combinatorial double auction problem |
scientific article |
Statements
Solving the combinatorial double auction problem (English)
0 references
9 February 2005
0 references
Bidding-auctions
0 references
Artificial intelligence
0 references
Integer programming
0 references
Branch-and-bound
0 references
Analysis of algorithms
0 references
