An effective discrete dynamic convexized method for solving the winner determination problem

DOI10.1007/S10878-015-9883-9MaRDI QIDQ306103zbMATHOpenAlexWikidataFDO

Authors Geng Lin, M. Montaz Ali, Wenxing Zhu

Publication date 31 August 2016

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-015-9883-9

zbMATH Keywords

local searchwinner determination problemadaptive penalty functiondiscrete dynamic convexized method

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Integer programming (90C10)

Recommendations

• On heuristics for solving winner determination problem in combinatorial auctions
• A differential evolution algorithm for the winner determination problem in combinatorial auctions
• A hybrid ant colony algorithm for the winner determination problem
• Metaheuristic approaches for the winner determination problem in combinatorial auction
• The cross-entropy method for the winner determination problem in combinatorial auctions

Cites work

• A discrete dynamic convexized method for nonlinear integer programming
• A discrete dynamic convexized method for the max-cut problem
• A dynamic convexized method for nonconvex mixed integer nonlinear programming
• A memetic algorithm for graph coloring
• A penalty function-based differential evolution algorithm for constrained global optimization
• Algorithm for optimal winner determination in combinatorial auctions
• Approximations of Weighted Independent Set and Hereditary Subset Problems
• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• Combinatorial auctions: a survey
• Computationally manageable combinational auctions
• Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
• Heuristics for a bidding problem
• Metaheuristic approaches for the winner determination problem in combinatorial auction
• Models for bundle trading in financial markets
• On heuristics for solving winner determination problem in combinatorial auctions

Cited in

(6)

• A differential evolution algorithm for the winner determination problem in combinatorial auctions
• Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System
• The cross-entropy method for the winner determination problem in combinatorial auctions
• Improved discrete PSO algorithm and its application in winner determination problem
• A hybrid ant colony algorithm for the winner determination problem
• Winner-take-all based on discrete-time dynamic feedback

Describes a project that uses

Uses Software

• CABOB

This page was built for publication: An effective discrete dynamic convexized method for solving the winner determination problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306103)