COST FUNCTION
A constraint programming Extension
Home
Biblio
Main Menu
Home
News
Teaching
Solver Demo
Benchmarks
Biblio
meeting
Search
About
last articles
resultats comparatif
resultats DFBBVE
Réunion projet octobre 2011
Lectures
Exercices
Project
Ficolofo
Benchmark
login
Username
Password
Remember Me
Forgot your password?
Forgot your username?
online
We have 128 guests online
A Branch-And-Cut Algorithm for MAX-SAT and weighted MAX-SAT
Research Area:
MaxSAT
Year:
1997
Type of Publication:
In Collection
Authors:
Borchers, B.
Mitchell, J. E.
Joy, S.
Publisher:
AMS
Editor:
D. Du and J. Gu and P.M. Pardalos
Pages:
519-536
BibTex:
@incollection{Borchers97, author = "B. Borchers and J.E. Mitchell and S. Joy", booktitle = "Satisfiability Problem: Theory and Applications", editor = "D. Du and J. Gu and P.M. Pardalos", pages = "519-536", publisher = "AMS", series = "DIMACS Series in Discrete Mathematics and Theoretical Computer Science", title = "{A} {B}ranch-{A}nd-{C}ut {A}lgorithm for {MAX}-{SAT} and weighted {MAX}-{SAT}", volume = "35", year = "1997", }
[Bibtex]
[RIS]
[MODS]
[ Back ]