scientific article

zbMath0990.90564MaRDI QIDQ2741521

Renato Bruni, Antonio Sassano

Publication date: 24 September 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

heuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Extracting unsatisfiable cores for LTL via temporal resolution ⋮ Towards a notion of unsatisfiable and unrealizable cores for LTL ⋮ New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability ⋮ Algorithms for computing minimal unsatisfiable subsets of constraints ⋮ A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas

Uses Software

• Leibniz

Cites Work

• Solving satisfiability in less than \(2^ n\) steps
• Branching rules for satisfiability
• Locating Minimal Infeasible Constraint Sets in Linear Programs
• A machine program for theorem-proving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item