Some zero-one linear programming reformulations for the maximum clique problem

DOI10.1556/314.2020.00005MaRDI QIDQ4997639zbMATH OpenOpenAlexFDO

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

Publication date 29 June 2021

Published in Mathematica Pannonica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

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

Recommendations

• scientific article; zbMATH DE number 956840
• Using constraint programming to solve the maximum clique problem
• A branch and bound algorithm for the maximum clique problem
• The maximum clique problem
• On solving the maximum clique problem

Cited in

(3)

• Numerical experiments with LP formulations of the maximum clique problem
• Concise integer linear programming formulation for clique partitioning problems
• 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)