Heuristics for a bidding problem

DOI10.1016/J.COR.2005.01.007MaRDI QIDQ2489281zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 16 May 2006

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

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

zbMATH Keywords

Artificial intelligenceBiddingHeuristics

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• On heuristics for solving winner determination problem in combinatorial auctions
• A branch-and-price algorithm and new test problems for spectrum auctions
• Note: A local-search heuristic for large set-covering problems
• AI 2005: Advances in Artificial Intelligence
• Bin-packing by simulated annealing

Cites work

• Algorithm for optimal winner determination in combinatorial auctions
• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• Combinatorial auctions: a survey
• scientific article; zbMATH DE number 1966908 (Why is no real title available?)
• Optimization by simulated annealing

Cited in

(8)

• A hybrid ant colony algorithm for the winner determination problem
• The cross-entropy method for the winner determination problem in combinatorial auctions
• A new approach for modeling and solving set packing problems
• Metaheuristic approaches for the winner determination problem in combinatorial auction
• A differential evolution algorithm for the winner determination problem in combinatorial auctions
• An effective discrete dynamic convexized method for solving the winner determination problem
• A hybrid method for solving the multi-objective assignment problem
• Solving the set packing problem via a maximum weighted independent set heuristic

Describes a project that uses

Uses Software

• CPLEX
• CABOB

This page was built for publication: Heuristics for a bidding problem

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