Resolution search and dynamic branch-and-bound

DOI10.1023/A:1019573820792MaRDI QIDQ1810862zbMATH OpenFDO

Authors Saïd Hanafi, Fred Glover

Publication date 9 June 2003

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

mixed integer programmingbranch-and-boundresolution searchdynamic branch-and-bound

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)

Recommendations

• Branch and bound methods for a search problem
• Branch-and-bound methods
• scientific article; zbMATH DE number 3845070
• Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem
• A branch and bound algorithm for solving a class of D-C programming
• scientific article; zbMATH DE number 3908167
• Branch and bound algorithms for the multidimensional assignment problem
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM

Cited in

(6)

• Generalized resolution search
• \textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• Restrict-and-relax search for 0-1 mixed-integer programs
• How To Be Fickle

This page was built for publication: Resolution search and dynamic branch-and-bound

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