全文获取类型
收费全文 | 867篇 |
免费 | 21篇 |
出版年
2021年 | 13篇 |
2019年 | 28篇 |
2018年 | 22篇 |
2017年 | 20篇 |
2016年 | 21篇 |
2015年 | 19篇 |
2014年 | 14篇 |
2013年 | 190篇 |
2011年 | 8篇 |
2009年 | 12篇 |
2008年 | 11篇 |
2007年 | 9篇 |
2006年 | 10篇 |
2005年 | 19篇 |
2004年 | 17篇 |
2003年 | 12篇 |
2002年 | 9篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 11篇 |
1997年 | 18篇 |
1996年 | 16篇 |
1995年 | 9篇 |
1994年 | 19篇 |
1993年 | 7篇 |
1992年 | 11篇 |
1991年 | 26篇 |
1989年 | 15篇 |
1988年 | 12篇 |
1987年 | 23篇 |
1986年 | 15篇 |
1985年 | 19篇 |
1984年 | 11篇 |
1983年 | 10篇 |
1982年 | 10篇 |
1980年 | 11篇 |
1979年 | 14篇 |
1978年 | 10篇 |
1977年 | 14篇 |
1976年 | 12篇 |
1975年 | 8篇 |
1974年 | 13篇 |
1973年 | 15篇 |
1972年 | 15篇 |
1971年 | 11篇 |
1970年 | 14篇 |
1969年 | 11篇 |
1968年 | 9篇 |
1967年 | 10篇 |
1966年 | 7篇 |
排序方式: 共有888条查询结果,搜索用时 31 毫秒
801.
A modification to the Dantzig and Fulkerson Tanker Scheduling Problem is described. An insufficient number of vehicles and a utility associated with each vehicle delivery are assumed. The new problem is shown to be equivalent to a Transshipment Problem, the solution of which is the same as the maximal utility solution of the modified Tanker Scheduling Problem. An example is given. 相似文献
802.
803.
The transportation model with supplies (Si) and demands (Di) treated as bounded variables developed by Charnes and Klingman is extended to the case where the Si and Di are independently and uniformly distributed random variables. Chance constraints which require that demand at the jth destination will be satisfied with probability at least βi and that stockout at the ith origin will occur with probability less than αi are imposed. Conversion of the chance constraints to their linear equivalents results in a transportation problem with one more row and column than the original with some of the new arcs capacitated. The chance-constrained formulation is extended to the transshipment problem. 相似文献
804.
A. M. Geoffrion 《海军后勤学研究》1977,24(2):201-212
A complete logistical planning model of a firm or public system should include activities having to do with the procurement of supplies. Not infrequently, however, procurement aspects are difficult to model because of their relatively complex and evanescent nature. This raises the issue of how to build an overall logistics model in spite of such difficulties. This paper offers some suggestions toward this end which enable the procurement side of a model to be simplified via commodity aggregation in a “controlled” way, that is, in such a manner that the modeler can know and control in advance of solving his model how much loss of accuracy will be incurred for the solutions to the (aggregated) overall model. 相似文献
805.
D. E. Matthews 《海军后勤学研究》1977,24(3):457-462
A simple method is presented for deriving the mean and variance of the queueing time distribution in an M/G/1 queue when the priorities assigned to customers have an assignment probability distribution. Several examples illustrate the results. The mean and variance of the queueing time distribution for the longest service time discipline are derived, and its disadvantages are discussed. 相似文献
806.
K. M. Mjelde 《海军后勤学研究》1977,24(4):639-650
The paper describes an approach to the evaluation of the effectiveness of a minefield in terms of the number of mines that are detonated by a convoy of sweepers and ships and the corresponding number of vessels that are immobilized. The positions of the mines and the tracks of the vessels are assumed to be known, which means that the evaluation measures are dependent on a large number of disjoint events, each event being the immobilization of particular vessels by particular mines. This may render combinatorial methods computationally infeasible, but by introducing approximations in the assumptions, the difficulty can be overcome, specifically by modelling the arrival of each individual vessel in the neighborhood of a mine by an inhomogeneous Poisson stream for which the arrival rate is nonzero only over a short time interval. The plausibility of the approach is supported by results of a critical-event simulation model. 相似文献
807.
808.
809.
The problem of determining a vector that places a system in a state of equilibrium is studied with the aid of mathematical programming. The approach derives from the logical equivalence between the general equilibrium problem and the complementarity problem, the latter being explicitly concerned with finding a point in the set S = {x: < x, g(x)> = 0, g(x) ≦ 0, x ≧ 0}. An associated nonconvex program, min{? < x, g(x) > : g(x) ≦ 0, x ≧ 0}, is proposed whose solution set coincides with S. When the excess demand function g(x) meets certain separability conditions, equilibrium solutions are obtained by using an established branch and bound algorithm. Because the best upper bound is known at the outset, an independent check for convergence can be made at each iteration of the algorithm, thereby greatly increasing its efficiency. A number of examples drawn from economic and network theory are presented in order to demonstrate the computational aspects of the approach. The results appear promising for a wide range of problem sizes and types, with solutions occurring in a relatively small number of iterations. 相似文献
810.
An efficient auxiliary algorithm for solving transportation problems, based on a necessary but not sufficient condition for optimum, is presented. 相似文献