Integrating multi-armed bandit with local search for MaxSAT
From MaRDI portal
Publication:6665727
DOI10.1016/J.ARTINT.2024.104242MaRDI QIDQ6665727
Jianrong Zhou, Jiongzhi Zheng, Yan Jin, Kun He, Felip Manya, Chu-Min Li
Publication date: 17 January 2025
Published in: Artificial Intelligence (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New local search methods for partial MaxSAT
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- Resolution-based lower bounds in MaxSAT
- Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
- maxSAT-based large neighborhood search for high school timetabling
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Randomized allocation with nonparametric estimation for contextual multi-armed bandits with delayed rewards
- Understanding the power of Max-SAT resolution through up-resilience
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Core-boosted linear search for incomplete MaxSAT
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT
- Better Decision Heuristics in CDCL through Local Search and Target Phases
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Bandit Algorithms
- Introduction to Multi-Armed Bandits
- On Solving the Partial MAX-SAT Problem
This page was built for publication: Integrating multi-armed bandit with local search for MaxSAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665727)
