Question: Given an integer m times n matrix A and an integer m - vector b , the 0 - 1 integer - programming problem

Given an integer m \times n matrix A and an integer m-vector b, the 0-1 integer-programming problem asks whether there exists an integer n vector x with elements in the set {0,1} such that A x <= b. Prove that 0-1 integer programming is NP-complete. (Hint: Reduce from 3CNF-SAT.)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!