A Non-Exact Approach and Experimental Studies on the Combinatorial Auction Problem
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the problem. We study the existing exact and non-exact approaches to the problem and analyze the performance of those approaches. W...
Saved in:
Main Authors: | GUO, Yunsong, LIM, Andrew, RODRIGUES, Brian, ZHU, Y. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2005
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/594 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
by: GUO, Yunsong, et al.
Published: (2005) -
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
by: GUO, Yunsong, et al.
Published: (2006) -
Heuristics for a Bidding Problem
by: GUO, Yunsong, et al.
Published: (2006) -
A Centroid-Based Approach to Solve the Bandwidth Minimization Problem
by: LIM, Andrew, et al.
Published: (2004) -
Heuristics for a Brokering Set Packing Problem
by: GUO, Yunso, et al.
Published: (2004)