Resolution search and dynamic branch-and-bound

DOI10.1023/A:1019573820792zbMath1046.90048MaRDI QIDQ1810862

Fred Glover, Saïd Hanafi

Publication date: 9 June 2003

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

zbMATH Keywords

branch-and-boundmixed integer programmingresolution searchdynamic branch-and-bound

Mathematics Subject Classification ID

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

Related Items

Generalized resolution search ⋮ A multi-level search strategy for the 0-1 multidimensional knapsack problem ⋮ \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees