全文获取类型
收费全文 | 535篇 |
免费 | 13篇 |
出版年
2021年 | 10篇 |
2019年 | 12篇 |
2018年 | 10篇 |
2017年 | 11篇 |
2016年 | 9篇 |
2015年 | 14篇 |
2014年 | 13篇 |
2013年 | 99篇 |
2009年 | 4篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 4篇 |
2005年 | 5篇 |
2003年 | 8篇 |
2002年 | 7篇 |
2001年 | 8篇 |
2000年 | 7篇 |
1999年 | 5篇 |
1998年 | 9篇 |
1997年 | 11篇 |
1996年 | 5篇 |
1995年 | 7篇 |
1994年 | 9篇 |
1993年 | 11篇 |
1992年 | 9篇 |
1991年 | 11篇 |
1990年 | 6篇 |
1989年 | 11篇 |
1988年 | 21篇 |
1987年 | 9篇 |
1986年 | 20篇 |
1985年 | 11篇 |
1984年 | 8篇 |
1983年 | 8篇 |
1982年 | 4篇 |
1981年 | 9篇 |
1980年 | 7篇 |
1979年 | 14篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1976年 | 5篇 |
1975年 | 11篇 |
1974年 | 13篇 |
1973年 | 7篇 |
1972年 | 11篇 |
1971年 | 8篇 |
1970年 | 7篇 |
1969年 | 9篇 |
1968年 | 6篇 |
1966年 | 4篇 |
排序方式: 共有548条查询结果,搜索用时 15 毫秒
1.
S. Selcuk Erenguc 《海军后勤学研究》1988,35(1):1-22
In this article we consider a multiproduct dynamic lot-sizing model. In addition to a separate setup cost for each product ordered, a joint setup cost is incurred when at least one product is ordered. We formulate the model as a concave minimization problem over a compact polyhedral set and present a finite branch and bound algorithm for finding an optimal ordering schedule. Superiority of the branch and bound algorithm to the existing exact procedures is demonstrated. We report computational experience with problems whose dimensions render the existing procedures computationally infeasible. 相似文献
2.
3.
In this article, we examine the problem of producing a spanning Eulerian subgraph in an undirected graph. After the ?-completeness of the general problem is established, we present polynomial-time algorithms for both the maximization and minimization versions where instances are defined on a restricted class of graphs referred to as series-parallel. Some novelties in the minimization case are discussed, as are heuristic ideas. 相似文献
4.
A large sample test based on normal approximation for the traffic intensity parameter ρ in the cases of single and multiple-server queues has been proposed. The test procedure is developed without imposing steady-state assumptions and is applicable to queueing systems with general interarrival and service-time distributions. 相似文献
5.
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. 相似文献
7.
Suppose X is a random variable having an absolutely continuous distribution function F(x). We assume that F(x) has the Wald distribution. A relation between the probability density function of X−1 with that of X is used to characterize the Wald distribution. 相似文献
8.
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. 相似文献
9.
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. 相似文献
10.
A Student's t-test proposed by Ogawa is considered for the hypothesis Ho: σ=σo against the alternative hypothesis H1: σ ≠ σo, where σ is the scale parameter of the Extremevalue distribution of smallest values with known location parameter μ. The test is based on a few sample quantiles chosen from a large sample so as to give asymptotically maximum power to the test when the number of sample quantiles is fixed. A table which facilitates the computation of the test statistic is given. Several schemes for determining the ranks of the sample quantiles by the optimal spacings are compared and the effect of the bias of the estimate of σ on the test is investigated through a Monte Carlo study. 相似文献