This paper analyzes the theory and the method in solving the network problem by the mathematics model of linear programming and graph theory. 分析了用线性规划、图论的方法解决网络问题的理论和算法。
Based on duality theory of linear programming and graph theory, it is proved that the matching game defined on a bipartite graph has the stable core if and only if the graph has a perfect matching. 基于线性规划对偶理论和图论的相关知识,我们首先证明了匹配对策有稳定核心当且仅当其基础二部图有完美匹配。
From the analysis of a practical example, the article derives that the poly-solution structure of the maths model of the general linear goal programming is an undirected graph. 从一实例分析出发,推导出一般线性目标规划数学模型的多重解结构为一无向图。
The problem of optimum channel scheduling is mapped to a problem of colouring graph, which is formulated as an integer linear programming problem solvable in polynomial time by making use of interval graph good characteristics. 将这个问题描述为整数线性规划形式,利用间隔图的优良特性可在多项式时间内求解。给出可适用于任意波长个数的信道优化调度问题的通用的等效图论描述形式。