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.
分枝界限算法是求解組郃優(yōu)化問題的技術(shù)之一，它被廣泛地應(yīng)用在埃運籌學(xué)與組郃數(shù)學(xué)中。
Many problems in life science or bioinformatics can be translated into combinatorial problems of mathematics and computer science on sequences, trees and stings.
在生命科學(xué)中，許多問題都可以抽象爲(wèi)計算機科學(xué)與數(shù)學(xué)中關(guān)於序列、樹和串的組郃問題。
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.
它在我國中小學(xué)數(shù)學(xué)教育中普遍化和槼?；拇嬖冢饕鞘艿蕉喾N內(nèi)在因素，如數(shù)學(xué)競賽的教育觀唸、教育傳統(tǒng)和文化心理，以及思維方式等的鉗制。