精细Besov空间

本文将Ｂｅｓｏｖ空间Ｂ＿Ｐ～Ｓ，ｑ推广为精细Ｂｅｓｏｖ空间ＲＢ＿Ｐ～ａ，ｑ，其中ｓ∈Ｒ，而ａ∈Ｒ～（ｋ＋１），ｋ为非负整数．给出了精细Ｂｅｓｏｖ空间的等价拟范数和嵌入定理．同时证明了在Ｂ＿Ｐ～Ｓ，ｑ和 ＵＢ＿ｐ～ｔ，ｑ之间还存在无穷多个精细Ｂｅｓｏｖ空间作为真子空间．     

关于Szász-Mirakjan—Durrmeyer算子在Besov空间上的逼近阶

本文主要给出了Ｓｚａｓｚ－Ｍｉｒａｋｊａｎ－Ｄｕｒｒｍｅｙｅｒ算子在Ｂｅｓｏｖ空间上逼近阶的特征刻划     

多元Bernstein—Sikkema算子的逼近性质

本文对定义在单形上的Ｂｅｒｎｓｔｅｉｎ－Ｓｉｋｋｅｍａ算子讨论其导数的收敛性质，同时出给出了高阶渐近展开式及Ｂｅｓｏｖ空间中的几个等价关系。     

代数多项式和指数型整函数在Besov空间中的逼近

用Ｋ－泛函定义了一类Ｂｅｓｏｖ空间,并分别用ｎ阶代数多项式及指数为σ的整函数的最佳逼近阶给出了其特征的刻画。     

Banach函数空间上的Bessel(Riesz)位势及其应用(I)理论

本文首先引入Ｂｅｓｅｌ（Ｒｉｅｓｚ）位势Ｋ¨ｏｔｈｅ函数空间Ｘｓ（Ｘｓ）的概念，然后讨论一类算子在Ｌｅｂｅｓｇｕｅ－位势Ｋ¨ｏｔｈｅ函数空间Ｌｑ（－Ｔ，Ｔ；Ｘｓ）上的对偶估计．由此我们得到半群ｅｘｐ（ｉｔ（－Δ）ｍ／２）和算子Ａ：＝∫ｔ０ｅｘｐ（ｉ（ｔ－τ）（－Δ）ｍ／２）·ｄτ在Ｌｅｂｅｓｇｕｅ－Ｂｅｓｏｖ空间Ｌｑ－Ｔ，Ｔ；·Ｂｓｐ，２中的一些时间－－空间Ｌｐ－Ｌｐ′估计．本文的系列文将给出这些估计的应用     

Average Widths and Optimal Recovery of Multivariate Besov Class B_(pθ)~r(R~d)in L_(qp)(R~d)

ＡｖｅｒａｇｅＷｉｄｔｈｓａｎｄＯｐｔｉｍａｌＲｅｃｏｖｅｒｙｏｆＭｕｌｔｉｖａｒｉａｔｅＢｅｓｏｖＣｌａｓＢｒｐθ（Ｒｄ）ｉｎＬｑｐ（Ｒｄ）＊）ＪｉａｎｇＹａｎｊｉｅ（蒋艳杰）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＢｅｉｊｉｎｇＮｏｒｍ...     

Besov空间上的H?rmander乘子定理

本文在紧Ｌｉｅ群上建立了一个Ｂｅｓｏｖ空间上的Ｈ?ｒｍａｎｄｅｒ乘子定理．     

Lipschitz曲线上Besov空间的特征刻划

本文给出了Ｌｉｐｓｃｈｉｔｚ曲线Γ上Ｂｅｓｏｖ空间Ｂα，ｑｐ（Γ）的一个特征刻划，其中α＞０，１ｐ，ｑ＜∞．     

C~n中单位球上Mbius不变Besov空间中函数的增长性(英文)

本文主要讨论Ｃ~ｎ中单位球上 Ｍｂｉｕｓ不变 Ｂｅｓｏｖ空间中函数的增长性并给出其Ｔａｙｌｏｒ系数的估计．     

C^n中单位球上Mobius不变Besov空间中函数的增长性

本文主要讨论Ｃ＾ｎ中单位球上Ｍｏｂｉｕｓ不变Ｂｅｓｏｖ空间中函数的增长性并给出其Ｔａｙｌｏｒ系数的估计．     

图论中若干著名问题的历史注记

考察了哥尼斯堡七桥问题,最小生成树问题,旅行推销员问题,分派问题,最大流问题,中国邮递员问题和四色问题等著名图论问题的历史背景.     

三种新变形的全一问题

