Heuristics for a bidding problem

DOI10.1016/j.cor.2005.01.007zbMath1086.90062OpenAlexW1987751154MaRDI QIDQ2489281

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 intelligenceHeuristicsBidding

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)

Related Items (8)

A Differential Evolution Algorithm for the Winner Determination Problem in Combinatorial Auctions ⋮ Solving the set packing problem via a maximum weighted independent set heuristic ⋮ A hybrid ant colony algorithm for the winner determination problem ⋮ An effective discrete dynamic convexized method for solving the winner determination problem ⋮ The cross-entropy method for the winner determination problem in combinatorial auctions ⋮ A hybrid method for solving the multi-objective assignment problem ⋮ A new approach for modeling and solving set packing problems ⋮ Metaheuristic Approaches for the Winner Determination Problem in Combinatorial Auction

Uses Software

• CPLEX
• CABOB

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Combinatorial Auctions: A Survey
• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• Algorithm for optimal winner determination in combinatorial auctions

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