A branch and cut algorithm for MAX-SAT and weighted MAX-SAT - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Steve Joy, John E. Mitchell 0001, Brian Borchers. A branch and cut algorithm for MAX-SAT and weighted MAX-SAT. In Ding-Zhu Du, Jun Gu, Panos M. Pardalos, editors, Satisfiability Problem: Theory and Applications, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 11-13, 1996. Volume 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 519-536, DIMACS/AMS, 1996.

This author has not been identified. Look up 'Steve Joy' in GoogleThis author has not been identified. Look up 'John E. Mitchell 0001' in GoogleThis author has not been identified. Look up 'Brian Borchers' in Google

runs on WebDSL