Data dependent worst case bounds for weighted set packing

European Journal of Operational Research

Volumn 167, Issue 1, 2005, Pages 68-76

  Kwon, Roy H ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Heuristics; Integer programming; Linear programming duality; Weighted independent set; Weighted set packing

Indexed keywords

ALGORITHMS; DATA REDUCTION; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING;

SET PACKING PROBLEM (SP); WEIGHTED INDEPENDENT SETS; WEIGHTED SET PACKING; WORST CASE ANALYSIS;

OPERATIONS RESEARCH;

EID: 13544260502     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.01.049     Document Type: Article

References (6)

1. DeVries S., Vohra R. Combinatorial auctions: A survey. INFORMS Journal on Computing. 15(3):2003;284-309
2. Fisher M. Worst-case analysis of heuristic algorithms. Management Science. 26:1980;1-17
3. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness. 1978;W.H. Freeman, New York
4. Oguz O. Data dependent worst case bound improving techniques in zero-one programming. European Journal of Operational Research. 51:1991;400-404
5. Sakai S., Togasaki M., Yamazaki K. A note on greedy algorithms for the maximum weighted independent set problem. Discrete Applied Mathematics. 126:2003;313-322
6. Sandholm T. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence. 135:2002;1-54