Recommendations
Cites work
Cited in
(13)- Gersten resolution with support
- Improving the performance of enumerative search methods. I: Exploiting structure and intelligence
- Incumbent solutions in branch-and-bound algorithms: Setting the record straight
- \textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
- Some new perspectives for solving 0--1 integer programming problems using balas method
- Information-based branching schemes for binary linear mixed integer problems
- CORAL: an exact algorithm for the multidimensional knapsack problem
- Backdoor branching
- How To Be Fickle
- scientific article; zbMATH DE number 3982556 (Why is no real title available?)
- Generalized resolution search
- Consistent neighborhood search for combinatorial optimization
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
This page was built for publication: Resolution search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674925)