全文获取类型
收费全文 | 324篇 |
免费 | 5篇 |
专业分类
329篇 |
出版年
2021年 | 3篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 9篇 |
2015年 | 7篇 |
2014年 | 3篇 |
2013年 | 83篇 |
2011年 | 4篇 |
2008年 | 4篇 |
2007年 | 8篇 |
2006年 | 4篇 |
2005年 | 9篇 |
2004年 | 3篇 |
2003年 | 3篇 |
2002年 | 5篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1999年 | 5篇 |
1997年 | 2篇 |
1996年 | 4篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 5篇 |
1988年 | 6篇 |
1987年 | 5篇 |
1986年 | 9篇 |
1985年 | 5篇 |
1983年 | 4篇 |
1982年 | 8篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 5篇 |
1977年 | 5篇 |
1976年 | 2篇 |
1975年 | 5篇 |
1974年 | 7篇 |
1973年 | 7篇 |
1972年 | 7篇 |
1971年 | 8篇 |
1970年 | 3篇 |
1969年 | 5篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 3篇 |
1948年 | 3篇 |
排序方式: 共有329条查询结果,搜索用时 0 毫秒
11.
We first present a survey on the theory of semi-infinite programming as a generalization of linear programming and convex duality theory. By the pairing of a finite dimensional vector space over an arbitrarily ordered field with a generalized finite sequence space, the major theorems of linear programming are generalized. When applied to Euclidean spaces, semi-infinite programming theory yields a dual theorem associating as dual problems minimization of an arbitrary convex function over an arbitrary convex set in n-space with maximization of a linear function in non-negative variables of a generalized finite sequence space subject to a finite system of linear equations. We then present a new generalization of the Kuhn-Tucker saddle-point equivalence theorem for arbitrary convex functions in n-space where differentiability is no longer assumed. 相似文献
12.
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. 相似文献
13.
Under certain conditions, the re-supply capability of a combatant force may be limited by the characteristics of the transportation network over which supplies must flow. Interdiction by an opposing force may be used to reduce the capacity of that network. The effects of such efforts vary for differing missions and targets. With only a limited total budget available, the interdictor must decide which targets to hit, and with how much effort. An algorithm is presented for determining the optimum interdiction plan for minimizing network flow capacity when the minimum capacity on an arc is positive and the cost of interdiction is a linear function of arc capacity reduction. 相似文献
14.
This paper presents a general solution for the M/M/r queue with instantaneous jockeying and r > 1 servers. The solution is obtained in matrices in closed form without recourse to the generating function arguments usually used. The solution requires the inversion of two (Zr?1) × (2r?1) matrices. The method proposed is extended to allow different queue selection preferences of arriving customers, balking of arrivals, jockeying preference rules, and queue dependent selection along with jockeying. To illustrate the results, a problem previously published is studied to show how known results are obtained from the proposed general solution. 相似文献
15.
16.
17.
A. W. Kemp 《海军后勤学研究》1987,34(6):853-858
The article examines ways of computing cumulative probabilities for a constrained Poissonian binomial distribution arising from a model of a weapon defense system. 相似文献
18.
19.
Russell W. Ramsey 《Defense & Security Analysis》1996,12(2):227-237
20.
A generalization of the equi-partitioning problem, termed the 2D-Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space—tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms for m = 2 and 3. © 1996 John Wiley & Sons, Inc. 相似文献