全文获取类型
收费全文 | 256篇 |
免费 | 10篇 |
出版年
2020年 | 3篇 |
2019年 | 14篇 |
2018年 | 9篇 |
2017年 | 5篇 |
2016年 | 9篇 |
2015年 | 7篇 |
2014年 | 7篇 |
2013年 | 81篇 |
2011年 | 8篇 |
2010年 | 2篇 |
2009年 | 4篇 |
2008年 | 4篇 |
2007年 | 7篇 |
2006年 | 2篇 |
2005年 | 5篇 |
2004年 | 2篇 |
2003年 | 3篇 |
2002年 | 4篇 |
2001年 | 3篇 |
1999年 | 5篇 |
1998年 | 1篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 6篇 |
1993年 | 4篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 4篇 |
1988年 | 4篇 |
1987年 | 4篇 |
1986年 | 2篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 3篇 |
1981年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 1篇 |
1973年 | 3篇 |
1972年 | 4篇 |
1971年 | 2篇 |
1970年 | 3篇 |
1969年 | 3篇 |
1968年 | 2篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有266条查询结果,搜索用时 234 毫秒
41.
42.
The nonlinear difference equation for the distribution of the busy period for an unbounded discrete time queue of M|G| 1 type is solved numerically by a monotone iterative procedure. A starting solution is found by computing a first passage time distribution in a truncated version of the queue. 相似文献
43.
David Sternlight 《海军后勤学研究》1970,17(3):373-387
This paper describes the way in which economic analyses, particularly life-cycle cost analyses and tradeoffs were structured for use as an integrated analysis and design technique at all levels of the Contract Definition of the Fast Deployment Logistic Ship. It describes system, subsystem and major component economic analysis and design methodology as well as economic analyses of special subjects such as the ship production facility design. Illustrations are provided of several major system parametric studies and of shipyard and manning/automation analyses. 相似文献
44.
45.
46.
47.
In this journal in 1967. Szware presented an algorithm for the optimal routing of a common vehicle fleet between m sources and n sinks with p different types of commodities. The main premise of the formulation is that a truck may carry only one commodity at a time and must deliver the entire load to one demand area. This eliminates the problem of routing vehicles between sources or between sinks and limits the problem to the routing of loaded trucks between sources and sinks and empty trucks making the return trip. Szwarc considered only the transportation aspect of the problem (i. e., no intermediate points) and presented a very efficient algorithm for solution of the case he described. If the total supply is greater than the total demand, Szwarc shows that the problem is equivalent to a (mp + n) by (np + m) Hitchcock transportation problem. Digital computer codes for this algorithm require rapid access storage for a matrix of size (mp + n) by (np + m); therefore, computer storage required grows proportionally to p2. This paper offers an extension of his work to a more general form: a transshipment network with capacity constraints on all arcs and facilities. The problem is shown to be solvable directly by Fulkerson's out-of-kilter algorithm. Digital computer codes for this formulation require rapid access storage proportional to p instead of p2. Computational results indicate that, in addition to handling the extensions, the out-of-kilter algorithm is more efficient in the solution of the original problem when there is a mad, rate number of commodities and a computer of limited storage capacity. 相似文献
48.
This paper discusses a mixed integer programming method for solving the Facilities Location Problem with capacities on the facilities. The algorithm uses a Decomposition technique to solve the dual of the associated continuous problem in each branch-bound iteration. The method was designed to produce the global optimum solution for problems with up to 100 facilities and 1,000 customers. Computational experience and a complete example are also presented in the appendix. 相似文献
49.
50.
The exact expression is derived for the average stationary cost of a (Q,R) inventory system with lost sales, unit Poisson demands, Erlang-distributed lead times, fixed order cost, fixed cost per unit lost sale, linear holding cost per unit time, and a maximum of one order outstanding. Explicit expressions for the state probabilities and a fast method of calculating them are obtained for the case of Q greater than R. Exponential lead times are analyzed as a special case. A simple cyclic coordinate search procedure is used to locate the minimum cost policy. Examples of the effect of lead time variability on costs are given. 相似文献