全文获取类型
收费全文 | 654篇 |
免费 | 12篇 |
出版年
2021年 | 12篇 |
2019年 | 22篇 |
2018年 | 12篇 |
2017年 | 14篇 |
2016年 | 14篇 |
2015年 | 12篇 |
2014年 | 11篇 |
2013年 | 130篇 |
2009年 | 7篇 |
2008年 | 9篇 |
2007年 | 7篇 |
2005年 | 9篇 |
2004年 | 11篇 |
2003年 | 8篇 |
2002年 | 12篇 |
2001年 | 6篇 |
2000年 | 9篇 |
1999年 | 7篇 |
1998年 | 11篇 |
1997年 | 19篇 |
1996年 | 10篇 |
1995年 | 8篇 |
1994年 | 15篇 |
1993年 | 6篇 |
1992年 | 9篇 |
1991年 | 17篇 |
1990年 | 9篇 |
1989年 | 9篇 |
1988年 | 10篇 |
1987年 | 21篇 |
1986年 | 12篇 |
1985年 | 11篇 |
1984年 | 7篇 |
1983年 | 11篇 |
1982年 | 12篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 8篇 |
1977年 | 9篇 |
1976年 | 8篇 |
1975年 | 9篇 |
1974年 | 10篇 |
1973年 | 14篇 |
1972年 | 8篇 |
1971年 | 7篇 |
1970年 | 8篇 |
1969年 | 9篇 |
1968年 | 6篇 |
1967年 | 7篇 |
排序方式: 共有666条查询结果,搜索用时 31 毫秒
611.
612.
613.
614.
615.
James A. M. McHugh 《海军后勤学研究》1984,31(3):409-411
This article presents a simple proof of Hu's algorithm for scheduling in minimum time a set of tasks constrained by precedence tree constraints, each task requiring a unit time to complete, and where m processors are available. 相似文献
616.
617.
This paper describes an approximate solution procedure for quadratic programming problems using parametric linear programming. Limited computational experience suggests that the approximation can be expected to be “good”. 相似文献
618.
Work by the present authors on life distributions derived from stochastic hazard functions [4] is related to certain articles that have appeared in this journal. This relationship is illustrated. The emphasis of this article is upon problems of parameter estimation. 相似文献
619.
A branch and bound algorithm is developed for a class of allocation problems in which some constraint coefficients depend on the values of certain of the decision variables. Were it not for these dependencies, the problems could be solved by linear programming. The algorithm is developed in terms of a strategic deployment problem in which it is desired to find a least-cost transportation fleet, subject to constraints on men/materiel requirements in the event of certain hypothesized contingencies. Among the transportation vehicles available for selection are aircraft which exhibit the characteristic that the amount of goods deliverable by an aircraft on a particular route in a given time period (called aircraft productivity and measured in kilotons/aircraft/month) depends on the ratio of type 1 to type 2 aircraft used on that particular route. A model is formulated in which these relationships are first approximated by piecewise linear functions. A branch and bound algorithm for solving the resultant nonlinear problem is then presented; the algorithm solves a sequence of linear programming problems. The algorithm is illustrated by a sample problem and comments concerning its practicality are made. 相似文献
620.
A modification to the Dantzig and Fulkerson Tanker Scheduling Problem is described. An insufficient number of vehicles and a utility associated with each vehicle delivery are assumed. The new problem is shown to be equivalent to a Transshipment Problem, the solution of which is the same as the maximal utility solution of the modified Tanker Scheduling Problem. An example is given. 相似文献