全文获取类型
收费全文 | 768篇 |
免费 | 15篇 |
出版年
2019年 | 15篇 |
2017年 | 21篇 |
2016年 | 13篇 |
2015年 | 16篇 |
2014年 | 16篇 |
2013年 | 159篇 |
2012年 | 6篇 |
2011年 | 6篇 |
2010年 | 10篇 |
2009年 | 12篇 |
2008年 | 7篇 |
2007年 | 8篇 |
2006年 | 10篇 |
2005年 | 12篇 |
2004年 | 13篇 |
2003年 | 8篇 |
2002年 | 12篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 12篇 |
1997年 | 6篇 |
1996年 | 11篇 |
1995年 | 8篇 |
1994年 | 18篇 |
1993年 | 16篇 |
1992年 | 11篇 |
1991年 | 18篇 |
1990年 | 10篇 |
1989年 | 17篇 |
1988年 | 20篇 |
1987年 | 20篇 |
1986年 | 21篇 |
1985年 | 17篇 |
1984年 | 9篇 |
1983年 | 10篇 |
1982年 | 15篇 |
1981年 | 9篇 |
1980年 | 10篇 |
1979年 | 11篇 |
1978年 | 13篇 |
1976年 | 9篇 |
1975年 | 8篇 |
1974年 | 12篇 |
1973年 | 12篇 |
1972年 | 13篇 |
1971年 | 10篇 |
1970年 | 12篇 |
1969年 | 10篇 |
1968年 | 9篇 |
1967年 | 8篇 |
排序方式: 共有783条查询结果,搜索用时 15 毫秒
151.
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. 相似文献
152.
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. 相似文献
153.
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. 相似文献
154.
155.
156.
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. 相似文献
157.
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. 相似文献
158.
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). 相似文献
159.
A general class of continuous time nonlinear problems is considered. Necessary and sufficient conditions for the existence of solutions are established and optimal solutions are characterized in terms of a duality theorem. The theory is illustrated by means of an example. 相似文献
160.
Mary W. Cooper 《海军后勤学研究》1980,27(1):89-95
This paper presents an application of a method for finding the global solution to a problem in integers with a separable objective function of a very general form. This report shows that there is a relationship between an integer problem with a separable nonlinear objective function and many constraints and a series of nonlinear problems with only a single constraint, each of which can be solved sequentially using dynamic programming. The first solution to any of the individual smaller problems that satisfies the original constraints in addition, will be the optimal solution to the multiply-constrained problem. 相似文献