全文获取类型
收费全文 | 700篇 |
免费 | 15篇 |
出版年
2021年 | 11篇 |
2020年 | 8篇 |
2019年 | 25篇 |
2018年 | 14篇 |
2017年 | 19篇 |
2016年 | 17篇 |
2015年 | 15篇 |
2014年 | 13篇 |
2013年 | 156篇 |
2011年 | 7篇 |
2009年 | 8篇 |
2008年 | 7篇 |
2007年 | 7篇 |
2006年 | 7篇 |
2005年 | 12篇 |
2004年 | 9篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 9篇 |
1998年 | 10篇 |
1997年 | 17篇 |
1996年 | 9篇 |
1995年 | 9篇 |
1994年 | 14篇 |
1992年 | 11篇 |
1991年 | 22篇 |
1989年 | 9篇 |
1988年 | 9篇 |
1987年 | 20篇 |
1986年 | 12篇 |
1985年 | 11篇 |
1984年 | 6篇 |
1983年 | 10篇 |
1982年 | 9篇 |
1981年 | 6篇 |
1980年 | 11篇 |
1979年 | 12篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1976年 | 9篇 |
1975年 | 10篇 |
1974年 | 13篇 |
1973年 | 16篇 |
1972年 | 7篇 |
1971年 | 7篇 |
1970年 | 10篇 |
1969年 | 7篇 |
1968年 | 7篇 |
1967年 | 7篇 |
排序方式: 共有715条查询结果,搜索用时 203 毫秒
491.
The classical “Colonel Blotto” games of force allocation are generalized to include situations in which there are complementarities among the targets being defended. The complementarities are represented by means of a system “characteristic function,” and a valuation technique from the theory of cooperative games is seen to indicate the optimal allocations of defense and attack forces. Cost trade-offs between systems defense and alternative measures, such as the hardening of targets, are discussed, and a simple example is analyzed in order to indicate the potential of this approach. 相似文献
492.
The integer programming literature contains many algorithms for solving all-integer programming problems but, in general, existing algorithms are less than satisfactory even in solving problems of modest size. In this paper we present a new technique for solving the all-integer, integer programming problem. This algorithm is a hybrid (i.e., primal-dual) cutting-plane method which alternates between a primal-feasible stage related to Young's simplified primal algorithm, and a dual-infeasible stage related to Gomory's dual all-integer algorithm. We present the results of computational testing. 相似文献
493.
494.
Basheer M. Khumawala 《海军后勤学研究》1973,20(1):109-121
This paper introduces an efficient heuristic procedure for a special class of mixed integer programming problems called the uncapacitated warehouse (plant) location problem. This procedure is derived from the branching decision rules proposed for the branch and bound algorithm by the author in an earlier paper. It can be viewed as tracing a single path of the branch and bound tree (from the initial node to the terminal node), the path being determined by the particular branching decision rule used. Unlike branch and bound the computational efficiency of this procedure is substantially less than linearly related to the number of potential warehouse locations (integer variables) in the problem. Its computational efficiency is tested on problems found in the literature. 相似文献
495.
James G. Taylor 《海军后勤学研究》1973,20(1):25-39
We show that the well-known necessary and sufficient conditions for a relative maximum of a nonlinear differentiable objective function with nonnegative variables constrained by nonlinear differentiable inequalities may be derived using the classical theory of equality constrained optimization problems with unrestricted variables. To do this we transform the original inequality-constrained problem to an equivalent equality-constrained problem by means of a well-known squared-variable transformation. Our major result is to show that second order conditions must be used to obtain the Kuhn-Tucker conditions by this approach. Our nonlinear programming results are motivated by the development of some well-known linear programming results by this approach. 相似文献
496.
James K. Hartman 《海军后勤学研究》1973,20(3):569-576
When applied to a problem which has more than one local optimal solution, most nonlinear programming algorithms will terminate with the first local solution found. Several methods have been suggested for extending the search to find the global optimum of such a nonlinear program. In this report we present the results of some numerical experiments designed to compare the performance of various strategies for finding the global solution. 相似文献
497.
498.
499.
Paul Meyer James 《海军后勤学研究》1968,15(4):595-604
Learning curves have been used extensively for predictive purposes in the airframe and other industries. In many instances this has led to erroneous results because analysts failed to extend learning curve theory and develop adequate analytical techniques in the turbulent regime of the cost history characterizing these industries. It is this area where a series of design changes induces a series of perturbations whose turbulence intensity is a function of the frequency of occurrence and magnitudes of the design changes under consideration. In Ref. 1, a series of formulations amenable to machine programming was developed for the accurate determination of perturbed unit costs. This development was based on additions of new learning having a constant slope. In this discussion, the development of Ref. 1 will be generalized by developing formulas for the addition of new effort having variable slopes. Consideration will also be given to the expressions involving elementary unit cost expressions so that cumulative average and cumulative total values can readily be obtained from existing experience curve tables. Conversely, the problem of determining the magnitudes of design changes and the slopes of new effort from graphical data will also be considered. 相似文献
500.