全文获取类型
收费全文 | 237篇 |
免费 | 3篇 |
出版年
2021年 | 3篇 |
2019年 | 3篇 |
2017年 | 4篇 |
2016年 | 3篇 |
2015年 | 5篇 |
2014年 | 3篇 |
2013年 | 63篇 |
2011年 | 3篇 |
2010年 | 2篇 |
2008年 | 3篇 |
2007年 | 3篇 |
2006年 | 2篇 |
2005年 | 4篇 |
2004年 | 2篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1996年 | 4篇 |
1995年 | 5篇 |
1994年 | 5篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 7篇 |
1985年 | 5篇 |
1984年 | 1篇 |
1983年 | 3篇 |
1982年 | 8篇 |
1981年 | 1篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1977年 | 4篇 |
1976年 | 2篇 |
1975年 | 5篇 |
1974年 | 5篇 |
1973年 | 6篇 |
1972年 | 5篇 |
1971年 | 9篇 |
1970年 | 3篇 |
1969年 | 5篇 |
1968年 | 5篇 |
1967年 | 4篇 |
1966年 | 2篇 |
1948年 | 3篇 |
排序方式: 共有240条查询结果,搜索用时 15 毫秒
41.
The use of a single vendor for each inventoried item is usually assumed in most of the inventory models. However, there are situations where the use of more than one vendor should be considered, especially when lead times are stochastic. This research presents a theoretical investigation of the effect of cost structures on the relative performance of sole-sourcing versus dual-sourcing inventory control policies. We show that except for cases where the ordering cost is high, the lead-time variability is low, or the customer service level is low, dual sourcing performs better than sole sourcing under the normally distributed demand and shifted-exponential lead times. Moreover, the computational results indicate the dual sourcing provides a better service level than sole sourcing at the optimal solutions, and that dual sourcing results in larger order quantities than sole sourcing, which suggests that attractive quantity discounts may not be in jeopardy when dual sourcing is employed. Finally, because it is generally known that multiple sourcing can enhance the competition among suppliers, material managers should consider splitting purchase orders when two equally qualified suppliers are available. © 1994 John Wiley & Sons, Inc. 相似文献
42.
We present variants of a convergent Lagrangean relaxation algorithm for minimizing a strictly convex separable quadratic function over a transportation polytope. The algorithm alternately solves two “subproblems,” each of which has an objective function that is defined by using Lagrange multipliers derived from the other. Motivated by the natural separation of the subproblems into independent and very easily solved “subsubproblems,” the algorithm can be interpreted as the cyclic coordinate ascent method applied to the dual problem. We exhibit our computational results for different implementations of the algorithm applied to a set of large constrained matrix problems. 相似文献
43.
44.
In this paper a model is developed for determining optimal strategies for two competing firms which are about to submit sealed tender bids on K contracts. A contract calls for the winning firm to supply a specific amount of a commodity at the bid price. By the same token, the production of that commodity involves various amounts of N different resources which each firm possesses in limited quantities. It is assumed that the same two firms bid on each contract and that each wants to determine a bidding strategy which will maximize its profits subject to the constraint that the firm must be able to produce the amount of products required to meet the contracts it wins. This bidding model is formulated as a sequence of bimatrix games coupled together by N resource constraints. Since the firms' strategy spaces are intertwined, the usual quadratic programming methods cannot be used to determine equilibrium strategies. In lieu of this a number of theorems are given which partially characterize such strategies. For the single resource problem techniques are developed for determining equilibrium strategies. In the multiple resource problem similar methods yield subequilibrium strategies or strategies that are equilibrium from at least one firm's point of view. 相似文献
45.
This paper presents the details for applying and specializing the work of Ellis Johnson [10] and [11] to develop a primal code for the well-known capacitated transportation problem. The code was developed directly from the work of Johnson, but is similar to codes developed by Glover, Karney, Klingman, and Napier [6] and Srinivasan and Thompson [14]. The emphasis in the presentation is the use of the graphical representation of the basis to carry out the revised simplex operations. This is a means of exploiting the special structure and sparseness of the constraint matrix to minimize computational effort and storage requirements. We also present the results of solving several large problems with the code developed. 相似文献
46.
This paper gives bounds on the availability function for an alternating renewal process with exponential failure and general repair times. A bound on the error is also given. Several of the bounds with greatest practical consequence are worked out and illustrated. Repair distributions for which a lower bound on availability is easily computed are gamma (integer shape parameter), log normal, and Weibull. Finally, some simulation results for log normal repair versus gamma repair are given. 相似文献
47.
W. L. Wilkinson 《海军后勤学研究》1973,20(3):505-516
This paper presents an algorithm for determining the upper and lower bounds for arc flows in a maximal dynamic flow solution. The procedure is basically an extended application of the Ford-Fulkerson dynamic flow algorithm which also solves the minimal cost flow problem. A simple example is included. The presence of bounded optimal are flows entertains the notion that one can pick a particular solution which is preferable by secondary criteria. 相似文献
48.
In this paper a very versatile game model is developed for use in the long range planning of our strategic force posture. This highly aggregate model yields optimal force mixes for the triad (land- and sea-based missile systems and bombers) under a variety of constraints. The model described here is a survivability model; however, it is shown how the model can still be used as a measure of overall system effectiveness. Constraints imposed on the problem include both SALT and budget limitations. 相似文献
49.
Manfred W. Padberg 《海军后勤学研究》1972,19(4):699-708
In this paper we show that every bounded integer linear program can be transformed into an integer program involving one single linear constraint and upper and lower bounds on the variables, such that the solution space of the original problem coincides with that one of the equivalent knapsack-type problem. 相似文献
50.
The problem of assigning computer program modules to functionally similar processors in a distributed computer network is investigated. The modules of a program must be assigned among processors in such a way as to minimize interprocessor communication while taking advantage of affinities of certain modules to particular processors. This problem is formulated as a zero-one quadratic programming problem, but is more conveniently modeled as a directed acyclic search graph. The model is developed and a backward shortest path labeling algorithm is given that produces an assignment of program modules to processors. A non-backtracking branch-and-bound algorithm is described that uses a local neighborhood search at each stage of the search graph. 相似文献