Linear Programming Formulation of the Boolean Satisfiability Problem

Details Linear Programming Formulation of the Boolean Satisfiability Problem Linear Programming Formulation of the Boolean Satisfiability Problem

2008-08-25

arxiv.org/abs/0808.3386v4

Computer Science

Discrete Mathematics

30 pages; 4 figures; Minor terminology clarification (Definition 4)

Scientific paper

Theorem 38 and Corollary 39 are in error. The modeling needs 9-dimensional z-variables instead of the 8-dimensional variables defined in notations 24.1. Examples of the correct model (with 9-index variables) are: (1) Diaby, M., "Linear Programming Formulation of the Set Partitioning Problem," International Journal of Operational Research 8:4 (August 2010) pp. 399-427; (2) Diaby, M., "Linear Programming Formulation of the Vertex Coloring Problem," International Journal of Mathematics in Operational Research 2:3 (May 2010) pp. 259-289; (3) Diaby, M., "The Traveling Salesman Problem: A Linear Programming Formulation," WSEAS Transactions on Mathematics, 6:6 (June 2007) pp. 745-754.

Affiliated with

Also associated with

No associations

Rating

Linear Programming Formulation of the Boolean Satisfiability Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear Programming Formulation of the Boolean Satisfiability Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Programming Formulation of the Boolean Satisfiability Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-380775