A hybrid method to solve the multi-objective combinatorial auctions

MaRDI QIDQ5197810zbMATH OpenFDO

Authors Chahrazad Adiche, Meziane Aider

Publication date 19 September 2019

zbMATH Keywords

metaheuristicswinner determination problemhybrid methodscombinatorial auctionsfuzzy dominancemulti-objective branch and bound

Mathematics Subject Classification ID

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)

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

Cited in

(4)

• Solving a dynamic combinatorial auctions problem by a hybrid metaheuristic based on a fuzzy dominance relation
• A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
• A hybrid method for solving the multi-objective assignment problem
• A new hybrid algorithm to solve winner determination problem in multiunit double internet auction

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)