Maximum cut-clique problem: ILS heuristics and a data analysis application

DOI10.1111/ITOR.12120zbMATH Open1338.90430OpenAlexW2162082186MaRDI QIDQ2806429FDOQ2806429

Authors Pedro Martins, Antonio Ladrón, H. Ramalhinho 

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

zbMATH Keywords

data miningmarket basket analysisdiscretized formulationsclique's edge neighborhoodcut cliquesiterated local search heuristics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A review on algorithms for maximum clique problems
• The maximum clique problem
• A branch and bound algorithm for the maximum clique problem
• A cutting-plane approach to the edge-weighted maximal clique problem
• Multi-neighborhood tabu search for the maximum weight clique problem

Cites Work

• A Convex Quadratic Characterization of the Lovász Theta Number
• A fast algorithm for the maximum clique problem
• A multi-KP modeling for the maximum-clique problem
• 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 study of ACO capabilities for solving the maximum clique problem
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
• Cliques with maximum/minimum edge neighborhood and neighborhood density
• Extended and discretized formulations for the maximum clique problem
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results
• Optimal Protein Structure Alignment Using Maximum Cliques
• Phased local search for the maximum clique problem
• Reactive local search for the maximum clique problem
• Simple ingredients leading to very efficient heuristics for the maximum clique problem

Cited In (1)

• Complexity and heuristics for the weighted max cut‐clique problem

Uses Software

• DIMACS

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)