A new family of facet defining inequalities for the maximum edge-weighted clique problem
From MaRDI portal
Publication:2361127
DOI10.1007/s11590-016-1055-zzbMath1398.90137OpenAlexW2468891477MaRDI QIDQ2361127
Publication date: 29 June 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/82137/1/Facet_Inequalities.pdf
integer programmingcutting planesseparation algorithmBoolean quadric polytopefacet defining inequalitiesedge-weighted clique problem
Related Items (3)
An efficient local search algorithm for solving maximum edge weight clique problem in large graphs ⋮ A cut-and-branch algorithm for the quadratic knapsack problem ⋮ Multilinear sets with two monomials and cardinality constraints
Uses Software
Cites Work
- The quadratic knapsack problem -- a survey
- Solving the maximum edge weight clique problem via unconstrained quadratic programming
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- An extended formulation approach to the edge-weighted maximal clique problem
- A cutting-plane approach to the edge-weighted maximal clique problem
- Min-cut clustering
- 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
- A semidefinite programming approach to the quadratic knapsack problem
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- A review on algorithms for maximum clique problems
- A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
- Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs
- Heuristic and Special Case Algorithms for Dispersion Problems
- Exact Solution of the Quadratic Knapsack Problem
- A Lagrangian relaxation approach to the edge-weighted clique problem
This page was built for publication: A new family of facet defining inequalities for the maximum edge-weighted clique problem
