A differential evolution algorithm for the winner determination problem in combinatorial auctions
DOI10.1016/J.ENDM.2010.05.068zbMATH Open1237.90260OpenAlexW2085554411MaRDI QIDQ2883609FDOQ2883609
Authors: Dalila Boughaci 
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.068
Recommendations
- Metaheuristic approaches for the winner determination problem in combinatorial auction
- A heuristic algorithm based on weight-coded GA for WDP of combinatorial auctions
- A hybrid ant colony algorithm for the winner determination problem
- On heuristics for solving winner determination problem in combinatorial auctions
- An effective discrete dynamic convexized method for solving the winner determination problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26)
Cites Work
Cited In (7)
- The cross-entropy method for the winner determination problem in combinatorial auctions
- A hybrid ant colony algorithm for the winner determination problem
- An effective discrete dynamic convexized method for solving the winner determination problem
- A heuristic algorithm based on weight-coded GA for WDP of combinatorial auctions
- A new hybrid algorithm to solve winner determination problem in multiunit double internet auction
- Metaheuristic approaches for the winner determination problem in combinatorial auction
- Solving a dynamic combinatorial auctions problem by a hybrid metaheuristic based on a fuzzy dominance relation
This page was built for publication: A differential evolution algorithm for the winner determination problem in combinatorial auctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883609)
