A hybrid method to solve the multi-objective combinatorial auctions
zbMATH Open1425.91181MaRDI QIDQ5197810FDOQ5197810
Authors: Chahrazad Adiche, Meziane Aider 
Publication date: 19 September 2019
Recommendations
- Solving a dynamic combinatorial auctions problem by a hybrid metaheuristic based on a fuzzy dominance relation
- Solving the combinatorial double auction problem
- A hybrid method for solving the multi-objective assignment problem
- Metaheuristic approaches for the winner determination problem in combinatorial auction
- MICAI 2004: Advances in Artificial Intelligence
metaheuristicswinner determination problemhybrid methodscombinatorial auctionsfuzzy dominancemulti-objective branch and bound
Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26)
Cited In (4)
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
- A new hybrid algorithm to solve winner determination problem in multiunit double internet auction
- A hybrid method for solving the multi-objective assignment problem
- Solving a dynamic combinatorial auctions problem by a hybrid metaheuristic based on a fuzzy dominance relation
This page was built for publication: A hybrid method to solve the multi-objective combinatorial auctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5197810)
