Maximum cut-clique problem: ILS heuristics and a data analysis application
DOI10.1111/ITOR.12120zbMATH Open1338.90430OpenAlexW2162082186MaRDI QIDQ2806429FDOQ2806429
Pedro Martins, H. Ramalhinho, Antonio Ladrón
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
Recommendations
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)
Cites Work
- A fast algorithm for the maximum clique problem
- Reactive local search for the maximum clique problem
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- 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
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- A Convex Quadratic Characterization of the Lovász Theta Number
- Optimal Protein Structure Alignment Using Maximum Cliques
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results
- A note on the approximation of the MAX CLIQUE problem
- A sequential elimination algorithm for computing bounds on the clique number of a graph
- A multi-KP modeling for the maximum-clique problem
- Cliques with maximum/minimum edge neighborhood and neighborhood density
Cited In (1)
Uses Software
This page was built for publication: Maximum cut-clique problem: ILS heuristics and a data analysis application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806429)
