On heuristics for solving winner determination problem in combinatorial auctions

DOI10.1023/B:HEUR.0000045322.51784.2AzbMath1090.91034OpenAlexW2151214178MaRDI QIDQ1771208

Masaya Mito, Satoshi Fujita

Publication date: 7 April 2005

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:heur.0000045322.51784.2a

zbMATH Keywords

e-commercecombinatorial auctionwinner determination

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (1)

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

This page was built for publication: On heuristics for solving winner determination problem in combinatorial auctions