Solving the maximum edge weight clique problem via unconstrained quadratic programming
暂无分享,去创建一个
Fred W. Glover | Bahram Alidaee | Haibo Wang | Gary A. Kochenberger | F. Glover | G. Kochenberger | B. Alidaee | Haibo Wang
[1] F. Glover,et al. Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programs , 1999 .
[2] Cid C. de Souza,et al. The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations , 2000, Eur. J. Oper. Res..
[3] Endre Boros,et al. Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions , 1993, Math. Oper. Res..
[4] Fred Glover,et al. Solving Combinatorial Optimization Problems Via Reformulation and Adaptive Memory Metaheuristics , 2004 .
[5] F. Glover,et al. Adaptive Memory Tabu Search for Binary Quadratic Programs , 1998 .
[6] Fred W. Glover,et al. A new modeling and solution approach for the number partitioning problem , 2005, Adv. Decis. Sci..
[7] Anuj Mehrotra. Cardinality Constrained Boolean Quadratic Polytope , 1997, Discret. Appl. Math..
[8] F. Glover,et al. Using the unconstrained quadratic program to model and solve Max 2-SAT problems , 2005 .
[9] Silvano Martello,et al. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .
[10] Fred W. Glover,et al. An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem , 2005, Ann. Oper. Res..
[11] Michael M. Sørensen,et al. New facets and a branch-and-cut algorithm for the weighted clique problem , 2004, Eur. J. Oper. Res..
[12] Fred W. Glover,et al. A unified modeling and solution framework for combinatorial optimization problems , 2004, OR Spectr..
[13] Elder M. Macambira. An Application of Tabu Search Heuristic for the Maximum Edge-Weighted Subgraph Problem , 2002, Ann. Oper. Res..
[14] Ulrich Faigle,et al. A Lagrangian relaxation approach to the edge-weighted clique problem , 2001, Eur. J. Oper. Res..