Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
18
views
10
references
Top references
cited by
9
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,386
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theory and Applications of Satisfiability Testing – SAT 2013
Exploiting the Power of mip Solvers in maxsat
other
Author(s):
Jessica Davies
,
Fahiem Bacchus
Publication date
(Print):
2013
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
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
IET Power Engineering
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
Sign in to comment
Book chapters
pp. 166
Exploiting the Power of mip Solvers in maxsat
pp. 192
Experiments with Reduction Finding
pp. 276
Factoring Out Assumptions to Speed Up MUS Extraction
pp. 309
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
Similar content
2,386
UWrMaxSAT-a new minisat+-based solver in maxsat evaluation 2019
Authors:
M. Piotrow
A Modular Approach to MaxSAT Modulo Theories
Authors:
Alessandro Cimatti
,
Alberto Griggio
,
Bastiaan Schaafsma
…
Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem
Authors:
Chu-Min Li
,
Zhiwen Fang
,
Ke Xu
See all similar
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