Solving the maximum edge weight clique problem via unconstrained quadratic programming
From MaRDI portal
Publication:877032
DOI10.1016/J.EJOR.2006.06.035zbMATH Open1131.90046OpenAlexW2078797727MaRDI QIDQ877032FDOQ877032
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
Recommendations
- A unified framework for modeling and solving combinatorial optimization problems: a tutorial
- The unconstrained binary quadratic programming problem: a survey
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Solving the maximum vertex weight clique problem via binary quadratic programming
- A note on xQx as a modelling and solution framework for the linear ordering problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- A unified modeling and solution framework for combinatorial optimization problems
- A new approach for modeling and solving set packing problems
- Adaptive memory tabu search for binary quadratic programs
- 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
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- A Lagrangian relaxation approach to the edge-weighted clique problem
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Using the unconstrained quadratic program to model and solve Max 2-SAT problems
- Title not available (Why is that?)
- A new modeling and solution approach for the number partitioning problem
- Cardinality constrained Boolean quadratic polytope
Cited In (27)
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
- Iterated greedy for the maximum diversity problem
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- On fuzzy random multiobjective quadratic programming
- Approximation with a fixed number of solutions of some multiobjective maximization problems
- Common Object Discovery as Local Search for Maximum Weight Cliques in a Global Object Similarity Graph
- On the Approximability of the Minimum Weight $t$-partite Clique Problem
- Iterated tabu search for the maximum diversity problem
- A unified framework for modeling and solving combinatorial optimization problems: a tutorial
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- Branch-and-price for \(p\)-cluster editing
- On solutions of fuzzy random multiobjective quadratic programming with applications in portfolio problem
- Solving the maximum vertex weight clique problem via binary quadratic programming
- Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization
- A cutting-plane approach to the edge-weighted maximal clique problem
- PUSH: A generalized operator for the maximum vertex weight clique problem
- Using the unconstrained quadratic program to model and solve Max 2-SAT problems
- Upper bounds and heuristics for the 2-club problem
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- A new family of facet defining inequalities for the maximum edge-weighted clique problem
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure
- A hybrid metaheuristic method for the maximum diversity problem
- An extended formulation approach to the edge-weighted maximal clique problem
- A new approach for modeling and solving set packing problems
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem
This page was built for publication: Solving the maximum edge weight clique problem via unconstrained quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877032)
