全文获取类型
收费全文 | 738篇 |
免费 | 11篇 |
出版年
2021年 | 11篇 |
2020年 | 6篇 |
2019年 | 11篇 |
2017年 | 13篇 |
2016年 | 16篇 |
2015年 | 10篇 |
2014年 | 13篇 |
2013年 | 108篇 |
2012年 | 25篇 |
2011年 | 27篇 |
2010年 | 22篇 |
2009年 | 18篇 |
2008年 | 28篇 |
2007年 | 24篇 |
2006年 | 16篇 |
2005年 | 6篇 |
2004年 | 6篇 |
2003年 | 8篇 |
2002年 | 9篇 |
1998年 | 13篇 |
1997年 | 11篇 |
1996年 | 10篇 |
1995年 | 8篇 |
1994年 | 9篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 15篇 |
1990年 | 8篇 |
1989年 | 15篇 |
1987年 | 6篇 |
1986年 | 22篇 |
1985年 | 13篇 |
1984年 | 5篇 |
1983年 | 7篇 |
1982年 | 13篇 |
1981年 | 13篇 |
1980年 | 13篇 |
1979年 | 16篇 |
1978年 | 10篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 11篇 |
1974年 | 10篇 |
1973年 | 6篇 |
1972年 | 15篇 |
1971年 | 10篇 |
1970年 | 8篇 |
1969年 | 13篇 |
1968年 | 8篇 |
1967年 | 6篇 |
排序方式: 共有749条查询结果,搜索用时 296 毫秒
11.
12.
13.
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. 相似文献
14.
A simple renewal process is identified to approximate the complex departure process of a queue often found in queueing network models. The arrival process to the queue is the superposition or merging of several independent component-renewal processes that are approximations of departure processes from other queues and external arrival processes; there is a single server with exponential service times, and the waiting space is infinite. The departure process of this queue is of interest because it is the arrival process to other queues in the network. The approximation proposed is a hybrid; the mean and variance of the approximating departure intervals is a weighted average of those determined by basic methods in Whitt [41] with the weighting function empirically determined using simulation. Tandem queueing systems with superposition arrival processes and exponential service times are used to evaluate the approximation. The departure process of the first queue in the tandem is approximated by a renewal process, the tandem system is replaced by two independent queues, and the second queue is solved analytically. When compared to simulation estimates, the average absolute error in hybrid approximations of the expected number in the second queue is 6%, a significant improvement over 22–41% in the basic methods. 相似文献
15.
We consider a single machine scheduling problem in which the objective is to minimize the mean absolute deviation of job completion times about a common due date. We present an algorithm for determining multiple optimal schedules under restrictive assumptions about the due date, and an implicit enumeration procedure when the assumptions do not hold. We also establish the similarity of this problem to the two parallel machines mean flow time problem. 相似文献
16.
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. 相似文献
17.
18.
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. 相似文献
19.
Capacity expansion models typically minimize the discounted cost of acquisition and operation over a given planning horizon. In this article we generalize this idea to one in which a capital supply curve replaces the usual discount rate. A capital supply curve is a means to model financial outlook, investment limits, and risk. We show that when such a curve is included in a capacity expansion model, it will, under certain conditions, provide a less capital intensive solution than one which incorporates a discount rate. In this article, we also provide an algorithm that solves capacity expansion models that incorporate a capital supply curve. The attractive feature of this algorithm is that it provides a means to utilize the “discount rate” models efficiently. Throughout, we give applications in power generation planning and computational experience for this application is also presented. 相似文献
20.