全文获取类型
收费全文 | 3334篇 |
免费 | 82篇 |
国内免费 | 1篇 |
出版年
2021年 | 37篇 |
2019年 | 88篇 |
2018年 | 51篇 |
2017年 | 81篇 |
2016年 | 79篇 |
2015年 | 63篇 |
2014年 | 64篇 |
2013年 | 701篇 |
2010年 | 36篇 |
2009年 | 37篇 |
2008年 | 47篇 |
2007年 | 52篇 |
2006年 | 36篇 |
2005年 | 43篇 |
2004年 | 56篇 |
2003年 | 42篇 |
2002年 | 57篇 |
1999年 | 41篇 |
1998年 | 46篇 |
1997年 | 50篇 |
1996年 | 63篇 |
1995年 | 41篇 |
1994年 | 59篇 |
1993年 | 64篇 |
1992年 | 58篇 |
1991年 | 74篇 |
1990年 | 39篇 |
1989年 | 72篇 |
1988年 | 78篇 |
1987年 | 68篇 |
1986年 | 71篇 |
1985年 | 64篇 |
1984年 | 36篇 |
1983年 | 42篇 |
1982年 | 43篇 |
1981年 | 46篇 |
1980年 | 51篇 |
1979年 | 45篇 |
1978年 | 49篇 |
1977年 | 45篇 |
1976年 | 45篇 |
1975年 | 46篇 |
1974年 | 52篇 |
1973年 | 50篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 40篇 |
1969年 | 40篇 |
1968年 | 34篇 |
1967年 | 34篇 |
排序方式: 共有3417条查询结果,搜索用时 15 毫秒
641.
A critical element in implementing a compensation scheme including nonmonetary incentives (NMIs) is recognizing that preferences vary widely across Service members. There are at least three sources of variability: across different population classes, across individuals within a population class, and across NMI packages for a particular individual. Surveys across different military communities, ranks, and years of Service show the difficulty of identifying any NMI that has significant value for even 50% of the active duty force. At the same time, approximately 80% of the surveyed Service members expressed a significant positive value for at least one NMI. Therefore, one-size-fits-all incentive packages will not be nearly as effective as more personalized incentive packages. The authors discuss variability in Service member NMI preferences and outline an approach to implementing personalized NMI packages in military compensation through a sealed-bid reverse auction, where Service members select individual NMIs from a “cafeteria-style” menu of options. 相似文献
642.
Multi-echelon logistic systems are essential parts of the service support function of high technology firms. The combination of technological developments and competitive pressures has led to the development of services systems with a unique set of characteristics. These characteristics include (1) low demand probabilities: (2) high cost items; (3) complex echelon structures; (4) existence of pooling mechanisms among stocking locations at the same echelon level; (5) high priority for service, which is often expressed in terms of response time service levels for product groups of items: (6) scrapping of failed parts; and (7) recycling of issued stock due to diagnostic use. This article develops a comprehensive model of a stochastic, multi-echelon inventory system that takes account of the above characteristics. Solutions to the constrained optimization problem are found using a branch and bound procedure. The results of applying this procedure to a spare parts inventory system for a computer manufacturer have led to a number of important policy conclusions. 相似文献
643.
This article presents a branch and bound method for solving the problem of minimizing a separable concave function over a convex polyhedral set where the variables are restricted to be integer valued. Computational results are reported. 相似文献
644.
This paper provides a framework in which warranty policies for non-repairable items can be evaluated according to risk preferences of both buyers and sellers. In particular, a warranty price schedule is established such that sellers are indifferent among the policies. Given this schedule, a buyer's response is expressed by selecting the price-warranty combination that minimizes disutility. Within this framework, a warranty can be viewed as an instrumet of risk management that can induce more sales and greater profitability. For given utility functions, analytical results for the development of a price schedule are developed. Numerical results illustrate the substitution effects between warranty terms, prices, and risk parameters. 相似文献
645.
Craig A. Tovey 《海军后勤学研究》1986,33(4):717-724
We consider the problem of rescheduling n jobs to minimize the makespan on m parallel identical processors when m changes value. We show this problem to be NP-hard in general. Call a list schedule totally optimal if it is optimal for all m = 1, …,n. When n is less than 6, there always exists a totally optimal schedule, but for n ≥ 6 this can fail. We show that an exact solution is less robust than the largest processing time first (LPT) heuristic and discuss implications for polynomial approximation schemes and hierarchical planning models. 相似文献
646.
R. K. Ahuja 《海军后勤学研究》1986,33(4):725-739
In this paper, we consider a variant of the classical transportation problem as well as of the bottleneck transportation problem, which we call the minimax transportation problem. The problem considered is to determine a feasible flow xij from a set of origins I to a set of destinations J for which max(i,j)εIxJ{cijxij} is minimum. In this paper, we develop a parametric algorithm and a primal-dual algorithm to solve this problem. The parametric algorithm solves a transportation problem with parametric upper bounds and the primal-dual algorithm solves a sequence of related maximum flow problems. The primal-dual algorithm is shown to be polynomially bounded. Numerical investigations with both the algorithms are described in detail. The primal-dual algorithm is found to be computationally superior to the parametric algorithm and it can solve problems up to 1000 origins, 1000 destinations and 10,000 arcs in less than 1 minute on a DEC 10 computer system. The optimum solution of the minimax transportation problem may be noninteger. We also suggest a polynomial algorithm to convert this solution into an integer optimum solution. 相似文献
647.
Consider a fleet of vehicles comprised of K1 identical tankers and K2 identical nontankers (small aircraft). Tankers are capable of refueling other tankers as well as nontankers. The problem is to find that refueling sequence of the tankers that maximizes the range simultaneously attainable by all K2 nontankers. A recent paper established that the “unit refueling sequence,” comprised of one tanker refueling at each of K1 refueling operations, is optimal. The same paper also proffered the following conjecture for the case that the number of refueling operations is constrained to be less than the number of tankers: A nonincreasing refueling sequence is optimal. This article proves the conjecture. 相似文献
648.
Single- and multi-facility location problems are often solved with iterative computational procedures. Although these procedures have proven to converage, in practice it is desirable to be able to compute a lower bound on the objective function at each iteration. This enables the user to stop the iterative process when the objective function is within a prespecified tolerance of the optimum value. In this article we generalize a new bounding method to include multi-facility problems with lp distances. A proof is given that for Euclidean distance problems the new bounding procedure is superior to two other known methods. Numerical results are given for the three methods. 相似文献
649.
George E. Monahan 《海军后勤学研究》1986,33(2):293-307
This article examines the problem of optimally selecting from several unknown rewards when there are given alternative, costly sources of information. The optimal rule, indicating the information to be purchased and the reward to be selected, is specified as a function of the decision maker's prior probabilities regarding the value of each alternative. The rule is surprisingly complex, balancing prior beliefs, the “informativeness” of the relevant information system, and the cost of acquiring information. 相似文献
650.
Lakshman S. Thakur 《海军后勤学研究》1986,33(2):325-358
We implement a solution procedure for general convex separable programs where a series of relatively small piecewise linear programs are solved as opposed to a single large one, and where, based on bound calculations developed in [13] and [14], the ranges of linearization are systematically reduced for successive programs. The procedure inherits ε-convergence to the global optimum in a finite number of steps, but perhaps its most distinct feature is the rigorous way in which ranges containing an optimal solution are reduced from iteration to iteration. This paper describes the procedure, called successive approximation, discusses its convergence, tightness of the bounds, bound-calculation overhead, and its robustness. It presents a computer implementation to demonstrate its effectiveness for general problems and compares it (1) with the more standard separable programming approach and (2) with one of the recent augmented Lagrangian methods [10] included in a comprehensive study of nonlinear programming codes [12]. It seems clear from over 130 cases resulting from 80 distinct problems studied here that significant savings in terms of computational effort can be realized by a judicious use of the procedure, and the ease with which it can be used is appreciably increased by the robustness it shows. Moreover, for most of these problems, the advantage increases as the size, nonlinearity, and the degree of desired accuracy increase. Other important benefits include significantly smaller storage requirements, the ability to estimate the error in the current solution, and to terminate the algorithm as soon as the acceptable level of accuracy has been achieved. Problems requiring up to about 10,000 nonzero elements in their specification and about 45,000 nonzero elements in the generated separable programs resulting from up to 70 original nonlinear variables and 70 nonlinear constraints are included in the computations. 相似文献