The MaxSAT Problem in the Real-Valued MV-Algebra

von Hanikovd, Zuzana
Veröffentlicht in TABLEAUX (32. : 2023 : Prag) Automated reasoning with analytic tableaux and related methods (2023)

On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem

von Li, Chu-Min
Veröffentlicht in Computers & operations research (2017)

Theory and Applications of Satisfiability Testing - SAT 2021 : 24th International Conference, Barcelona, Spain, July 5–9, 2021, proceedings

Veröffentlicht 2021

From Non-Clausal to Clausal MinSAT

von Li, Chu-Min
Veröffentlicht in Associació Catalana d'Intelligència Artificial (23. : 2021 : Online) Artificial intelligence research and development (2021)

Clause Branching in MaxSAT and MinSAT

von Argelich, Josep
Veröffentlicht in International Conference of the Catalan Association for Artificial Intelligence (21. : 2018 : Alt Emporda) Artificial intelligence research and development (2018)

A new upper bound for the maximum weight clique problem

von Li, Chu-Min
Veröffentlicht in European journal of operational research (12018)

Solving longest common subsequence problems via a transformation to the maximum clique problem

von Blum, Christian
Veröffentlicht in Computers & operations research (2021)

Papers in computational lexicography Complex '99 : [proceedings of the 4th International Conference on Computational Lexicography Complex '99, Budapest, Hungary]

Veröffentlicht 1999