3-正则图的分割问题是NP-完全问题

证明了3-正则图的最小平分问题和最小α-分割问题都是NP-完全问题.     

一个超线性收敛的既约梯度法

我们考虑下述非线性规划问题:其中A是m×n矩阵(m相似文献   

Rate of Convergence of an Improved Reduced Gradient Method

An improved reduced gradient method was proposed in [4] to solve the nonlinear programming (p) with linear constraints: (p) f(x) R={x∈E~n|AX=b,x≥0} b∈E~m. In this paper we introduce parameters ρ_k which is the skill used in [5] to the algorithm of [4] to obtain a reduced gradient method which is linearly convergent under the conditions of R being non-degenerate, f being second-order continuously differentiable and strong convex.     

关于一个改进的既约梯度法的收敛速度

An improved reduced gradient method was proposed in [4] to solve the nonlinear programming (P) with linear constraints.     

UNIFICATION AND EXTENSIONS OF SOME STABILITY THEOREMS IN MATHEMATICAL PROGRAMMING

In this paper, we provide the stability theorem for the program: inf{f(x,t)|x∈H(t)}, using the"uniformly N-type" functions (also called ε-chainable functions). This theorem generalizes theresults of Dantzig, Hogan, Greenberg, Ying Mei-qian et al.     

关于整数分拆的Alavi猜想的证明

Ｙ．Ａｌａｖｉ，Ｐ．Ｅｒｄｓ等人在［１］中提出猜想：设自然数α＿１，α＿２…α＿ｋ满足且，则可以划分成ｋ个互不相交子集Ｓ＿１，Ｓ＿２，···，Ｓ＿ｋ，满足．本文证明了这个猜想。     

The Star-chromatic Numbers of Graph Products

Ｗｅｏｎｌｙｃｏｎｓｉｄｅｒｆｉｎｉｔｅｓｉｍｐｌｅｇｒａｐｈｓｉｎｔｈｉｓｐａｐｅｒ．Ｌｅｔｋ，ｄｂｅｎａｔｕｒａｌｎｕｍｂｅｒｓｓｕｃｈｔｈａｔｋ２ｄ，ａ（ｋ，ｄ）ｃｏｌｏｒｉｎｇｏｆａｇｒａｐｈＧ＝（Ｖ，Ｅ）ｉｓａｍａｐｐｉｎｇｃ：ＶＺｋ...     

四正则图的分离问题是NP-完备的

本 文证明了 四正则图 的最小平 分问题是 Ｎ Ｐ完备的 ,因而可得 到四正 则图的最 小 α分离问 题也是 Ｎ Ｐ完备 的