Maximum cut-clique problem: ILS heuristics and a data analysis application
From MaRDI portal
Publication:2806429
DOI10.1111/itor.12120zbMath1338.90430OpenAlexW2162082186MaRDI QIDQ2806429
No author found.
Publication date: 18 May 2016
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10230/44396
data miningmarket basket analysisdiscretized formulationsclique's edge neighborhoodcut cliquesiterated local search heuristics
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Uses Software
Cites Work
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- A sequential elimination algorithm for computing bounds on the clique number of a graph
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- A note on the approximation of the MAX CLIQUE problem
- A multi-KP modeling for the maximum-clique problem
- A fast algorithm for the maximum clique problem
- Cliques with maximum/minimum edge neighborhood and neighborhood density
- Phased local search for the maximum clique problem
- A study of ACO capabilities for solving the maximum clique problem
- Extended and discretized formulations for the maximum clique problem
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results
- Optimal Protein Structure Alignment Using Maximum Cliques
- A Convex Quadratic Characterization of the Lovász Theta Number
- Reactive local search for the maximum clique problem