Numerical experiments with LP formulations of the maximum clique problem

DOI10.1007/s10100-021-00776-zOpenAlexW3197317933MaRDI QIDQ2103941

Patrik Patassy, Dóra Kardos, Sándor Szabó, Bogdán Zaválnij

Publication date: 9 December 2022

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-021-00776-z

zbMATH Keywords

combinatorial optimizationmaximum clique problemgreedy coloringLP relaxation boundspractical solutions of NP complete problemszero-one linear programming

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• Algorithm 457

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact algorithm for the maximum clique problem
• Test case generators and computational results for the maximum clique problem
• A multi-KP modeling for the maximum-clique problem
• A fast algorithm for the maximum clique problem
• Greedy algorithms for triangle free coloring
• Edmonds polytopes and a hierarchy of combinatorial problems
• Some Zero-One Linear Programming Reformulations for the Maximum Clique Problem
• Parameterized Algorithms
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: Numerical experiments with LP formulations of the maximum clique problem