An effective discrete dynamic convexized method for solving the winner determination problem (Q306103): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-015-9883-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036787800 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57931861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for bundle trading in financial markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalty function-based differential evolution algorithm for constrained global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete dynamic convexized method for nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Manageable Combinational Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristic Approaches for the Winner Determination Problem in Combinatorial Auction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Auctions: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for a bidding problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations of Weighted Independent Set and Hereditary Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for optimal winner determination in combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete dynamic convexized method for the max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On heuristics for solving winner determination problem in combinatorial 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 / cites work
 
Property / cites work: A dynamic convexized method for nonconvex mixed integer nonlinear programming / rank
 
Normal rank

Latest revision as of 12:38, 12 July 2024

scientific article
Language Label Description Also known as
English
An effective discrete dynamic convexized method for solving the winner determination problem
scientific article

    Statements

    An effective discrete dynamic convexized method for solving the winner determination problem (English)
    0 references
    0 references
    0 references
    0 references
    31 August 2016
    0 references
    0 references
    winner determination problem
    0 references
    discrete dynamic convexized method
    0 references
    local search
    0 references
    adaptive penalty function
    0 references
    0 references
    0 references