全文获取类型
收费全文 | 292篇 |
免费 | 9篇 |
国内免费 | 1篇 |
专业分类
302篇 |
出版年
2020年 | 2篇 |
2019年 | 11篇 |
2018年 | 7篇 |
2017年 | 5篇 |
2016年 | 4篇 |
2015年 | 2篇 |
2014年 | 7篇 |
2013年 | 55篇 |
2012年 | 3篇 |
2010年 | 8篇 |
2007年 | 6篇 |
2006年 | 2篇 |
2005年 | 6篇 |
2004年 | 5篇 |
2003年 | 2篇 |
2002年 | 7篇 |
2000年 | 2篇 |
1999年 | 4篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 10篇 |
1993年 | 9篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 9篇 |
1987年 | 3篇 |
1986年 | 6篇 |
1985年 | 7篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1976年 | 4篇 |
1975年 | 5篇 |
1974年 | 3篇 |
1973年 | 5篇 |
1972年 | 4篇 |
1969年 | 2篇 |
1968年 | 6篇 |
1967年 | 2篇 |
1966年 | 3篇 |
1948年 | 2篇 |
排序方式: 共有302条查询结果,搜索用时 0 毫秒
91.
In this paper, we extend the results of Ferguson M. Naval Research Logistics 8 . on an end‐product manufacturer's choice of when to commit to an order quantity from its parts supplier. During the supplier's lead‐time, information arrives about end‐product demand. This information reduces some of the forecast uncertainty. While the supplier must choose its production quantity of parts based on the original forecast, the manufacturer can wait to place its order from the supplier after observing the information update. We find that a manufacturer is sometimes better off with a contract requiring an early commitment to its order quantity, before the supplier commits resources. On the other hand, the supplier sometimes prefers a delayed commitment. The preferences depend upon the amount of demand uncertainty resolved by the information as well as which member of the supply chain sets the exchange price. We also show conditions where demand information updating is detrimental to both the manufacturer and the supplier. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
92.
This paper develops a new model for allocating demand from retailers (or customers) to a set of production/storage facilities. A producer manufactures a product in multiple production facilities, and faces demand from a set of retailers. The objective is to decide which of the production facilities should satisfy each retailer's demand, in order minimize total production, inventory holding, and assignment costs (where the latter may include, for instance, variable production costs and transportation costs). Demand occurs continuously in time at a deterministic rate at each retailer, while each production facility faces fixed‐charge production costs and linear holding costs. We first consider an uncapacitated model, which we generalize to allow for production or storage capacities. We then explore situations with capacity expansion opportunities. Our solution approach employs a column generation procedure, as well as greedy and local improvement heuristic approaches. A broad class of randomly generated test problems demonstrates that these heuristics find high quality solutions for this large‐scale cross‐facility planning problem using a modest amount of computation time. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
93.
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. 相似文献
94.
A mathematical programming approach to identification and optimization of a class of unknown systems
Charles A. Holloway 《海军后勤学研究》1972,19(4):663-679
There exists a class of decision problems for which: (1) models of input-output response functions are not available in a closed-form, functional representation; (2) informational costs associated with learning about the response function are significant. For these problems, combining identification with optimization using mathematical programming is potentially attractive. Three approaches to the identification-optimization problem are proposed: an outer-linearized approximation using relaxation (OLR); an inner-linearized approximation using restriction (ILR); and a sequential combination of inner- and outer-linearized subproblems (SIO). Algorithms based on each approach are developed and computational experience reported. 相似文献
95.
The article attempts to show how network theory may be applied to gain new and better insights into basic economic problems. Starting with a precise definition of what is meant by acting and, in particular, by economic acting, we direct the line of argumentation toward solving the problem of how to aggregate economic decisions. Results indicate that network theory might well prove itself to be a powerful instrument in developing a theory of human behavior much more comprehensive than currently used models. 相似文献
96.
Jeffrey H. Grotte 《海军后勤学研究》1978,25(2):315-322
This paper considers the problem of allocating weapons to achieve targeting objectives while simultaneously minimizing aggregate damage to surrounding nonmilitary facilities, each of which has an upper limit to the damage it is permitted to incur. A model is formulated which assumes only that damage to individual targets or associated facilities does not decrease as the number of allocated weapons increases. An implicit enumeration algorithm, based on that of Lawler and Bell is described that yields optimal integer solutions. An example is presented. 相似文献
97.
A duality theory is developed for mathematical programs with strictly quasi-concave objective functions to be maximized over a convex set. This work broadens the duality theory of Rockafellar and Peterson from concave (convex) functions to quasi-concave (quasi-convex) functions. The theory is closely related to the utility theory in economics. An example from economic planning is examined and the solution to the dual program is shown to have the properties normally associated with market prices. 相似文献
98.
James H. Patterson 《海军后勤学研究》1976,23(1):95-123
Individual characteristics of multiple-constrained resource, project scheduling problems are examined in an attempt to predict the solution obtainable with heuristic methods. Difficulties encountered in performing this type of research are described, and several multiple regression models are developed for predicting heuristic performance. Both single and multiple project data are examined, and results reported demonstrate the efficacy of determining beforehand the method used for problem solution. 相似文献
99.
Charles H. Falkner 《海军后勤学研究》1969,16(3):287-295
A mathematical model is formulated for determining the number of spare components to purchase when components stochastically fail according to a known life distribution function and there is a cost incurred when a component is replaced. Bounds are determined for the optimal inventory which indicate that the inclusion of the replacement cost lowers the optimal inventory. Since these bounds are no easier to calculate than the optimal spares level, the theory is specialized to components with exponentially distributed time to failure. Procedures are given for calculating the optimal spares level, and numerical examples are provided. 相似文献
100.
S. H. Tijs 《海军后勤学研究》1981,28(1):153-156
For the family D, consisting of those zero-sum two-person games which have a value, the value-function on D is characterized by four properties called objectivity, monotony, symmetry and sufficiency. 相似文献