全文获取类型
收费全文 | 979篇 |
免费 | 24篇 |
出版年
2021年 | 16篇 |
2019年 | 31篇 |
2018年 | 14篇 |
2017年 | 26篇 |
2016年 | 21篇 |
2015年 | 24篇 |
2014年 | 23篇 |
2013年 | 197篇 |
2011年 | 8篇 |
2010年 | 9篇 |
2009年 | 14篇 |
2007年 | 11篇 |
2006年 | 11篇 |
2005年 | 16篇 |
2004年 | 18篇 |
2003年 | 10篇 |
2002年 | 14篇 |
2000年 | 12篇 |
1999年 | 10篇 |
1998年 | 18篇 |
1997年 | 20篇 |
1996年 | 15篇 |
1994年 | 23篇 |
1993年 | 15篇 |
1992年 | 12篇 |
1991年 | 23篇 |
1990年 | 11篇 |
1989年 | 19篇 |
1988年 | 20篇 |
1987年 | 24篇 |
1986年 | 23篇 |
1985年 | 17篇 |
1984年 | 13篇 |
1983年 | 14篇 |
1982年 | 13篇 |
1981年 | 12篇 |
1980年 | 11篇 |
1979年 | 17篇 |
1978年 | 17篇 |
1977年 | 10篇 |
1976年 | 14篇 |
1975年 | 12篇 |
1974年 | 14篇 |
1973年 | 17篇 |
1972年 | 13篇 |
1971年 | 9篇 |
1970年 | 15篇 |
1969年 | 12篇 |
1968年 | 9篇 |
1967年 | 11篇 |
排序方式: 共有1003条查询结果,搜索用时 0 毫秒
221.
The problem of determining multicommodity flows over a capacitated network subject to resource constraints may be solved by linear programming; however, the number of potential vectors in most applications is such that the standard arc-chain formulation becomes impractical. This paper describes an approach—an extension of the column generation technique used in the multicommodity network flow problem—that simultaneously considers network chain selection and resource allocation, thus making the problem both manageable and optimal. The flow attained is constrained by resource availability and network capacity. A minimum-cost formulation is described and an extension to permit the substitution of resources is developed. Computational experience with the model is discussed. 相似文献
222.
J. P. Evans 《海军后勤学研究》1970,17(3):281-286
In this paper we examine the relationship between two constraint qualifications developed by Abadie and Arrow, Hurwicz, and Uzawa. A third constraint qualification is discussed and shown to be weaker than either of those mentioned above. 相似文献
223.
224.
225.
An implicit enumeration algorithm is developed to determine the set of efficient points in zero-one multiple criteria problems. The algorithm is specialized for the solution of a particular class of facility location problems. The procedure is complemented with the use of the utility function of the decision maker to identify a subset of efficient point candidates for the final selection. Computational results are provided and discussed. 相似文献
226.
This paper describes the background of the Office of Management Budget Circular A-21, “Principles for Determining Costs Applicable to Grants, Contracts, and Other Agreements with Educational Institutions,” that describes the requirement for effort reporting. A sampling procedure is proposed as an alternative to 100% reporting. 相似文献
227.
Philip J. Boland 《海军后勤学研究》1982,29(4):541-546
A policy of periodic replacement with minimal repair at failure is considered for a complex system. Under such a policy the system is replaced at multiples of some period T while minimal repair is performed at any intervening system failures. The cost of a minimal repair to the system is assumed to be a nonde-creasing function of its age. A simple expression is derived for the expected minimal repair cost in an interval in terms of the cost function and the failure rate of the system. Necessary and sufficient conditions for the existence of an optimal replacement interval are exhibited in the case where the system life distribution is strictly increasing failure rate (IFR). 相似文献
228.
Averill M. Law 《海军后勤学研究》1980,27(1):131-143
In this paper we precisely define the two types of simulations (terminating and steady-state) with regard to analysis of simulation output and discuss some common measures of performance for each type. In addition, we conclude, on the basis of discussions with many simulation practitioners, that both types of simulations are important in practice. This is contrary to the impression one gets from reading the simulation literature, where the steady-state case is almost exclusively considered. Although analyses of terminating simulations are considerably easier than are those of steady-state simulations, they have not received a careful treatment in the literature. We discuss and give empirical results for fixed sample size, relative width, and absolute width procedures that can be used for constructing confidence intervals for measures of performance in the terminating case. 相似文献
229.
This note consists of developing a method for enforcing additional constraints to linear fractional programs and showing its usefulness in solving integer linear fractional programs. 相似文献
230.
John J. Jarvis 《海军后勤学研究》1969,16(4):525-529
The purpose of this article is to formulate the multi-commodity maximal flow problem into a node-arc form and to show that when decomposition is applied to this form the resulting master and subproblems become precisely those described by Ford & Fulkerson [3] using the arc-chain formulation. A generalization to the problem is then considered which can potentially speed its convergence. 相似文献