Resolution search

DOI10.1016/S0166-218X(96)00003-0zbMath0869.90055OpenAlexW4210351379MaRDI QIDQ674925

Juan-Miguel Gracia

Publication date: 6 March 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

branch-and-boundsatisfiabilityimplicit enumerationresolution searchmixed zero-one linear programming problems

Mathematics Subject Classification ID

Mixed integer programming (90C11) Boolean programming (90C09)

Related Items (7)

Generalized resolution search ⋮ Backdoor Branching ⋮ Consistent neighborhood search for combinatorial optimization ⋮ A multi-level search strategy for the 0-1 multidimensional knapsack problem ⋮ Information-based branching schemes for binary linear mixed integer problems ⋮ \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees ⋮ CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem

Cites Work

• Unnamed Item
• On renamable Horn and generalized Horn functions
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Renaming a Set of Clauses as a Horn Set
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: Resolution search