全文获取类型
收费全文 | 493篇 |
免费 | 14篇 |
出版年
2021年 | 5篇 |
2019年 | 12篇 |
2018年 | 10篇 |
2017年 | 12篇 |
2016年 | 7篇 |
2015年 | 8篇 |
2014年 | 9篇 |
2013年 | 115篇 |
2011年 | 5篇 |
2010年 | 7篇 |
2009年 | 7篇 |
2008年 | 10篇 |
2006年 | 7篇 |
2005年 | 10篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2001年 | 5篇 |
2000年 | 6篇 |
1998年 | 7篇 |
1997年 | 5篇 |
1996年 | 12篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 8篇 |
1992年 | 12篇 |
1991年 | 11篇 |
1990年 | 7篇 |
1989年 | 10篇 |
1988年 | 11篇 |
1987年 | 11篇 |
1986年 | 9篇 |
1985年 | 8篇 |
1984年 | 7篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 8篇 |
1980年 | 14篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 9篇 |
1974年 | 4篇 |
1971年 | 9篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 5篇 |
1966年 | 7篇 |
排序方式: 共有507条查询结果,搜索用时 15 毫秒
151.
A Markovian model is presented for the development of an optimal repair-replacement policy for the situation requiring a decision only at failure. The problem is characterized by the presence of growth which is integrated into the formulation. The model is applied to an actual problem, with data analysis and results given. Substantial savings are indicated. 相似文献
152.
Hanif D. Sherali 《海军后勤学研究》1981,28(3):447-462
In this paper we consider dual angular and angular structured mixed integer programs which arise in some practical applications. For these problems we describe efficient methods for generating a desirable set of Benders' cuts with which one may initialize the partitioning scheme of Benders. Our research is motivated by the computational experience of McDaniel and Devine who have shown that the set of Benders' cuts which are binding at the optimum to the linear relaxation of the mixed integer program, play an important role in determining an optimal mixed integer solution. As incidental results in our development, we provide some useful remarks regarding Benders' and Dantzig-Wolfe's decomposition procedures. The computational experience reported seems to support the expedients recommended in this paper. 相似文献
153.
This paper deals with the problem of scheduling items (tasks, employees, equipment, etc.) over a finite time horizon so as to minimize total cost expenditures while maintaining a predefined separation between certain items. The problem is cyclic, because the same schedule will be repeated over several consecutive time periods of equal length. Thus, requirements are present to maintain the separation of items not only within the individual time periods considered, but also between items in adjoining periods. A special purpose branch-and-bound algorithm is developed to solve this scheduling problem by taking advantage of its cyclic nature. Computational results are given. 相似文献
154.
155.
156.
Ronald D. Fricker 《海军后勤学研究》1998,45(1):1-22
This paper revisits the modeling by Bracken [3] of the Ardennes campaign of World War II using the Lanchester equations. It revises and extends that analysis in a number of ways: (1) It more accurately fits the model parameters using linear regression; (2) it considers the data from the entire campaign; and (3) it adds in air sortie data. In contrast to previous results, it concludes by showing that neither the Lanchester linear or Lanchester square laws fit the data. A new form of the Lanchester equations emerges with a physical interpretation. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 1–22, 1998 相似文献
157.
This article is concerned with the analysis of a squared-Euclidean distance location-allocation problem with balanced transportation constraints, where the costs are directly proportional to distances and the amount shipped. The problem is shown to be equivalent to maximizing a convex quadratic function subject to transportation constraints. A branch-and-bound algorithm is developed that utilizes a specialized, tight, linear programming representation to compute strong upper bounds via a Lagrangian relaxation scheme. These bounds are shown to substantially dominate several other upper bounds that are derived using standard techniques as problem size increases. The special structure of the transportation constraints is used to derive a partitioning scheme, and this structure is further exploited to devise suitable logical tests that tighten the bounds implied by the branching restrictions on the transportation flows. The transportation structure is also used to generate additional cut-set inequalities based on a cycle prevention method which preserves a forest graph for any partial solution. Results of the computational experiments, and a discussion on possible extensions, are also presented. 相似文献
158.
We study the effect of the order of service stations on the departure process in a tandem system with finite buffers and blocking. A reversibility result for a twostation system with various types of blocking mechanisms has been shown before. We show that a similar result holds for a three-station tandem system with no buffers between stations and a so-called communication type of blocking. A general conjecture is stated regarding the reversibility of tandem systems with finite buffers and blocking. © 1992 John Wiley & Sons, Inc. 相似文献
159.
In this article, a quality-control design framework that employs information for the supplier-buyer system is modeled. Significant operational savings may be obtained by using the integrated plans developed under this framework. This is especially true when the cost of a defective is high, and the variable sampling and rework costs are low. Analysis of the interaction of defective, rework, and variable sampling costs reveals that the savings are the result of a shift of control effort from the process-control to the lot-acceptance stage, which is the consequence of tradeoffs involving both stages. The managerial impact of adopting integrated plans is discussed. 相似文献
160.
A procedure for obtaining a facilities scatter diagram within a rectangular boundary is developed using a multifacility location model. This method gives favorable computational results and has the advantage over other scatter diagram methods of being able to accommodate fixed facility locations. Examples illustrate how this method can be used by a designer/analyst either as a one-step algorithm or iteratively to build a layout. 相似文献