loading...
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
Hong Kong, China November 14-November 16
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICTAI.2005.12617th IEEE International Conference on ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Y. Guo, A. Lim, B. Rodrigues, J. Tang, "Using a Lagrangian Heuristic for a Combinatorial Auction Problem," Tools with Artificial Intelligence, IEEE International Conference on, pp. 99-103, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ICTAI.2005.126,
author = {Y. Guo and A. Lim and B. Rodrigues and J. Tang},
title = {Using a Lagrangian Heuristic for a Combinatorial Auction Problem},
journal ={Tools with Artificial Intelligence, IEEE International Conference on},
volume = {0},
year = {2005},
issn = {1082-3409},
pages = {99-103},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICTAI.2005.126},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Tools with Artificial Intelligence, IEEE International Conference on
TI - Using a Lagrangian Heuristic for a Combinatorial Auction Problem
SN - 1082-3409
SP99
EP103
A1 - Y. Guo,
A1 - A. Lim,
A1 - B. Rodrigues,
A1 - J. Tang,
PY - 2005
KW - null
VL - 0
JA - Tools with Artificial Intelligence, IEEE International Conference on
ER -
 
Y. Guo, National University of Singapore
A. Lim, Hong Kong University of Science and Technology
B. Rodrigues, Singapore Management University
J. Tang, Hong Kong University of Science and Technology
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experiments are conducted using benchmark CATS test sets and more complex test sets. The algorithm provides optimal solutions for most test sets and is always 1% from the optimal solutions for all CATS test sets. Comparisons with CPLEX 8.0 are also provided, which show that the algorithm provides good solutions.
Citation:
Y. Guo, A. Lim, B. Rodrigues, J. Tang, "Using a Lagrangian Heuristic for a Combinatorial Auction Problem," ictai, pp.99-103, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.