There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 10

Record: found
Abstract: not found
Book Chapter: not found

An Extensible SAT-solver

Niklas Een, Niklas Sörensson (2004)

0 comments Cited 55 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Article: not found

Planning and Scheduling by Logic-Based Benders Decomposition

J. N. Hooker (2007)

0 comments Cited 25 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Book Chapter: not found

Solving MAXSAT by Solving a Sequence of Simpler SAT Instances

Jessica E. Davies, Fahiem Bacchus (2011)

0 comments Cited 18 times – based on 0 reviews

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2013

Pages: 166-181

DOI: 10.1007/978-3-642-39071-5_13

SO-VID: 56639118-b925-4cf1-aff5-2842758358e1

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 8

LMHS: A SAT-IP Hybrid MaxSAT Solver
Authors: Paul Saikko, Jeremias Berg, Matti Järvisalo
MaxSAT-Based Cutting Planes for Learning Graphical Models
Authors: Paul Saikko, Brandon Malone, Matti Järvisalo
On Incremental Core-Guided MaxSAT Solving
Authors: Xujie Si, Xin Zhang, Vasco Manquinho …

See all cited by

Exploiting the Power of mip Solvers in maxsat

Read this book at

Related collections

IET Power Engineering

Most cited references 10

An Extensible SAT-solver

Planning and Scheduling by Logic-Based Benders Decomposition

Solving MAXSAT by Solving a Sequence of Simpler SAT Instances

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 4,079

Cited by 8