全文获取类型
收费全文 | 765篇 |
免费 | 89篇 |
国内免费 | 27篇 |
出版年
2022年 | 12篇 |
2021年 | 25篇 |
2020年 | 25篇 |
2019年 | 9篇 |
2017年 | 18篇 |
2016年 | 14篇 |
2015年 | 24篇 |
2014年 | 28篇 |
2013年 | 75篇 |
2012年 | 50篇 |
2011年 | 61篇 |
2010年 | 43篇 |
2009年 | 49篇 |
2008年 | 59篇 |
2007年 | 41篇 |
2006年 | 47篇 |
2005年 | 23篇 |
2004年 | 16篇 |
2003年 | 7篇 |
2002年 | 10篇 |
2001年 | 16篇 |
1999年 | 7篇 |
1998年 | 11篇 |
1997年 | 9篇 |
1996年 | 5篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 10篇 |
1992年 | 9篇 |
1991年 | 7篇 |
1990年 | 4篇 |
1989年 | 12篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 3篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有881条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
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. 相似文献
5.
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. 相似文献
6.
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.
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.
10.
This paper considers a logistics system modelled as a transportation problem with a linear cost structure and lower bounds on supply from each origin and to each destination. We provide an algorithm for obtaining the growth path of such a system, i. e., determining the optimum shipment patterns and supply levels from origins and to destinations, when the total volume handled in the system is increased. Extensions of the procedure for the case when the costs of supplying are convex and piecewise linear and for solving transportation problems that are not in “standard form” are discussed. A procedure is provided for determining optimal plant capacities when the market requirements have prespecified growth rates. A goal programming growth model where the minimum requirements are treated as goals rather than as absolute requirements is also formulated. 相似文献