Investigation of maximum and minimum satisfiability problems using L-partition

DOI10.1023/B:AURC.0000019369.16127.34MaRDI QIDQ2487731zbMATH OpenFDO

Authors A. V. Adel'shin

Publication date 8 August 2005

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/B:AURC.0000019369.16127.34

zbMATH Keywords

integer linear programming

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10)

Recommendations

• Analysis and solving SAT and MAX-SAT problems using an L-partition approach
• On Solving the Partial MAX-SAT Problem
• An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
• ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM
• Partition-based lower bound for Max-CSP
• A taxonomy of exact methods for partial Max-SAT
• On the Approximation of Maximum Satisfiability
• A polynomial-time algorithm for max-min partitioning of ladders

Cited in

(5)

• Analysis and solving SAT and MAX-SAT problems using an L-partition approach
• scientific article; zbMATH DE number 1420878 (Why is no real title available?)
• ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH
• ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM
• An analysis of the LPT algorithm for the max-min and the min-ratio partition problems

This page was built for publication: Investigation of maximum and minimum satisfiability problems using \(L\)-partition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487731)