Generalized resolution search

DOI10.1016/j.disopt.2010.08.004zbMath1241.90084OpenAlexW2041745502MaRDI QIDQ429682

Marius Posta, Jacques A. Ferland, Philippe Yves Paul Michelon

Publication date: 20 June 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2010.08.004

zbMATH Keywords

exact search methodsresolution search

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Boolean programming (90C09)

Related Items (1)

\textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees

Cites Work

• Resolution search
• Integer-programming software systems
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• Resolution search and dynamic branch-and-bound
• Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)

This page was built for publication: Generalized resolution search