Solving weighted Maximum Satisfiability with Branch and Bound and clause learning
| Year of publication: |
2025
|
|---|---|
| Authors: | Coll, Jordi ; Li, Chu-Min ; Li, Shuolin ; Habet, Djamal ; ManyĆ , Felip |
| Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 183.2025, Art.-No. 107195, p. 1-13
|
| Subject: | Branch-and-Bound algorithm | Clause learning | Combinatorial optimization | Weighted partial MaxSAT | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Lernprozess | Learning process | Algorithmus | Algorithm | Lernen | Learning |
-
CliSAT : a new exact algorithm for hard maximum clique problems
San Segundo, Pablo, (2023)
-
An exact algorithm for the block relocation problem with a stowage plan
Tanaka, Shunji, (2019)
-
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano, (2021)
- More ...
-
Li, Chu-Min, (2017)
-
A new upper bound for the maximum weight clique problem
Li, Chu-Min, (2018)
-
Solving longest common subsequence problems via a transformation to the maximum clique problem
Blum, Christian, (2021)
- More ...