Probability modeling of branch-and-bound method

DOI10.1007/BF01078264zbMath0485.90087OpenAlexW2041921228MaRDI QIDQ3945970

Yu. P. Laptin

Publication date: 1980

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01078264

zbMATH Keywords

branch-and-bound algorithmsbranching strategiesprobability modelling

Mathematics Subject Classification ID

Integer programming (90C10) Mathematical programming (90C99)

Cites Work

• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Theoretical comparisons of search strategies in branch-and-bound algorithms
• Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems

This page was built for publication: Probability modeling of branch-and-bound method