Solving the combinatorial double auction problem (Q707121): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2003.11.018 / rank
Normal rank
 
Property / author
 
Property / author: Jan I. A. Stallaert / rank
Normal rank
 
Property / author
 
Property / author: Jan I. A. Stallaert / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CABOB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2003.11.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034406377 / rank
 
Normal 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
links / mardi / namelinks / mardi / name
 

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
    0 references
    0 references
    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

    Identifiers