Clique inference process for solving Max-CSP

DOI10.1016/J.EJOR.2007.06.069MaRDI QIDQ1042201zbMATH OpenOpenAlexFDO

Authors Mohand Ou Idir Khemmoudj, Hachemi Bennaceur

Publication date 7 December 2009

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2007.06.069

zbMATH Keywords

linear programmingbinary cliqueMax-CSP lower bounds

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27)

Recommendations

• Clique Inference Process for Solving Max-CSP
• Using constraint programming to solve the maximum clique problem
• Solving Max-SAT as weighted CSP
• Solving maximum weight clique using maximum satisfiability reasoning
• A Max-SAT Inference-Based Pre-processing for Max-Clique

Cites work

• scientific article; zbMATH DE number 6118217 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• Maintaining reversible DAC for Max-CSP
• Network flows. Theory, algorithms, and applications.
• Solving weighted CSP by maintaining arc consistency

Cited in

(1)

• Clique Inference Process for Solving Max-CSP

This page was built for publication: Clique inference process for solving Max-CSP

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