ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM

DOI10.17223/20710410/38/9OpenAlexW2915739729MaRDI QIDQ5151087

A. V. Adel'shin, A. K. Kuchin

Publication date: 16 February 2021

Published in: Prikladnaya diskretnaya matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm597

zbMATH Keywords

integer programming\(L\)-partitionlogical constraintspartial maximum satisfiability problem

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Uses Software

• ManySAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach
• On approximation algorithms for the minimum satisfiability problem
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• Investigation of maximum and minimum satisfiability problems using \(L\)-partition
• ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH