Sciweavers

Share
AMAI
2004
Springer

Heuristics for a Brokering Set Packing Problem

10 years 1 months ago
Heuristics for a Brokering Set Packing Problem
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results are compared with a recent heuristic algorithm and also with the CPLEX Integer Programming solver where we found that the simulated annealing approach outperforms the previous heuristic method and CPLEX obtaining results within smaller timescales.
Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where AMAI
Authors Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu
Comments (0)
books