An iterative Path-Breaking approach with mutation and restart strategies for the MAX-SAT problem
Year of publication: |
2019
|
---|---|
Authors: | Xu, Zhenxing ; He, Kun ; Li, Chu-Min |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 104.2019, p. 49-58
|
Subject: | Combinatorial optimization | Maximum satisfiability | Local search | Path-Breaking | Mutation | Mathematische Optimierung | Mathematical programming | Spieltheorie | Game theory | USA | United States | Theorie | Theory |
-
Curiel, Imma J., (1997)
-
Recursive circle packing problems
Pedroso, João Pedro, (2016)
-
Relaxation heuristics for the set multicover problem with generalized upper bound constraints
Umetani, Shunji, (2018)
- More ...
-
An Efficient Solution Space Exploring and Descent Method for Packing Equal Spheres in a Sphere
Zhou, Jianrong, (2023)
-
Dynamic reduction heuristics for the rectangle packing area minimization problem
He, Kun, (2015)
-
Ji, Pengli, (2017)
- More ...