Complexity and heuristics for the weighted max cut‐clique problem

DOI10.1111/itor.12807OpenAlexW3021789649MaRDI QIDQ6091425

Franco Robledo, Eduardo A. Canale, Pablo Romero, Mathias Bourel, Unnamed Author

Publication date: 24 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12807

zbMATH Keywords

tabu searchGRASPILPcombinatorial optimization problemmax cut-clique

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximating the maximum vertex/edge weighted clique using local search
• Cliques with maximum/minimum edge neighborhood and neighborhood density
• Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
• Maximum cut-clique problem: ILS heuristics and a data analysis application
• Optimization by GRASP
• Reducibility among Combinatorial Problems
• Enumerating Isolated Cliques in Synthetic and Financial Networks
• The complexity of theorem-proving procedures
• Handbook of metaheuristics

This page was built for publication: Complexity and heuristics for the weighted max cut‐clique problem