全文获取类型
收费全文 | 734篇 |
免费 | 17篇 |
出版年
2019年 | 21篇 |
2018年 | 13篇 |
2017年 | 22篇 |
2016年 | 21篇 |
2015年 | 15篇 |
2013年 | 152篇 |
2011年 | 10篇 |
2010年 | 8篇 |
2009年 | 7篇 |
2008年 | 8篇 |
2007年 | 9篇 |
2006年 | 12篇 |
2005年 | 17篇 |
2004年 | 13篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2001年 | 8篇 |
2000年 | 11篇 |
1999年 | 6篇 |
1998年 | 8篇 |
1997年 | 12篇 |
1996年 | 14篇 |
1995年 | 10篇 |
1994年 | 14篇 |
1993年 | 9篇 |
1992年 | 14篇 |
1991年 | 23篇 |
1990年 | 9篇 |
1989年 | 15篇 |
1988年 | 9篇 |
1987年 | 16篇 |
1986年 | 14篇 |
1985年 | 17篇 |
1984年 | 10篇 |
1983年 | 10篇 |
1982年 | 8篇 |
1981年 | 9篇 |
1980年 | 15篇 |
1979年 | 8篇 |
1978年 | 12篇 |
1977年 | 11篇 |
1976年 | 11篇 |
1975年 | 9篇 |
1974年 | 16篇 |
1973年 | 12篇 |
1972年 | 10篇 |
1971年 | 13篇 |
1970年 | 6篇 |
1969年 | 6篇 |
1968年 | 7篇 |
排序方式: 共有751条查询结果,搜索用时 31 毫秒
51.
Let X1 < X2 <… < Xn denote an ordered sample of size n from a Weibull population with cdf F(x) = 1 - exp (?xp), x > 0. Formulae for computing Cov (Xi, Xj) are well known, but they are difficult to use in practice. A simple approximation to Cov(Xi, Xj) is presented here, and its accuracy is discussed. 相似文献
52.
James G. Taylor 《海军后勤学研究》1974,21(1):79-106
The optimization of the dynamics of combat (optimal distribution of fire over enemy target types) is studied through a sequence of idealized models by use of the mathematical theory of optimal control. The models are for combat over a period of time described by Lanchester-type equations with a choice of tactics available to one side and subject to change with time. The structure of optimal fire distribution policies is discussed with reference to the influence of combatant objectives, termination conditions of the conflict, type of attrition process, and variable attrition-rate coefficients. Implications for intelligence, command and control systems, and human decision making are pointed out. The use of such optimal control models for guiding extensions to differential games is discussed. 相似文献
53.
A basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A number of algorithms have been developed for finding solutions, and this paper reports a comparative evaluation of these procedures. Computer programs for five separate algorithms were written and all were run on a data base designed to highlight computational differences. Optimizing algorithms developed by Emmons and by Srinivasan appeared to be particularly efficient in the comparative study. 相似文献
54.
A. Victor Cabot 《海军后勤学研究》1974,21(2):265-274
A cutting plane method for solving concave minimization problems with linear constraints has been advanced by Tui. The principle behind this cutting plane has been applied to integer programming by Balas, Young, Glover, and others under the name of convexity cuts. This paper relates the question of finiteness of Tui's method to the so-called generalized lattice point problem of mathematical programming and gives a sufficient condition for terminating Tui's method. The paper then presents several branch-and-bound algorithms for solving concave minimization problems with linear constraints with the Tui cut as the basis for the algorithm. Finally, some computational experience is reported for the fixed-charge transportation problem. 相似文献
55.
A method is presented to locate and allocate p new facilities in relation to n existing facilities. Each of the n existing facilities has a requirement flow which must be supplied by the new facilities. Rectangular distances are assumed to exist between all facilities. The algorithm proceeds in two stages. In the first stage a set of all possible optimal new facility locations is determined by a set reduction algorithm. The resultant problem is shown to be equivalent to finding the p-median of a weighted connected graph. In the second stage the optimal locations and allocations are obtained by using a technique for solving the p-median problem. 相似文献
56.
James G. Taylor 《海军后勤学研究》1975,22(4):617-650
The treatment of force-level constraints in time-sequential combat optimization problems is illustrated by further studying the fire-programming problem of Isbell and Marlow. By using the theory of state variable inequality constraints from modern optimal control theory, sharper results are obtained on necessary conditions of optimality for an optimal fire-distribution policy (in several cases justifying conjectures made in previous analysis). This leads to simplification of the determination of the domains of controllability for extremals leading to the various terminal states of combat. (Additionally, some new results for the determination of boundary conditions for the adjoint variables in optimal control problems with state variable inequality constraints have arisen from this work.) Some further extensions of previous analysis of the fire-programming problem are also given. These clarify some key points in the solution synthesis. Some important military principles for target selection and the valuation of combat resources are deduced from the solution. As a result of this work, more general time-sequential combat optimization problems can be handled, and a more systematic solution procedure is developed. 相似文献
57.
Edward A. Silver 《海军后勤学研究》1973,20(2):241-254
This paper does not present a new result, rather it is meant to illustrate the choice of modelling procedures available to an analyst in a typical inventory control problem. The same “average cost per unit time” expression is developed by three quite different procedures. This variety of approaches, as well as the recounting of the author's chronological efforts to solve the problem, should be of interest to the reader. The specific inventory problem studied is one where the controller of an item is faced with random opportunities for replenishment at a reduced setup cost; the problem is an integral component of the broader problem of inventory control of a group of items whose replenishments are coordinated to reduce the costs of production, procurement, and/or transportation. 相似文献
58.
A complete analysis and explicit solution is presented for the problem of linear fractional programming with interval programming constraints whose matrix is of full row rank. The analysis proceeds by simple transformation to canonical form, exploitation of the Farkas-Minkowki lemma and the duality relationships which emerge from the Charnes-Cooper linear programming equivalent for general linear fractional programming. The formulations as well as the proofs and the transformations provided by our general linear fractional programming theory are here employed to provide a substantial simplification for this class of cases. The augmentation developing the explicit solution is presented, for clarity, in an algorithmic format. 相似文献
59.
Robert A. Agnew 《海军后勤学研究》1972,19(1):137-143
Suppose that a contractor is faced with a sequence of “minimum bid wins contract” competitions. Assuming that a contractor knows his cost to fulfill the contract at each competition and that competitors are merely informed whether or not they have won, bids may be selected sequentially via a tailored stochastic approximation procedure. The efficacy of this approach in certain bidding environments is investigated. 相似文献
60.
Models are formulated for determining continuous review (Q, r) policies for a multiitem inventory subject to constraints. The objective function is the minimization of total time-weighted shortages. The constraints apply to inventory investment and reorder workload. The formulations are thus independent of the normal ordering, holding, and shortage costs. Two models are presented, each representing a convex programming problem. Lagrangian techniques are employed with the first, simplified model in which only the reorder points are optimized. In the second model both the reorder points and the reorder quantities are optimized utilizing penalty function methods. An example problem is solved for each model. The final section deals with the implementation of these models in very large inventory systems. 相似文献