全文获取类型
| 收费全文 | 891篇 |
| 免费 | 0篇 |
专业分类
| 891篇 |
出版年
| 2021年 | 13篇 |
| 2019年 | 28篇 |
| 2018年 | 22篇 |
| 2017年 | 20篇 |
| 2016年 | 21篇 |
| 2015年 | 19篇 |
| 2014年 | 14篇 |
| 2013年 | 190篇 |
| 2011年 | 8篇 |
| 2009年 | 12篇 |
| 2008年 | 11篇 |
| 2007年 | 9篇 |
| 2006年 | 10篇 |
| 2005年 | 19篇 |
| 2004年 | 17篇 |
| 2003年 | 12篇 |
| 2002年 | 9篇 |
| 2000年 | 9篇 |
| 1999年 | 8篇 |
| 1998年 | 11篇 |
| 1997年 | 18篇 |
| 1996年 | 16篇 |
| 1995年 | 9篇 |
| 1994年 | 19篇 |
| 1992年 | 11篇 |
| 1991年 | 26篇 |
| 1989年 | 15篇 |
| 1988年 | 12篇 |
| 1987年 | 23篇 |
| 1986年 | 15篇 |
| 1985年 | 19篇 |
| 1984年 | 11篇 |
| 1983年 | 10篇 |
| 1982年 | 10篇 |
| 1981年 | 7篇 |
| 1980年 | 11篇 |
| 1979年 | 14篇 |
| 1978年 | 10篇 |
| 1977年 | 14篇 |
| 1976年 | 12篇 |
| 1975年 | 8篇 |
| 1974年 | 13篇 |
| 1973年 | 15篇 |
| 1972年 | 15篇 |
| 1971年 | 11篇 |
| 1970年 | 14篇 |
| 1969年 | 11篇 |
| 1968年 | 9篇 |
| 1967年 | 10篇 |
| 1966年 | 7篇 |
排序方式： 共有891条查询结果，搜索用时 15 毫秒
221.
In this paper, a branch-and-bound procedure is presented for treating the general knapsack problem. The fundamental notion of the procedure involves a variation of traditional branching strategies as well as the incorporation of penalties in order to improve bounds. Substantial computational experience has been obtained, the results of which would indicate the feasibility of the procedure for problems of large size. 相似文献
222.
This paper analyzes the problem faced by a field commander who, confronted by an enemy on N battlefields, must determine an interdiction policy for the enemy's logistics system which minimizes the amount of war material flowing through this system per unit time. The resource utilized to achieve this interdiction is subject to constraint. It can be shown that this problem is equivalent to determining the set of arcs Z* to remove subject to constraint from a directed graph G such that the resulting maximal flow is minimized. A branch and bound algorithm for the solution to this problem is described, and a numerical example is provided. 相似文献
223.
Salah E. Elmaghraby 《海军后勤学研究》1968,15(1):23-32
Given n jobs and a single facility, and the fact that a subset of jobs are “related” to each other in such a manner that regardless of which job is completed first, its utility is hampered until all other jobs in the same subset are also completed, it is desired to determine the sequence which minimizes the cost of tardiness. The special case of pairwise relationship among all jobs is easily solved. An algorithm for the general case is given through a dynamic programming formulation. 相似文献
224.
A general class of continuous time nonlinear problems is considered. Necessary and sufficient conditions for the existence of solutions are established and optimal solutions are characterized in terms of a duality theorem. The theory is illustrated by means of an example. 相似文献
225.
Manning the nation's armed services will continue to be a crucial issue for the remainder of the 1980s. With the projected growth of the services during this decade, the downturn in the 17–21-year-old male population, and the possible upturn in the economy, the ability of the services to meet their respective quality and quantity recruiting goals becomes of central concern. The accurate estimation of the supply for various types of recruits becomes especially important when one views the nearly $1 billion budgeted annually for recruiting and the impact that any military pay raises can have on the DOD's manpower costs of over $40 billion annually. In addition, perceived difficulties in recruiting can impact on weapon systems design decisions, authorized manning levels, and exacerbate the debate concerning the draft; hence, it is clear that few issues today warrant more attention than improving the efficiency and effectiveness of military recruiting. This article provides an introduction and review of some of the key issues involved in modeling and estimating the supply of military recruits. It summarizes and compares the findings of selected econometric models, all of which are based on enlistment experience since the introduction of the All-Volunteer Force in 1973. It also presents some new insights and directions for research dealing with simultaneity, validation, generation of rigorous confidence intervals, and data base selection. It concludes by listing some of the research needs to be addressed in the future. 相似文献
226.
Dirichlet mixed models find wide application. Estimation is usually achieved through the method of moments. Here we present an iterative hybrid algorithm for obtaining the maximum likelihood estimate employing both modified Newton-Raphson and E-M methods. This successful MLE algorithm enables calculation of a jack-knife MLE. Simulation comparison of the three estimates is provided. The MLE substantially improves upon the moments estimator particularly with increasing dimension. The jack-knife MLE in turn offers dramatic improvement over the MLE. 相似文献
227.
We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance. 相似文献
228.
A double-ended queue with a Poisson arrival pattern is examined in a situation where the rates depend (in a restricted sense) on both the time and the state of the system. Under some circumstances, the rates can be controlled. This article studies the distribution of the difference in queue sizes for each member of a large class of control strategies and introduces the problem of determining the optimal times at which the control should be in effect in order to maximize certain objective functions. 相似文献
229.
The problem of assigning patrol boats, subject to resource constraints, to capture or delay an infiltrator with perishable contraband attempting escape across a long, narrow strait is formulated as a two-sided time sequential game. Optimal mixed strategies are derived for the situation of one patrol boat against one smuggler. Procedures for obtaining numerical solutions for R > 1 patrol boats are discussed. 相似文献
230.