Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

COR
2006

favoriteEmaildiscussreport

86views more COR 2006»

Heuristics for a bidding problem

13 years 4 months ago

Heuristics for a bidding problem

Download acadepedia.com

In this paper, we study a bidding problem which can be modeled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-bound move, is developed for the problem. We compared the heuristic with the CPLEX 8.0 solver and the current best non-exact method, Casanova, using the standard CATS benchmark and other realistic test sets. Results show that the heuristic outperforms CPLEX and Casanova. 2005 Elsevier Ltd. All rights reserved.

Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu

Real-time Traffic

COR 2006 | CPLEX 8.0 Solver | Heuristic | Set Packing Problem |

claim paper

Related Content

» Budget constrained bidding in keyword auctions and online knapsack problems

» A heuristic bidding strategy for multiple heterogeneous auctions

» Supporting CoAllocation in an AuctioningBased Resource Allocator for Grid Systems

» Multirobot coordination by auctioning POMDPs

» CABOB A Fast Optimal Algorithm for Combinatorial Auctions

» Bidding for Customer Orders in TAC SCM

» A Lagrangian Heuristic for Winner Determination Problem in Combinatorial Auctions

» Efficient Bids on Task Allocation for MultiRobot Exploration

» Bundle Design in Robust Combinatorial Auction Protocol against Falsename Bids

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COR
Authors	Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu

Comments (0)