Satisfiability and integer programming as complementary tools
Published in Asia and South Pacific Design Automation Conference • Jan 27, 2004
NobleIDNI7P98W99R31S85
Authors:,,
Ruirning Li
Dian Zhou
Donglei Du
Abstract
Satisfiability (SAT) and integer linear programming (ILP) are two related NP-complete problems. They both have a lot of important applications. We study the effectiveness of using them as a complementary tool to each other. We propose three different ILP formulations to solve SAT and compare them wi...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!