A cutting-plane approach to the edge-weighted maximal clique problem

DOI10.1016/0377-2217(93)90097-7zbMath0787.90059OpenAlexW2093716880WikidataQ60395645 ScholiaQ60395645MaRDI QIDQ1309944

Gert Dijkhuizen, Ulrich Faigle

Publication date: 20 December 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/a-cuttingplane-approach-to-the-edgeweighted-maximal-clique-problem(d71fe2ad-5fff-467b-b3f6-5315e3f78b33).html

zbMATH Keywords

cutting planescomplete undirected graphmaximal clique problem

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Linear programming (90C05) Discrete location and assignment (90B80)

Related Items

A new family of facet defining inequalities for the maximum edge-weighted clique problem, A review on algorithms for maximum clique problems, A polyhedral approach for a constrained quadratic 0-1 problem, Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems, An iterated ``hyperplane exploration approach for the quadratic knapsack problem, The quadratic knapsack problem -- a survey, A general purpose exact solution method for mixed integer concave minimization problems, 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., PUSH: A generalized operator for the maximum vertex weight clique problem, A nonconvex quadratic optimization approach to the maximum edge weight clique problem, Disconnecting graphs by removing vertices: a polyhedral approach, Solving the maximum edge-weight clique problem in sparse graphs with compact formulations, A Lagrangian relaxation approach to the edge-weighted clique problem, A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem, An extended formulation approach to the edge-weighted maximal clique problem, The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations, Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm

Uses Software

• LOLIB

Cites Work

• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• A cutting plane algorithm for a clustering problem
• A Cutting Plane Algorithm for the Linear Ordering Problem
• Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs
• On the symmetric travelling salesman problem: Solution of a 120-city problem
• Solution of a Large-Scale Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item