全文获取类型
收费全文 | 1000篇 |
免费 | 20篇 |
出版年
2021年 | 13篇 |
2019年 | 21篇 |
2018年 | 9篇 |
2017年 | 23篇 |
2016年 | 19篇 |
2015年 | 18篇 |
2014年 | 18篇 |
2013年 | 209篇 |
2012年 | 9篇 |
2010年 | 12篇 |
2009年 | 15篇 |
2007年 | 18篇 |
2006年 | 11篇 |
2005年 | 13篇 |
2004年 | 15篇 |
2003年 | 14篇 |
2002年 | 16篇 |
2000年 | 10篇 |
1999年 | 11篇 |
1998年 | 17篇 |
1997年 | 14篇 |
1996年 | 16篇 |
1995年 | 10篇 |
1994年 | 24篇 |
1993年 | 25篇 |
1992年 | 16篇 |
1991年 | 24篇 |
1990年 | 11篇 |
1989年 | 13篇 |
1987年 | 11篇 |
1986年 | 30篇 |
1985年 | 22篇 |
1984年 | 12篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 15篇 |
1980年 | 15篇 |
1979年 | 19篇 |
1978年 | 19篇 |
1977年 | 10篇 |
1976年 | 12篇 |
1975年 | 11篇 |
1974年 | 19篇 |
1973年 | 14篇 |
1972年 | 15篇 |
1971年 | 16篇 |
1970年 | 16篇 |
1969年 | 14篇 |
1968年 | 10篇 |
1967年 | 11篇 |
排序方式: 共有1020条查询结果,搜索用时 191 毫秒
21.
22.
Harvey J. Greenberg 《海军后勤学研究》1986,33(4):635-655
Degeneracy in linear programming models has been analyzed for its impacts on algorithmic properties. A complementary analysis here is on what the solutions mean. The framework presented is couched in marginal sensitivity analysis, introducing concepts of “compatible bases” and “transition graphs”. 相似文献
23.
John R. McNamara 《海军后勤学研究》1986,33(3):501-512
A posynomial geometric programming problem formulated so that the number of objective function terms is equal to the number of primal variables will have a zero degree of difficulty when augmented by multiplying each constraint term by a slack variable and including a surrogate constraint composed of the product of the slack variables, each raised to an undetermined negative exponent or surrogate multiplier. It is assumed that the original problem is canonical. The exponents in the constraint on the product of the slack variables must be estimated so that the associated solution to the augmented problem, obtained immediately, also solves the original problem. An iterative search procedure for finding the required exponents, thus solving the original problem, is described. The search procedure has proven quite efficient, often requiring only two or three iterations per degree of difficulty of the original problem. At each iteration the well-known procedure for solving a geometric programming problem with a zero degree of difficulty is used and so computations are simple. The solution generated at each iteration is optimal for a problem which differs from the original problem only in the values of some of the constraint coefficients, so intermediate solutions provide useful information. 相似文献
24.
Characteristics of supply performance at the top echelon of an optimally managed multiechelon supply system are investigated; insights are developed which are useful in devising coordinated single-echelon policies which can approximate the benefits derived from multiechelon management. 相似文献
25.
A probabilistic model is developed that applies to military bombardment, advertising for a mass audience, and other kinds of situations in which striking a target means that less of it is left to strike. The model provides the basis for decision analysis based on marginal gain in such circumstances. Heterogneous resources are considered as well as composite targets. All expenditures are quantized. The model has been developed as part of a computer-based military expert system, to replace a large complex set of expert opinions. In that application it sharply improves efficiency, yet conforms to major tenets of tactical doctrine. 相似文献
26.
27.
28.
Multiechelon repairable-item provisioning systems are considered under a time-varying environment. Such conditions could arise, for example, in a military context where a shift from peacetime operation to wartime operation takes place; or, in a civilian setting where a public transit system decides to increase its hours of operation or frequency of service. Exact Markovian models, incorporating a finite population of repairable components and limited repair capacity (nonample service), are treated, with transient solutions obtained using the randomization technique. The exact models are compared with the approximate Dyna-METRIC model which assumes an infinite population of components and ample repair capacity. 相似文献
30.
Classical inventory models generally assume either no backlogging of demands or unlimited backlogging. This paper treats the case wherein backlogged customers are willing to wait for a random period of time for service. A broad class of such models is discussed, with a more complete analysis performed on a simple subclass. Steady state equations are derived and solved assuming exponentially distributed interarrival times of customers, order delivery lead times, and customer patience. 相似文献