共查询到20条相似文献,搜索用时 912 毫秒
1.
2.
3.
4.
《数理统计与管理》2005,24(6):F0004-F0004
“数理统计与管理”是中文核心期刊。目前,给本刊投稿请用通常的书面形式邮寄编辑部“100871北京大学概率统计系内”。稿件最好是一式两份,目前本刊仍以书面形式投稿为主。给本刊投稿请自留底稿,恕本刊概不退稿。本刊收到来稿后将给作者一个该稿件编号的通知,进入审稿程序。之后6个月内收不到进一步的信息,即为未通过,作者可另行处理。部分审稿情况可登陆网站:http∥sltj.chinajournal.net.cn查阅‘稿约信息之录用公告栏之公示’。本刊实行的是三审制,审稿周期为一年左右,稿件登出约需时一年半。本刊采用的稿件已以全文形式加入“同方”“万… 相似文献
5.
6.
7.
8.
应本刊编辑部之约,姚芳老师拟出了20个题目,作为本刊《数学史话》栏目的投稿指南,供广大师生选题时参考. 我们希望“数学史话”栏目的稿件: (1)有“史”有“话”,即通过某段史料,说明某个观点. (2)篇幅短小,文字活泼. (3)文末请注明文中史料的出处,即参考资料,以便编委审核及读者进一步查阅. 相似文献
9.
10.
《数理统计与管理》2007,26(3):F0003-F0003
目前,给本刊投稿请用通常的书面形式邮寄编辑部,“100871北京大学概率统计系内”。稿件要一式两份,目前本刊仍以书面形式投稿为主。给本刊投稿请自留底稿,恕本刊概不退稿。本刊收到来稿后将给作者一个该稿件编号的书面通知,进入审稿程序。之后6个月内收不到进一步的信息,即为未通过,作者可另行处理。部分审稿情况可登陆网站:http//slfj.chi-najournal.net.cn查阅‘稿约信息之录用公告栏之公示’。本刊实行的是三审制,双匿名专家审查。审稿周期为一年左右。被录用稿件全寄书面的“稿件录用通知书”,作者凭此办理相关交费手续。… 相似文献
11.
13.
《Mathematical and Computer Modelling》1997,25(1):93-105
A procedure of the dynamic programming (DP) for the discrete-continuous problem of a route optimization is considered. It is possible to consider this procedure as a dynamic method of optimization of the towns choice in the well-known traveling salesman problem. In the considered version of DP, elements of a dynamic optimization are used. Two variants of the function of the aggregations of losses are investigated:
- 1.(1) the additive functions;
- 2.(2) the function characterizing the aggregation of losses in the bottle-neck problem.
14.
15.
16.
17.
18.
19.
20.
The usual assumption made in time minimising transportation problem is that the time for transporting a positive amount in a route is independent of the actual amount transported in that route. In this paper we make a more general and natural assumption that the time depends on the actual amount transported. We assume that the time function for each route is an increasing piecewise constant function. Four algorithms - (1) a threshold algorithm, (2) an upper bounding technique, (3) a primal dual approach, and (4) a branch and bound algorithm - are presented to solve the given problem. A method is also given to compute the minimum bottle-neck shipment corresponding to the optimal time. A numerical example is solved illustrating the algorithms presented in this paper. 相似文献