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

DOI10.1007/s10878-015-9883-9zbMath1404.91126OpenAlexW2036787800WikidataQ57931861 ScholiaQ57931861MaRDI QIDQ306103

Geng Lin, M. Montaz Ali, Wen-Xing 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

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

Related Items

A hybrid ant colony algorithm for the winner determination problem, The cross-entropy method for the winner determination problem in combinatorial auctions

Uses Software

• CABOB

Cites Work

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