GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem [PDF]
, 2005 A GRASP with path-relinking for finding good-quality solutions of the weighted maximum satisfiability problem (MAX-SAT) is described in this paper. GRASP, or Greedy Randomized Adaptive Search Procedure, is a randomized multi-start metaheuristic, where at each iteration locally optimal solutions are constructed, each independent of the others.
FESTA, PAOLA +3 more
openaire +3 more sources
Portable PGAS‐Based GPU‐Accelerated Branch‐And‐Bound Algorithms at Scale
Concurrency and Computation: Practice and Experience, Volume 37, Issue 25-26, 30 November 2025.ABSTRACT The Branch‐and‐Bound (B&B) technique plays a key role in solving many combinatorial optimization problems, enabling efficient problem‐solving and decision‐making in a wide range of applications. It incrementally constructs a tree by building candidates to the solutions and abandoning a candidate as soon as it determines that it cannot lead to ...
Guillaume Helbecque +4 more
wiley +1 more source
A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas
, 2005 We compute the probability of satisfiability of a class of random Horn-SAT formulae, motivated by a connection with the nonemptiness problem of finite tree automata.
Demopoulos, Demetrios +3 more
core +2 more sources
On Using Unsatisfiability for Solving Maximum Satisfiability [PDF]
, 2007 Maximum Satisfiability (MaxSAT) is a well-known optimization pro- blem, with several practical applications. The most widely known MAXS AT algorithms are ineffective at solving hard problems instances from practical application domains.
Marques-Silva, Joao, Planes, Jordi
core +2 more sources
Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability
, 2018 A matched formula is a CNF formula whose incidence graph admits a matching which matches a distinct variable to every clause. We study phase transition in a context of matched formulas and their generalization of biclique satisfiable formulas.
B Bollobás +7 more
core +1 more source
Leveraging Quantum Annealing for Layout Optimization
Advanced Quantum Technologies, Volume 8, Issue 11, November 2025.The authors address wind farm layout optimization by formulating it as a QUBO problem using the Jensen wake model. They compare quantum annealing, Gurobi, and QAOA, highlighting trade‐offs between solution quality and computational time. Results show that quantum annealing offers rapid, near‐optimal solutions, making it suitable for fast approximations
Luca Nigro +3 more
wiley +1 more source
Partial maximum satisfiability problem method combined with structure characteristics for diagnostic problems [PDF]
, 2019 Huisi Zhou +4 more
openalex +1 more source
Artificial dragonfly algorithm in the Hopfield neural network for optimal Exact Boolean k satisfiability representation. [PDF]
PLoS One, 2023 Ali GA +5 more
europepmc +1 more source
Backbone Guided Local Search for the Weighted Maximum Satisfiability Problem
, 2009 He Jiang, Jifeng Xu
openalex +2 more sources