A stochastic assignment problem

There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if X_i = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015     

Transformations of node‐balanced routing problems

This article describes a polynomial transformation for a class of unit‐demand vehicle routing problems, named node‐balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the routes is balanced. The transformation is general in that it can be applied to single or multiple depot, homogeneous or heterogeneous fleet BRPs, and any combination thereof. At the heart of the procedure lies transforming the BRP into a generalized traveling salesman problem (TSP), which can then be transformed into a TSP. The transformed graph exhibits special properties which can be exploited to significantly reduce the number of arcs, and used to construct a formulation for the resulting TSP that amounts to no more than that of a constrained assignment problem. Computational results on a number of instances are presented. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 370–387, 2015     

《兵团教育学院学报》2009-2013年载文计量分析

《兵团教育学院学报》作为主要反映本校教学、科研及兵团中小学教育教学成果为内容的综合性学术理论刊物,在推动学校的学科建设、学术研究、培养人才及促进兵团各级各类教育发展等方面发挥着重大作用。本文对学报2009-2013刊登的学术论文进行了计量分析,厘清学报的发展脉络,同时也发现了学报中存在的一些问题如:特色栏目不突出,高质量稿源匮乏,学报宣传力度不大等并提出相应解决措施。     

二阶非线性常微分方程组边值问题的正解

研究一类二阶常微分方程组两点边值问题,利用Krasnoselskii’s不动点定理,得到当f和g满足超线性或次线性时边值问题一个正解存在的充分条件.     

New results on a stochastic duel game with each force consisting of heterogeneous units

Two forces engage in a duel, with each force initially consisting of several heterogeneous units. Each unit can be assigned to fire at any opposing unit, but the kill rate depends on the assignment. As the duel proceeds, each force—knowing which units are still alive in real time—decides dynamically how to assign its fire, in order to maximize the probability of wiping out the opposing force before getting wiped out. It has been shown in the literature that an optimal pure strategy exists for this two‐person zero‐sum game, but computing the optimal strategy remained cumbersome because of the game's huge payoff matrix. This article gives an iterative algorithm to compute the optimal strategy without having to enumerate the entire payoff matrix, and offers some insights into the special case, where one force has only one unit. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 56–65, 2014     

[AXB,GXH]=[C,D]对称最小二乘解及最佳逼近的极小残差法

构造迭代算法研究了矩阵方程[AXB,GXH] = [C,D] ,证明了该算法可经有限步得到方程的对称最小二乘解及其最佳逼近,并给出了相关性质.最后,通过数值例子表明该算法是有效的.     

转型期再分配中存在的问题及其治理对策

转型期再分配中存在的问题既有认识上的 ,也有操作上的 ,既包括理论研究层面 ,也涵盖政策设计领域。具体问题包括对再分配原因的认识、目标的选择、问题的认定、地位的判断、功能的界定与作用的发挥、主体的确定与手段的运用等。要治理这些问题 ,就必须强化原因认识、规范目标选择、准确认定问题、科学判断地位、合理界定功能、有效发挥作用、完善主体、健全手段     

关于教师继续教育培训模式的思考

继续教育作为终身教育的重要组成部分和基本形式,对教师的发展成长意义重大。继续教育工作开展十多年来,取得了一定的成绩,但还存在不少问题,如学习动机较为被动,管理认识不到位,教学内容陈旧空泛,教学方法呆板机械等。随着课程改革的不断深入,继续教育必须采取相应的改进措施,树立以人为本,服务至上的观点,教学内容的前瞻性与实用性并重,教学人员进行整合,教学方法灵活多样,评价考核规范科学等,以此激活受训教师内在的学习动机,更大程度地提高继续教育培训的实际效果。     

一类带容量限制的运输问题

考虑一类带容量限制的运输问题.采用构造辅助网络的方法,将运输网络中的每个配送中心均拆分成两个节点,构造出新弧,形成新的网络,把此类运输问题转换为最小费用流问题来解决.并在此基础上,考虑运输网络中配送中心的容量扩张问题.     

Reformulating linear programs with transportation constraints—With applications to workforce scheduling

We study linear programming models that contain transportation constraints in their formulation. Typically, these models have a multistage nature and the transportation constraints together with the associated flow variables are used to achieve consistency between consecutive stages. We describe how to reformulate these models by projecting out the flow variables. The reformulation can be more desirable since it has fewer variables and can be solved faster. We apply these ideas to reformulate two well‐known workforce staffing and scheduling problems: the shift scheduling problem and the tour scheduling problem. We also present computational results. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.