Solving the maximum edge weight clique problem via unconstrained quadratic programming

European Journal of Operational Research

Volumn 181, Issue 2, 2007, Pages 592-597

  Alidaee, Bahram ^a   Glover, Fred ^b   Kochenberger, Gary ^c   Wang, Haibo ^d  

^a UNIVERSITY OF MISSISSIPPI   (United States)

^b UNIVERSITY OF COLORADO   (United States)

^c UNIVERSITY OF COLORADO   (United States)

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

Author keywords

Combinatorial optimization; Integer programming; Metaheuristics

Indexed keywords

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPERATIONS RESEARCH; PROBLEM SOLVING;

COMPUTATIONAL TIMES; EDGE WEIGHTED CLIQUE PROBLEM; METAHEURISTICS; QUADRATIC BINARY PROGRAMS;

QUADRATIC PROGRAMMING;

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

References (15)

1. Alidaee B., Glover F., Kochenberger G., and Rego C. A new modeling and solution approach for the number partitioning problem. Journal of Applied Mathematics and Decision Sciences 9 (2005) 113-121
2. Alidaee, B., Kochenberger, G., Lewis, K., Lewis, M., Wang, H., 2006. Modeling and solving set packing problems via unconstrained quadratic programming, Working Paper, University of Colorado at Denver.
3. Boros E., and Hammer P. Cut-polytopes, Boolean quadratic polytopes and nonnegative quadratic pseudo-Boolean functions. Mathematics of OR 18 (1993) 245-253
4. Glover F., Kochenberger G.A., and Alidaee B. Adaptive memory tabu search for binary quadratic programs. Management Science 44 (1998) 336
5. Glover F., Kochenberger G., Alidaee B., and Amini M. Tabu search with critical event memory: An enhanced application for binary quadratic programs. In: Voss S., Martello S., Osman I., and Roucairol C. (Eds). Meta-Heuristics, Advances and Trends in Local Search Paradigms for Optimization (1999), Kluwer 93-109
6. Hunting M., Faigle U., and Kern W. A Lagrangian relaxation approach to the edge-weighted clique problem. European Journal of Operational Research 131 (2001) 119-131
7. Kochenberger G., Glover F., Alidaee B., and Rego C. Solving combinatorial optimization problems via reformulation and adaptive memory metaheuristics. In: Goldberg A.M.a.D. (Ed). Revolutionary Visions in Evolutionary Computation (2004), Kluwer Publisher
8. 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
9. 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
10. Kochenberger G., Glover F., Alidaee B., and Rego C. An unconstrained quadratic binary approach to the vertex coloring problem. Annals of OR 139 (2005) 229-241
11. Macambira E.M. An application of tabu search heuristic for the maximum edge-weighted subgraph problem. Annals of OR 117 (2003) 175-190
12. Macambira, E.M., de Meneses, C.N., 1998. A GRASP for the maximum edge-weighted subgraph problem. IX Confresso Latino-Iberoamericano de Investigacion Operativa; University of Buenos Aires.
13. Macambira E.M., and de Souza C.C. The edge-weighted clique problem: valid inequalities, facets and polyhedral computations. European Journal of Operational Research 123 (2000) 346-371
14. Mehrotra A. Cardinality constrained Boolean quadratic polytope. Discrete Applied Mathematics 79 (1997) 137-154
15. Sorensen M. New facets and a branch-and-cut algorithm for the weighted clique problem. European Journal of Operational Research 154 (2004) 57-70