A UNIFYING FRAMEWORK OF COMBINATORIAL OPTIMIZATION ALGORITHMS : TREE PROGRAMMING AND ITS VALIDITY

DOI10.15807/JORSJ.24.67zbMATH Open0454.90051OpenAlexW2725042267MaRDI QIDQ3902825FDOQ3902825

Authors: Yasuki Sekiguchi 

Publication date: 1981

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.24.67

zbMATH Keywords

combinatorial optimizationdynamic programmingbranching ruleelimination ruleselection rulecutting plane methodsbranch-and-bound algorithmsterminating conditionadditive implicit enumerationbacktrack programmingtree programmingupper bounding function

Mathematics Subject Classification ID

Integer programming (90C10)

This page was built for publication: A UNIFYING FRAMEWORK OF COMBINATORIAL OPTIMIZATION ALGORITHMS : TREE PROGRAMMING AND ITS VALIDITY

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