Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem
From MaRDI portal
Publication:4965126
DOI10.1007/978-3-030-58657-7_29zbMath1460.90155OpenAlexW3085317161MaRDI QIDQ4965126
Ilya Otpuschennikov, Aleksandr Anatol'evich Semënov
Publication date: 25 February 2021
Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-58657-7_29
local searchevolutionary algorithmsSATMaxSATcryptographic hash functionspseudo-Boolean optimizationbranch location problem
Related Items (1)
Uses Software
Cites Work
- SAT-based MaxSAT algorithms
- Decomposition representations of logical equations in problems of inversion of discrete functions
- A survey of very large-scale neighborhood search techniques
- Pseudo-Boolean optimization
- A computational study of local search algorithms for Italian high-school timetabling
- Variable neighborhood search
- On the analysis of the \((1+1)\) evolutionary algorithm
- PySAT: a Python toolkit for prototyping with SAT oracles
- Core-boosted linear search for incomplete MaxSAT
- Iterative and core-guided maxsat solving: a survey and assessment
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- RC2: an Efficient MaxSAT Solver
- Merging Variables: One Technique of Search in Pseudo-Boolean Optimization
- Location Science
- The complexity of theorem-proving procedures
- Computational Complexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem
