Merging Variables: One Technique of Search in Pseudo-Boolean Optimization

DOI10.1007/978-3-030-33394-2_8zbMath1429.90100arXiv1908.00751OpenAlexW2987832173MaRDI QIDQ5214427

Aleksandr Anatol'evich Semënov

Publication date: 7 February 2020

Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.00751

zbMATH Keywords

local searchvariable neighborhood searchpseudo-Boolean optimizationBoolean satisfiability problem\((1+1)\)-evolutionary algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem ⋮ On some variants of the merging variables based \((1+1)\)-evolutionary algorithm with application to MaxSAT problem

Uses Software

• Plingeling
• Tabu search
• Treengeling
• Transalg
• Lingeling
• YalSAT
• CaDiCaL

Cites Work

• 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
• Variable neighborhood search: basics and variants
• Analyzing randomized search heuristics via stochastic domination
• Variable neighborhood search: Principles and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Merging Variables: One Technique of Search in Pseudo-Boolean Optimization