全文获取类型
收费全文 | 1174篇 |
免费 | 22篇 |
出版年
2021年 | 13篇 |
2019年 | 24篇 |
2017年 | 31篇 |
2016年 | 22篇 |
2015年 | 23篇 |
2014年 | 28篇 |
2013年 | 208篇 |
2012年 | 28篇 |
2011年 | 30篇 |
2010年 | 33篇 |
2009年 | 27篇 |
2008年 | 34篇 |
2007年 | 20篇 |
2006年 | 25篇 |
2005年 | 15篇 |
2004年 | 17篇 |
2002年 | 15篇 |
2001年 | 11篇 |
2000年 | 11篇 |
1998年 | 20篇 |
1997年 | 17篇 |
1996年 | 17篇 |
1995年 | 13篇 |
1994年 | 19篇 |
1993年 | 23篇 |
1992年 | 18篇 |
1991年 | 25篇 |
1989年 | 13篇 |
1988年 | 11篇 |
1986年 | 32篇 |
1985年 | 24篇 |
1984年 | 14篇 |
1983年 | 12篇 |
1982年 | 14篇 |
1981年 | 20篇 |
1980年 | 22篇 |
1979年 | 20篇 |
1978年 | 18篇 |
1977年 | 12篇 |
1976年 | 17篇 |
1975年 | 16篇 |
1974年 | 14篇 |
1973年 | 10篇 |
1972年 | 24篇 |
1971年 | 15篇 |
1970年 | 14篇 |
1969年 | 15篇 |
1968年 | 13篇 |
1967年 | 11篇 |
1966年 | 10篇 |
排序方式: 共有1196条查询结果,搜索用时 15 毫秒
11.
Sufficient conditions under which the relevation of two probability distributions is (i) NBU, (ii) IFRA, (iii) IFR are derived. The result for case (iii) corrects an error in a previous article by Baxter. 相似文献
12.
13.
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. 相似文献
14.
15.
16.
17.
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”. 相似文献
18.
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. 相似文献
19.
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. 相似文献
20.
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. 相似文献