ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH

DOI10.17223/20710410/30/10OpenAlexW4256698469MaRDI QIDQ5150716

A. V. Adel'shin, Alexander A. Kolokolov

Publication date: 15 February 2021

Published in: PRIKLADNAYa DISKRETNAYa MATEMATIKA (Search for Journal in Brave)

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

zbMATH Keywords

integer programmingsatisfiability problem\(L\)-partitionlogical constraints

Mathematics Subject Classification ID

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

Related Items

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

Uses Software

• ManySAT

Cites Work

• Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach
• 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
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item