scientific article; zbMATH DE number 6118223

MaRDI QIDQ3145805zbMATH OpenFDO

Authors J. Gu, Paul Walton jun. Purdom, John V. Franco, Benjamin Wah

Publication date 23 December 2012

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)

Cited in

(8)

• Approximating minimal unsatisfiable subformulae by means of adaptive core search
• An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
• The complexity of Boolean constraint satisfaction local search problems
• A complete adaptive algorithm for propositional satisfiability
• Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae
• Practical Implementation of a Quantum Backtracking Algorithm
• On complete one-way functions
• New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability

This page was built for publication:

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