An Incremental Branch-and-Bound Method for the Satisfiability Problem

DOI10.1287/IJOC.10.3.301MaRDI QIDQ4427350zbMATH OpenOpenAlexFDO

Authors Hachemi Bennaceur, Gérard Plateau

Publication date 1998

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.10.3.301

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Solving the incremental satisfiability problem
• The incremental satisfiability problem for a two conjunctive normal form
• SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
• A Computational Study of Satisfiability Algorithms for Propositional Logic
• scientific article; zbMATH DE number 956860

Cited in

(6)

• The incremental satisfiability problem for a two conjunctive normal form
• Mining backbone literals in incremental SAT. A new kind of incremental data
• SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
• Solving the incremental satisfiability problem
• scientific article; zbMATH DE number 956860 (Why is no real title available?)
• New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability

This page was built for publication: An Incremental Branch-and-Bound Method for the Satisfiability Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427350)