Solving the maximum edge weight clique problem via unconstrained quadratic programming
From MaRDI portal
Publication:877032
DOI10.1016/j.ejor.2006.06.035zbMath1131.90046OpenAlexW2078797727MaRDI QIDQ877032
Fred Glover, Bahram Alidaee, Haibo Wang, Gary A. Kochenberger
Publication date: 19 April 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.035
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A new family of facet defining inequalities for the maximum edge-weighted clique problem, Solving the maximum vertex weight clique problem via binary quadratic programming, Iterated tabu search for the maximum diversity problem, An efficient local search algorithm for solving maximum edge weight clique problem in large graphs, Approximation with a fixed number of solutions of some multiobjective maximization problems, On the Approximability of the Minimum Weight $t$-partite Clique Problem, Improved estimation of duality gap in binary quadratic programming using a weighted distance measure, A new approach for modeling and solving set packing problems, On solutions of fuzzy random multiobjective quadratic programming with applications in portfolio problem, PUSH: A generalized operator for the maximum vertex weight clique problem, On fuzzy random multiobjective quadratic programming, A nonconvex quadratic optimization approach to the maximum edge weight clique problem, An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem, Upper bounds and heuristics for the 2-club problem, Branch-and-price for \(p\)-cluster editing, Iterated greedy for the maximum diversity problem, A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem, Common Object Discovery as Local Search for Maximum Weight Cliques in a Global Object Similarity Graph, Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization, A hybrid metaheuristic method for the maximum diversity problem
Cites Work
- Unnamed Item
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- A new modeling and solution approach for the number partitioning problem
- Cardinality constrained Boolean quadratic polytope
- New facets and a branch-and-cut algorithm for the weighted clique problem.
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- An application of tabu search heuristic for the maximum edge-weighted subgraph problem
- A unified modeling and solution framework for combinatorial optimization problems
- A new approach for modeling and solving set packing problems
- Using the unconstrained quadratic program to model and solve Max 2-SAT problems
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- A Lagrangian relaxation approach to the edge-weighted clique problem
