Some Zero-One Linear Programming Reformulations for the Maximum Clique Problem

DOI10.1556/314.2020.00005zbMATH Open1474.94099OpenAlexW3160710315MaRDI QIDQ4997639

Sándor Szabó, Ákos Beke, Bogdán Zaválnij

Publication date: 29 June 2021

Published in: Mathematica Pannonica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1556/314.2020.00005

zbMATH Keywords

combinatorial optimizationgreedy coloringmaximum cliquespractical solutions of NP complete problemszero-one linear programming

Mathematics Subject Classification ID

Other types of codes (94B60) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Related Items (3)

Concise integer linear programming formulation for clique partitioning problems ⋮ Numerical experiments with LP formulations of the maximum clique problem ⋮ A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem

This page was built for publication: Some Zero-One Linear Programming Reformulations for the Maximum Clique Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4997639)