求解网络最大流问题的一个算法

为了便于建立与网络最大流问题有关的决策支持系统，本给出一个求解网络最大流问题的数值算法。证明了算法的理论依据，并举例说明了算法的应用。该算法能求出网络最大流和最小截，并具有易于编程实现、收敛性好等优点，大量数值实验表明该算法非常实用有效。     

求解最大利润流问题的一个算法

为了便于建立与最大利润流问题有关的决策支持系统，本给出了一个交易网络中求最大利润流的数值算法，证明了算法的理论依据，并举例了说明算法的应用。该算法能求得问题的最优解，并具有易于编程实现、收敛性好等优点，大量数值实验表明该算法非常实用有效。     

关于几类图的L(3,2,1)-标号问题

图G的L(2，1)-标号是一个从顶点集V(G)到非负整数集的函数f(x)，使得若d(z，y)=1则|f(x)-f(y)|≥2；若d(x，y)=2，则|f(x)-f(y)|≥1。图G的L(2，1)-标号数是λ(G)使得G有的max|f(v)：v∈V(G)|=κ的L(2，1)-标号中的最小数κ。本将L(2，1)-标号问题推广到更一般的情形即L(3，2，1)标号问题，并得到了平面三角剖分图、立体四面体剖分图的λ3(G)的上界。     

一类组合投资问题的线性规划解法

根据选定总体风险的一个上界值使组合投资的收益率达到最大的原则，并在合理简化的基础上建立组合投资决策问题的线性规划模型。然后通过算例求解带有参数的线性规划问题，给出资产组合的风险控制值和相应的最大净收益率及投资比例向量的关系。     

求解指派问题的一个算法

为了便于建立与指派问题有关的决策支持系统，本给出了一个求解指派问题的数值算法，证明了算法的理论依据。该算法能求得问题的最优解，并具有易于编程实现、收敛性好等优点，大量数值实验表明该算法非常实用有效。     

A SEQUENTIAL APPROACH TO DERIVATION OF STAND TREATMENT AND FOREST-WIDE HARVEST PRESCRIPTION OR SUPPLY

Current methods for optimization of stand treatment and forest-wide harvest scheduling use mathematical programming that presumes perfect information on production, costs, and revenues over long planning periods. These approaches simultaneously optimize harvest for all periods in the planning horizon. In contrast, the method presented here assumes that stand-level planning and harvest scheduling proceed sequentially rather than simultaneously over every period. A backward-recursion dynamic program is used to determine the discounted net value of a wide range of current harvest strategies for each stand class in the forest inventory on the basis of a projected set of optimal treatments for future harvest and regeneration of each stand. The most highly valued strategy is selected if there are no volume constraints. Otherwise, suboptimal harvest alternatives are ranked in order of increasing opportunity cost for increasing or decreasing harvest; constraints met only up to a maximum opportunity cost is also demonstrated.     

Dynamic Aggregation Operators Based on Intuitionistic Fuzzy Tools and Einstein Operations

The idea of combine aggregation and intuitionistic fuzzy information plays essential role in multi criteria decision making (MCDM) process. However, this new branch has attracted researchers that study in different fields recently. In this paper, we study MCDM problems with intuitionistic fuzzy environment. Firstly, we introduce some operations related with Einstein t-norm and t-conorm such as, Einstein sum, product and exponentiation. After that, we define dynamic intuitionistic fuzzy Einstein averaging (DIFWA${}^{?}$) operator and dynamic intuitionistic fuzzy Einstein geometric averaging (DIFWG${}^{?}$) operator. Their notable property is that collect and aggregate values in different period based on Einstein operations in intuitionistic fuzzy set (IFS)s. In addition, we compare the defined operators with the existing intuitionistic fuzzy dynamic operators and get the corresponding relations. We establish two methods using with DIFWA${}^{?}$ and DIFWG${}^{?}$ to solve MCDM problems with intuitionistic fuzzy tools. Finally, an illustrated example is presented to show the applicability of the introduced methods.     

Consumer memory and price fluctuations in commodity markets: An integrodifferential model

A model for the dynamics of price adjustment in a single commodity market is developed. Nonlinearities in both supply and demand functions are considered explicitly, as are delays due to production lags and storage policies, to yield a nonlinear integrodifferential equation. Conditions for the local stability of the equilibrium price are derived in terms of the elasticities of supply and demand, the supply and demand relaxation times, and the equilibrium production-storage delay. The destabilizing effect of consumer memory on the equilibrium price is analyzed, and the ensuing Hopf bifurcations are described.     

基因调控网络推断研究进展

随着高通量技术的发展,越来越多的生物医学组学数据亟需处理与分析,基于运筹优化的生物信息学方法是有效解析高维生物医学数据的重要途径之一。综述了近年来在基因调控网络推断方面的研究进展。针对不同类型的转录组学数据和研究目的,分别建立了相应的基因调控网络推断方法,主要包括先验基因调控网络数据库的建立、基于条件互信息的因果网络推断、基于微分方程的动态基因调控网络推断、转录调控和转录后调控协同作用的网络推断以及基因调控网络活性评价等,并展望了基因调控网络推断的重要研究方向。     

Graphs of NMS Flows on S^3 with Knotted Saddle Orbits and No Heteroclinic Trajectories

We consider NMS systems on S^3 without heteroclinic trajectories connecting two saddles orbits and we build the dual graphs associated with this kind of flows. We prove that flows coming from essential attachments of orientable round 1-handles can be reproduced from the corresponding dual graph.