A new approach for modeling and solving set packing problems

European Journal of Operational Research

Volumn 186, Issue 2, 2008, Pages 504-512

  Alidaee, Bahram ^a   Kochenberger, Gary ^b   Lewis, Karen ^a   Lewis, Mark ^c   Wang, Haibo ^d  

^a UNIVERSITY OF MISSISSIPPI   (United States)

^b UNIVERSITY OF COLORADO   (United States)

^c MISSOURI WESTERN STATE UNIVERSITY   (United States)

^d TEXAS A AND M INTERNATIONAL UNIVERSITY   (United States)

Author keywords

Combinatorial auctions; Integer programming; Metaheuristics; Set packing problem; Unconstrained quadratic binary program

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION;

COMBINATORIAL AUCTIONS; METAHEURISTICS; QUADRATIC BINARY PROGRAM; SET PACKING PROBLEM;

PROBLEM SOLVING;

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

References (30)

1. Alidaee, B., Glover, F., Kochenberger, G., Wang, H., 2006. Solving the Maximum Edge Weight Clique Problem via Unconstrained Quadratic Programming, Working paper, University of Colorado at Denver.
2. Alkhamis T.M., Hasan M., and Ahmed M.A. Simulated annealing for the unconstrained quadratic pseudo-Boolean function. European Journal of Operational Research 108 (1998) 641-652
3. Amini M., Alidaee B., and Kochenberger G.A. Scatter search approach to unconstrained quadratic binary programs. In: Corne D., and Glover F. (Eds). New Methods in Optimization (1999), McGraw-Hill 317-330
4. Beasley, E., 1998. Heuristic Algorithms for the Unconstrained Binary Quadratic Programming Problem, Working Paper.
5. Billionet A., and Sutter A. Minimization of a quadratic pseudo-Boolean function. European Journal of Operational Research 78 (1994) 106-115
6. Boros E., and Hammer P. Pseudo-Boolean optimization. Discrete Applied Mathematics 123 1-3 (2002) 155-225
7. Boros, E., Hammer, P., Sun, X., 1989. The DDT Method for Quadratic 0-1 Minimization RUTCOR Research Center, RRR 39-89.
8. Cornuéjols, G., 2001. Combinatorial Optimization: Packing and Covering, CBMS-NSF.
9. Delorme X., Gandibleau X., and Rodriques J. GRASP for set packing. European Journal of Operational Research 153 (2004) 564-580
10. Glover F., Kochenberger G.A., and Alidaee B. Adaptive memory tabu search for binary quadratic programs. Management Science 44 (1998) 336
11. Glover F., Kochenberger G., Alidaee B., and Amini M. Tabu search with critical event memory: An enhanced application for binary quadratic programs in meta-heuristics. In: Voss S., Mortello S., Osman I., and Roucairol C. (Eds). Advances and Trends in Local Search Paradigms for Optimization (1999), Kluwer 93-109
12. Glover F., Alidaee B., Rego C., and Kochenberger G. One-pass heuristics for large-scale unconstrained binary quadratic problems. European Journal of Operational Research 137 (2002) 272-287
13. Guo Y., Lim A., Rodrigues B., and Zhu Y. Heuristics for a bidding problem. Computers & Operations Research 33 (2006) 2179-2188
14. Hammer P., and Rudeanu S. Boolean Methods in Operations Research (1968), Springer-Verlag, New York
15. Hansen P.B. Methods of nonlinear 0-1 programming. Annals Discrete Mathematics 5 (1979) 53-70
16. Katayama, K., Tani, M., Narihisa, H., 2000. Solving large binary quadratic programming problems by an effective genetic local search algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'00), Morgan Kaufmann.
17. Kochenberger G., Glover F., Alidaee B., and Rego C.A. Unified modeling and solution framework for combinatorial optimization problems. Operations Research Spectrum 26 (2004) 237-250
18. Kochenberger G., Glover F., Alidaee B., and Lewis K. Using the unconstrained quadratic program to model and solve Max 2-Sat problems. International Journal of Operational Research 1 (2005) 89-100
19. Kochenberger G., Glover F., Alidaee B., and Rego C. An unconstrained quadratic binary programming approach to the vertex coloring problem. Annals of OR 139 (2005) 229-241
20. Lau, H., Goh, Y., 2002. An intelligent brokering system to support multi-agent web-based 4th party logistics. In: Proceedings of the 14th International Conference on Tools with AI, pp. 10-11.
21. Lewis M., Alidaee B., and Kochenberger G. Using xQx to model and solve the uncapacitated task allocation problem. OR Letters 33 (2005) 176-182
22. Leyton-Brown, K., Pearson, M., Shoham, Y., 2000. Towards a Universal Test Suite for Combinatorial Auction Algorithms, In: ACM conference on electronic commerce.
23. Lodi A., Allemand K., and Liebling T. An evolutionary heuristic for quadratic 0-1 programming. European Journal of Operational Research 119 (1999) 662-670
24. Merz, P., Freisleben, B., 1999. Genetic algorithms for binary quadratic programming. In: Proceedings of the 1999 International Genetic and Evolutionary Computation Conference (GECCO'99), pp. 417-424.
25. Padberg M. On the facial structure of set packing polyhedra. Mathematical Programming 5 (1973) 199-215
26. Palubeckis G.A. Heuristic-branch and bound algorithm for the unconstrained quadratic zero-one programming problem. Computing (1995) 284-301
27. Pekec A., and Rothkopf M. Combinatorial auction design. Management Science 49 (2003) 1485-1503
28. Ronnqvist M. Optimization in forestry. Mathematical Programming, Series B 97 (2003) 267-284
29. Sandholm T., Suri S., Gilpin A., and Levine D. CABOB: A fast optimal algorithm for winner determination in combinatorial auctions. Management Science 51 (2005) 374
30. Vemuganti R. Applications of set covering, set packing and set partitioning models: A survey. In: Zhu D., and Pardalos P. (Eds). Handbook of Combinatorial Optimization (1998), Kluwer Academic Publishers