A framework for certified Boolean branch-and-bound optimization (Q2429985): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient Generation of Unsatisfiability Proofs and Cores in SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio link frequency assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2749862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical approach to efficient Max-SAT solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability-based algorithms for Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rocket-Fast Proof Checking for SMT Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On SAT Modulo Theories and Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability / rank
 
Normal rank

Latest revision as of 23:16, 3 July 2024

scientific article
Language Label Description Also known as
English
A framework for certified Boolean branch-and-bound optimization
scientific article

    Statements

    A framework for certified Boolean branch-and-bound optimization (English)
    0 references
    0 references
    0 references
    0 references
    5 April 2011
    0 references
    0 references
    SAT
    0 references
    optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references