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
Cid Carvalho De Souza, Elder Magalhães Macambira
Publication date: 7 June 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
integer programming; branch-and-cut; polyhedral combinatorics; Boolean quadric polytope; edge-weighted cliques
90C10: Integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
05A99: Enumerative combinatorics
Related Items
Disconnecting graphs by removing vertices: a polyhedral approach, A note on characterizing canonical cuts using geometry, A Lagrangian relaxation approach to the edge-weighted clique problem, Breakout local search for maximum clique problems, Approximation with a fixed number of solutions of some multiobjective maximization problems, Upper bounds and heuristics for the 2-club problem, Solving the maximum edge weight clique problem via unconstrained quadratic programming, Approximating the maximum vertex/edge weighted clique using local search, New facets and a branch-and-cut algorithm for the weighted clique problem., Solving the maximum edge-weight clique problem in sparse graphs with compact formulations, A new separation algorithm for the Boolean quadric and cut polytopes, A hybrid metaheuristic method for the maximum diversity problem, 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, Iterated tabu search for the maximum diversity problem, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem, An Exact Decomposition Approach for the Real-Time Train Dispatching 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
