全文获取类型
收费全文 | 654篇 |
免费 | 12篇 |
出版年
2021年 | 12篇 |
2019年 | 22篇 |
2018年 | 12篇 |
2017年 | 14篇 |
2016年 | 14篇 |
2015年 | 12篇 |
2014年 | 11篇 |
2013年 | 130篇 |
2009年 | 7篇 |
2008年 | 9篇 |
2007年 | 7篇 |
2005年 | 9篇 |
2004年 | 11篇 |
2003年 | 8篇 |
2002年 | 12篇 |
2001年 | 6篇 |
2000年 | 9篇 |
1999年 | 7篇 |
1998年 | 11篇 |
1997年 | 19篇 |
1996年 | 10篇 |
1995年 | 8篇 |
1994年 | 15篇 |
1993年 | 6篇 |
1992年 | 9篇 |
1991年 | 17篇 |
1990年 | 9篇 |
1989年 | 9篇 |
1988年 | 10篇 |
1987年 | 21篇 |
1986年 | 12篇 |
1985年 | 11篇 |
1984年 | 7篇 |
1983年 | 11篇 |
1982年 | 12篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 8篇 |
1977年 | 9篇 |
1976年 | 8篇 |
1975年 | 9篇 |
1974年 | 10篇 |
1973年 | 14篇 |
1972年 | 8篇 |
1971年 | 7篇 |
1970年 | 8篇 |
1969年 | 9篇 |
1968年 | 6篇 |
1967年 | 7篇 |
排序方式: 共有666条查询结果,搜索用时 15 毫秒
81.
Sheldon M. Ross 《海军后勤学研究》2015,62(8):659-663
There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λi before departing the system. The service time of customer i has distribution Fi, and on completion of service of customer i a positive reward ri is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015 相似文献
82.
While the arrival of nuclear weapons coincided roughly with the development of short, medium, intermediate, and eventually intercontinental missiles, the contribution of missile technology to the deterrence equation is often lost. If nuclear weapons were eliminated, even new generation missiles with conventional payloads could struggle to render effective deterrence. But some of the physical and psychological effects commonly ascribed to nuclear weapons could still be in play. And in a world without nuclear weapons, thinking about the use and control of force from the nuclear age would also deserve renewed attention. 相似文献
83.
Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n3) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n3) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
84.
85.
Let X1 < X2 <… < Xn denote an ordered sample of size n from a Weibull population with cdf F(x) = 1 - exp (?xp), x > 0. Formulae for computing Cov (Xi, Xj) are well known, but they are difficult to use in practice. A simple approximation to Cov(Xi, Xj) is presented here, and its accuracy is discussed. 相似文献
86.
Computerized Scheduling of Seagoing Tankers The tanker scheduling problem considered in this paper is that of the Defense Fuel Supply Center (DFSC) and the Military Sealift Command (MSC) in the worldwide distribution of bulk petroleum products. Routes and cargoes which meet delivery schedule dates for a multiplicity of product requirements at minimum cost are to be determined for a fleet of tankers. A general mathematical programming model is presented, and then a mixed integer model is developed which attempts to reflect the true scheduling task of DFSC and MSC as closely as possible. The problem is kept to within a workable size by the systematic construction of a set of tanker routes which does not contain many possible routes that can be judged unacceptable from practical considerations alone. 相似文献
87.
A method is presented to locate and allocate p new facilities in relation to n existing facilities. Each of the n existing facilities has a requirement flow which must be supplied by the new facilities. Rectangular distances are assumed to exist between all facilities. The algorithm proceeds in two stages. In the first stage a set of all possible optimal new facility locations is determined by a set reduction algorithm. The resultant problem is shown to be equivalent to finding the p-median of a weighted connected graph. In the second stage the optimal locations and allocations are obtained by using a technique for solving the p-median problem. 相似文献
88.
The hyperbolic integer program is treated as a special case of a hyperbolic program with a finite number of feasible points. The continuous hyperbolic program also belongs to this class since its solution can be obtained by considering only the extreme points of the feasible set. A general algorithm for solving the hyperbolic integer program which reduces to solving a sequence of linear integer problems is proposed. When the integer restriction is removed, this algorithm is similar to the Isbell-Marlow procedure. The geometrical aspects of the hyperbolic problem are also discussed and several cutting plane algorithms are given. 相似文献
89.
M. S. Bazaraa 《海军后勤学研究》1973,20(2):357-366
In this study we interpret the exterior penalty function method as a generalized lagrangian metliod which fills duality gaps in nonconvex problems. Geometry and resolution of these gaps from a duality point of view are highlighted. 相似文献
90.
Robert A. Agnew 《海军后勤学研究》1972,19(1):137-143
Suppose that a contractor is faced with a sequence of “minimum bid wins contract” competitions. Assuming that a contractor knows his cost to fulfill the contract at each competition and that competitors are merely informed whether or not they have won, bids may be selected sequentially via a tailored stochastic approximation procedure. The efficacy of this approach in certain bidding environments is investigated. 相似文献