External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

A branch and cut algorithm for MAX-SAT and weighted MAX-SAT

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.

Abstract

Abstract is missing.

runs on