该文研究三种新变形的全一问题及最小全一问题. 原始的全一问题可被形象的称为顶点点亮顶点问题, 而这三类新问题则分别被称为顶点点亮边问题,边点亮顶点问题,边点亮边问题. 顶点点亮顶点问题已经得到了广泛的研究. 比如,解的存在性问题和求解的有效算法已经被解决,一般图上的最小顶点点亮顶点问题已经被证明是NP- 完备的,树、单圈图和双圈图上的最小顶点点亮顶点问题的线性时间最优算法也已被给出等. 该文对于顶点点亮边问题,证明一个图有解当且仅当它是二部图,因此只可能有两组解和最优解. 对于边点亮顶点问题,证明一个图有解当且仅当它包含偶数个顶点,并通过将其最优问题多项式变换成最小权的完美匹配问题,得出一般图上的最小边点亮顶点问题可在多项式时间内求解. 边点亮边问题可归约成线图上的顶点点亮顶点问题.     

Production planning with discounting and stochastic demands

A general continuous review production planning problem with stochastic demand is considered. Conditions under which the stochastic problem may be correctly solved using an equivalent deterministic problem are developed. This deterministic problem is known to have the same solution as the stochastic problem. Moreover, conditions are established under which the deterministic equivalent problem differs from a commonly used deterministic approximation to the problem only in the interest rate used in discounting. Thus, solving the stochastic problem is no more difficult than solving a commonly used approximation of the problem.     

The Vehicle Routing-Allocation Problem: A unifying framework

Summary In this paper the Vehicle Routing-Allocation Problem (VRAP) is presented. In VRAP not all customers need be visited by the vehicles. However customers not visited either have to be allocated to some customer on one of the vehicle tours or left isolated. We concentrate our discussion on the Single Vehicle Routing-Allocation Problem (SVRAP). An integer linear programming formulation of SVRAP is presented and we show how SVRAP provides a unifying framework for understanding a number of the papers and problems presented in the literature. Specifically the covering tour problem, the covering salesman problem, the median tour problem, the maximal covering tour problem, the travelling salesman problem, the generalised travelling salesman problem, the selective travelling salesman problem, the prize collecting travelling salesman problem, the maximum covering/shortest path problem, the maximum population/shortest path problem, the shortest covering path problem, the median shortest path problem, the minimum covering/shortest path problem and the hierarchical network design problem are special cases/variants of SVRAP.     

一种新的向量互补问题

本文在实局部凸空间中引入了一种新的向量互补问题,这一向量互补问题不仅包含了由Ｙｕ和Ｙａｏ提出的广义向量互补问题由Ｃｈｅｎ和Ｙａｎｇ定义的弱向量互补问题,而且还包含了Ｉｓａｃ意义下的隐互补问题。本文还讨论了新的向量互补问题,向量变分不等式,向量单向极小化问题和最小元问题之间的关系,给出了这一向量互补问题解的存在定理。     

Pendants-median支撑树及其一个相关问题:复杂性和算法

The complexity status of Pendants-median spanning tree problem is an open problem. Using the complexity of the X3C problem, the paper proves that Pendants-median spanning tree problem is NP-complete. Global-median spanning tree problem is a related problem. Using the complexity of 3SAT, the paper proves that this problem is also NP-complete, and a polynomial -time algorithm to this problem is given, whose time complexity is O(n^3).     

一些约束规划问题的近似全局最优解

首先将一个具有多个约束的规划问题转化为一个只有一个约束的规划问题,然后通过利用这个单约束的规划问题,对原来的多约束规划问题提出了一些凸化、凹化的方法,这样这些多约束的规划问题可以被转化为一些凹规划、反凸规划问题．最后,还证明了得到的凹规划和反凸规划的全局最优解就是原问题的近似全局最优解．     

Algebra complexity problems involving graph homomorphism,semigroups and the constraint satisfaction problem

In this paper, we connect the constraint satisfaction problem with other complexity problems, like the polynomial equivalence problem for combinatorial 0-simple semigroups, the graph retraction problem and the geometry problem. We show that every constraint satisfaction problem is polynomially equivalent to an easily formulated algebra complexity problem. As an application we prove that the polynomial equivalence problem (word problem) for the 2×2 matrices over the two element field is co-NP-complete.     

限制情况下装卸工问题的最优解

装卸工问题是从现代物流技术中提出的一个实际问题,这个问题的雏形早在上个世纪60年代中国科学院数学研究所就提出和研究过.现代物流技术迅速发展,促成和推动装卸工问题的提出和研究.装卸工问题是一个新的NP困难的组合优化问题,首先介绍装卸工问题及限制情况下装卸工问题的数学模型,然后分析限制情况下的装卸工问题的性质,最后给出该问题的所有最优解.     

Unconstrained Methods for Generalized Complementarity Problems

1.IntroductionThecomplementarityproblem,aspecialcaseofvariationalinequalityproblem,hasmanyapplicationsindifferentfieldssuchasmathematicalprogramming,gametheory,economics.Generally,thestandardcomplementarityproblemhasthefollowingform:y=F(x),x20,y20,(y,x)=0,(1.1)where(.,.)denotestheinnerproducts.WhenF(x)isanaffinefunctionofx,itreducestothelinearcomplementarityproblemwhichisdenotedbyLCP.Otherwisewecallitthenonlinearco7nplementaritypro6lemorsimplyNCP.Thecomplementarityproblemhajsattractedmanyr…