全文获取类型
收费全文 | 375篇 |
免费 | 5篇 |
出版年
2021年 | 4篇 |
2019年 | 11篇 |
2018年 | 9篇 |
2017年 | 7篇 |
2016年 | 6篇 |
2015年 | 4篇 |
2014年 | 6篇 |
2013年 | 69篇 |
2012年 | 5篇 |
2010年 | 4篇 |
2009年 | 5篇 |
2008年 | 6篇 |
2007年 | 3篇 |
2006年 | 4篇 |
2005年 | 3篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1998年 | 6篇 |
1997年 | 4篇 |
1996年 | 12篇 |
1995年 | 6篇 |
1993年 | 4篇 |
1992年 | 6篇 |
1991年 | 10篇 |
1990年 | 5篇 |
1989年 | 9篇 |
1988年 | 10篇 |
1987年 | 8篇 |
1986年 | 8篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 11篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 5篇 |
1975年 | 6篇 |
1974年 | 5篇 |
1972年 | 4篇 |
1971年 | 9篇 |
1970年 | 4篇 |
1969年 | 4篇 |
1968年 | 6篇 |
1967年 | 4篇 |
1966年 | 6篇 |
排序方式: 共有380条查询结果,搜索用时 15 毫秒
351.
Ronald D. Armstrong 《海军后勤学研究》1977,24(4):619-625
This paper considers the problem of locating m new facilities in the plane so as to minimize a weighted rectangular distance between the new facilities and n existing facilities. A special purpose primal simplex algorithm is developed to solve this problem. The algorithm will maintain at all times a basis of dimension m by m; however, because of the triangularity of the basis matrix, it will not be necessary to form a basis inverse explicitly. 相似文献
352.
Jatinder N. D. Gupta 《海军后勤学研究》1976,23(2):235-243
In this paper the problem of finding an optimal schedule for the n-job, M-machine flowshop scheduling problem is considered when there is no intermediate space to hold partially completed jobs and the objective function is to minimize the weighted sum of idle times on all machines. By assuming that jobs are processed as early as possible, the problem is modeled as a traveling salesman problem and solved by known solution techniques for the traveling salesman problem. A sample problem is solved and a special case, one involving only two machines, is discussed. 相似文献
353.
Recent efforts in the field of dynamic programming have explored the feasibility of solving certain classes of integer programming problems by recursive algorithms. Special recursive algorithms have been shown to be particularly effective for problems possessing a 0–1 attribute matrix displaying the “nesting property” studied by, Ignall and Veinott in inventory theory and by Glover in network flows. This paper extends the class of problem structures that has been shown amenable to recursive exploitation by providing an efficient dynamic programming approach for a general transportation scheduling problem. In particular, we provide alternative formulations lor the scheduling problem and show how the most general of these formulations can be readily solved vis a vis recursive techniques. 相似文献
354.
355.
356.
An inventory of physical goods or storage space (in a communications system buffer, for instance) often experiences “all or nothing” demand: if a demand of random size D can be immediately and entirely filled from stock it is satisfied, but otherwise it vanishes. Probabilistic properties of the resulting inventory level are discussed analytically, both for the single buffer and for multiple buffer problems. Numerical results are presented. 相似文献
357.
In this article we present some advanced basis or block-pivoting, relaxation, and feasible direction methods for solving linear programming problems. Preliminary computational results appear to indicate that the former two types of simplex-based procedures may hold promise for solving linear programming problems, unlike the third type of scheme which is shown to be computationally unattractive. 相似文献
358.
359.
360.