combinatorial mathematics

基本解释

Branch and Bound (B&B) is a problem solving technique which is widely used for various problems encountered in operations research and combinatorial mathematics.
分枝界限算法是求解组合优化问题的技术之一，它被广泛地应用在埃运筹学与组合数学中。
Many problems in life science or bioinformatics can be translated into combinatorial problems of mathematics and computer science on sequences, trees and stings.
在生命科学中，许多问题都可以抽象为计算机科学与数学中关于序列、树和串的组合问题。
The purpose of this paper is to investigate some laws and techniques in working on mathematics contest problems by analyzing some cases of combinatorial mathematics which have been generalized.
它在我国中小学数学教育中普遍化和规模化的存在，主要是受到多种内在因素，如数学竞赛的教育观念、教育传统和文化心理，以及思维方式等的钳制。