Sekiguchi, Yasuki A unifying framework of combinatorial optimization algorithms. Tree programming and its validity. (English) Zbl 0454.90051 J. Oper. Res. Soc. Japan 24, 67-94 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page MSC: 90C10 Integer programming Keywords:combinatorial optimization; tree programming; branch-and-bound algorithms; dynamic programming; backtrack programming; additive implicit enumeration; cutting plane methods; selection rule; branching rule; upper bounding function; elimination rule; terminating condition PDFBibTeX XMLCite \textit{Y. Sekiguchi}, J. Oper. Res. Soc. Japan 24, 67--94 (1981; Zbl 0454.90051) Full Text: DOI