The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
From MaRDI portal
Publication:1569939
DOI10.1016/S0377-2217(99)00262-3zbMath0961.90067MaRDI QIDQ1569939
Elder Magalhães Macambira, Cid Carvalho De Souza
Publication date: 7 June 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
integer programmingbranch-and-cutpolyhedral combinatoricsBoolean quadric polytopeedge-weighted cliques
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Enumerative combinatorics (05A99)
Related Items (28)
A new family of facet defining inequalities for the maximum edge-weighted clique problem ⋮ The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem ⋮ The Boolean Quadric Polytope ⋮ Iterated tabu search for the maximum diversity problem ⋮ Breakout local search for maximum clique problems ⋮ An Exact Decomposition Approach for the Real-Time Train Dispatching Problem ⋮ On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study ⋮ Solving the maximum edge weight clique problem via unconstrained quadratic programming ⋮ A two-phase tabu search based evolutionary algorithm for the maximum diversity problem ⋮ The bipartite Boolean quadric polytope ⋮ Approximation with a fixed number of solutions of some multiobjective maximization problems ⋮ An efficient model for the multiple allocation hub maximal covering problem ⋮ A new branch-and-bound algorithm for the maximum edge-weighted clique problem ⋮ New facets and a branch-and-cut algorithm for the weighted clique problem. ⋮ Convex Optimization for Group Feature Selection in Networked Data ⋮ \(t\)-linearization for the maximum diversity problem ⋮ A nonconvex quadratic optimization approach to the maximum edge weight clique problem ⋮ Disconnecting graphs by removing vertices: a polyhedral approach ⋮ Upper bounds and heuristics for the 2-club problem ⋮ Solving the maximum edge-weight clique problem in sparse graphs with compact formulations ⋮ A Lagrangian relaxation approach to the edge-weighted clique problem ⋮ Exact and heuristic algorithms for the weighted total domination problem ⋮ A note on characterizing canonical cuts using geometry ⋮ Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem ⋮ Approximating the maximum vertex/edge weighted clique using local search ⋮ A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem ⋮ A new separation algorithm for the Boolean quadric and cut polytopes ⋮ A hybrid metaheuristic method for the maximum diversity problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Greedy randomized adaptive search procedures
- Some new classes of facets for the equicut polytope
- Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs
- Geometry of cuts and metrics
This page was built for publication: The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
