A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction

DOI10.1016/j.cor.2007.08.003zbMath1152.91473OpenAlexW2088572631MaRDI QIDQ947956

Can Özturan, Ali Haydar Özer

Publication date: 8 October 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.08.003

zbMATH Keywords

optimizationinteger programmingmulti-unit auctionswinner determinationcombinatorial auctionscombinatorial bidding

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 (2)

Walrasian equilibria from an optimization perspective: A guide to the literature ⋮ Integer programming based heterogeneous CPU-GPU cluster schedulers for SLURM resource manager

Uses Software

• CPLEX
• CABOB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• BOB: Improved winner determination in combinatorial auctions and generalizations
• Computationally Manageable Combinational Auctions
• Combinatorial Auctions: A Survey
• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
• Combinatorial auction design
• Algorithm for optimal winner determination in combinatorial auctions

This page was built for publication: A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction