全文获取类型
收费全文 | 1042篇 |
免费 | 21篇 |
出版年
2021年 | 14篇 |
2019年 | 27篇 |
2018年 | 17篇 |
2017年 | 17篇 |
2016年 | 17篇 |
2015年 | 14篇 |
2014年 | 11篇 |
2013年 | 175篇 |
2010年 | 11篇 |
2008年 | 10篇 |
2007年 | 18篇 |
2005年 | 14篇 |
2004年 | 16篇 |
2003年 | 14篇 |
2002年 | 10篇 |
2001年 | 10篇 |
2000年 | 13篇 |
1999年 | 9篇 |
1998年 | 16篇 |
1997年 | 19篇 |
1996年 | 26篇 |
1995年 | 10篇 |
1994年 | 16篇 |
1993年 | 19篇 |
1992年 | 18篇 |
1991年 | 26篇 |
1990年 | 19篇 |
1989年 | 36篇 |
1988年 | 27篇 |
1987年 | 25篇 |
1986年 | 26篇 |
1985年 | 21篇 |
1984年 | 17篇 |
1983年 | 11篇 |
1982年 | 20篇 |
1981年 | 18篇 |
1980年 | 24篇 |
1979年 | 18篇 |
1978年 | 19篇 |
1977年 | 16篇 |
1976年 | 15篇 |
1975年 | 14篇 |
1974年 | 22篇 |
1973年 | 14篇 |
1972年 | 14篇 |
1971年 | 22篇 |
1970年 | 10篇 |
1969年 | 14篇 |
1968年 | 9篇 |
1967年 | 12篇 |
排序方式: 共有1063条查询结果,搜索用时 15 毫秒
211.
212.
International population assistance in the UN is a relatively recent development; it is only since 1966 that a broad-based technical assistance program in population was authorized by the General Assembly. The desire of developing country members for accelerated economic growth ultimately brought about a change in the views on population. In 1967, the Secretary General established a trust fund for population activities, later renamed the United Nations Fund for Population Activities (UNFPA). 3 principles have guided UNFPA work since its inception: 1) national sovereignty in population matters is to be resspected and adhered to at all times, 2) individuals and couples are to be provided the information and services necessary to determine freely and responsibly the number and spacing of their children, and 3) population goals and policies are integral parts of socioeconomic defelopment. The areas of assistance by the UNFPA consist of 1) family planning, 2) communication and education, 3) population dynamics, 4) basic data collection, 5) population policy formulation and implementation, and 6) special programs such as those for women and the aging population. In 16 years, the UNFPA has received about $1.4 billion for transfer to developing countries as population assistanceand has financed 4373 population projects in 149 countries and territories. The relation between the US government and UNFPA is tenuous and likely to remain so as long as the US cannot resolve its own domestic controversies over famly planning, foreign population assistance, abortion, which, ironically, is legalin the country. There will always be some sort of domestic controversy over population; the UN has overcome domestic difficulties by framing the arguments properly within the demographic, social, economic, ecological, and political concerns of countries and applying the fundamental principles of national sovereignty, freedom of individual choice, and the link of population and development,to reconcile differences. 相似文献
213.
Multi-echelon logistic systems are essential parts of the service support function of high technology firms. The combination of technological developments and competitive pressures has led to the development of services systems with a unique set of characteristics. These characteristics include (1) low demand probabilities: (2) high cost items; (3) complex echelon structures; (4) existence of pooling mechanisms among stocking locations at the same echelon level; (5) high priority for service, which is often expressed in terms of response time service levels for product groups of items: (6) scrapping of failed parts; and (7) recycling of issued stock due to diagnostic use. This article develops a comprehensive model of a stochastic, multi-echelon inventory system that takes account of the above characteristics. Solutions to the constrained optimization problem are found using a branch and bound procedure. The results of applying this procedure to a spare parts inventory system for a computer manufacturer have led to a number of important policy conclusions. 相似文献
214.
215.
This article presents a branch and bound method for solving the problem of minimizing a separable concave function over a convex polyhedral set where the variables are restricted to be integer valued. Computational results are reported. 相似文献
216.
Craig A. Tovey 《海军后勤学研究》1986,33(4):717-724
We consider the problem of rescheduling n jobs to minimize the makespan on m parallel identical processors when m changes value. We show this problem to be NP-hard in general. Call a list schedule totally optimal if it is optimal for all m = 1, …,n. When n is less than 6, there always exists a totally optimal schedule, but for n ≥ 6 this can fail. We show that an exact solution is less robust than the largest processing time first (LPT) heuristic and discuss implications for polynomial approximation schemes and hierarchical planning models. 相似文献
217.
R. K. Ahuja 《海军后勤学研究》1986,33(4):725-739
In this paper, we consider a variant of the classical transportation problem as well as of the bottleneck transportation problem, which we call the minimax transportation problem. The problem considered is to determine a feasible flow xij from a set of origins I to a set of destinations J for which max(i,j)εIxJ{cijxij} is minimum. In this paper, we develop a parametric algorithm and a primal-dual algorithm to solve this problem. The parametric algorithm solves a transportation problem with parametric upper bounds and the primal-dual algorithm solves a sequence of related maximum flow problems. The primal-dual algorithm is shown to be polynomially bounded. Numerical investigations with both the algorithms are described in detail. The primal-dual algorithm is found to be computationally superior to the parametric algorithm and it can solve problems up to 1000 origins, 1000 destinations and 10,000 arcs in less than 1 minute on a DEC 10 computer system. The optimum solution of the minimax transportation problem may be noninteger. We also suggest a polynomial algorithm to convert this solution into an integer optimum solution. 相似文献
218.
Consider a fleet of vehicles comprised of K1 identical tankers and K2 identical nontankers (small aircraft). Tankers are capable of refueling other tankers as well as nontankers. The problem is to find that refueling sequence of the tankers that maximizes the range simultaneously attainable by all K2 nontankers. A recent paper established that the “unit refueling sequence,” comprised of one tanker refueling at each of K1 refueling operations, is optimal. The same paper also proffered the following conjecture for the case that the number of refueling operations is constrained to be less than the number of tankers: A nonincreasing refueling sequence is optimal. This article proves the conjecture. 相似文献
219.
Single- and multi-facility location problems are often solved with iterative computational procedures. Although these procedures have proven to converage, in practice it is desirable to be able to compute a lower bound on the objective function at each iteration. This enables the user to stop the iterative process when the objective function is within a prespecified tolerance of the optimum value. In this article we generalize a new bounding method to include multi-facility problems with lp distances. A proof is given that for Euclidean distance problems the new bounding procedure is superior to two other known methods. Numerical results are given for the three methods. 相似文献
220.
Discussed in this article are tests for the extreme-value distribution, or, equivalently, for the two-parameter Weibull distribution when parameters are unknown and the sample may be censored. The three tests investigated are based on the median, the mean, and the Anderson-Darling A2 statistic calculated from a set zi of values derived from the spacings of the sample. The median and the mean have previously been discussed by Mann, Scheuer, and Fertig [10] and by Tiku and Singh [14]. Asymptotic distributions and points are given for the test statistics, based on recently developed theory, and power studies are conducted to compare them with each other and with two other statistics suitable for the test. Of the normalized spacings tests, A2 is recommended overall; the mean also gives good power in many situations, but can be nonconsistent. 相似文献