全文获取类型
收费全文 | 710篇 |
免费 | 20篇 |
出版年
2021年 | 13篇 |
2019年 | 16篇 |
2018年 | 6篇 |
2017年 | 11篇 |
2016年 | 14篇 |
2015年 | 13篇 |
2014年 | 8篇 |
2013年 | 131篇 |
2011年 | 8篇 |
2009年 | 7篇 |
2007年 | 17篇 |
2005年 | 9篇 |
2004年 | 9篇 |
2003年 | 12篇 |
2002年 | 10篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 13篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 13篇 |
1995年 | 8篇 |
1994年 | 14篇 |
1993年 | 16篇 |
1992年 | 12篇 |
1991年 | 16篇 |
1990年 | 13篇 |
1989年 | 22篇 |
1988年 | 23篇 |
1987年 | 13篇 |
1986年 | 21篇 |
1985年 | 11篇 |
1984年 | 6篇 |
1983年 | 6篇 |
1982年 | 17篇 |
1981年 | 9篇 |
1980年 | 11篇 |
1979年 | 12篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1976年 | 7篇 |
1975年 | 9篇 |
1974年 | 17篇 |
1973年 | 10篇 |
1972年 | 8篇 |
1971年 | 17篇 |
1970年 | 8篇 |
1969年 | 11篇 |
1968年 | 9篇 |
1967年 | 9篇 |
排序方式: 共有730条查询结果,搜索用时 15 毫秒
161.
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. 相似文献
162.
A mixed optimization technique for optimal machine replacement is presented which allows much more flexibility than previous models. Optimal purchase, maintenance and sale of a given machine between any two given points in time is treated as a subproblem, which one may choose to solve via control theory, dynamic programming, or practical engineering considerations. (A control theory formulation is used in the paper as an illustration.) These subproblem solutions are then incorporated into a Wagner-Whitin formulation for solution of the full problem. The technique is particularly useful for problems with such asymmetries as an existing initial machine or uneven technological change. A simple numerical example is solved in the Appendix. 相似文献
163.
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. 相似文献
164.
165.
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. 相似文献
166.
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. 相似文献
167.
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. 相似文献
168.
Let , where A (t)/t is nondecreasing in t, {P(k)1/k} is nonincreasing. It is known that H(t) = 1 — H (t) is an increasing failure rate on the average (IFRA) distribution. A proof based on the IFRA closure theorem is given. H(t) is the distribution of life for systems undergoing shocks occurring according to a Poisson process where P (k) is the probability that the system survives k shocks. The proof given herein shows there is an underlying connection between such models and monotone systems of independent components that explains the IFRA life distribution occurring in both models. 相似文献
169.
A. R. Washburn 《海军后勤学研究》1980,27(2):315-322
We consider the problem of searching for a target that moves in discrete time and space according to some Markovian process. At each time, a searcher attempts to detect the target. If the searcher's action at each time is such as to maximize his chances of immediate detection, we call his strategy “myopic.” We provide a computationally useful necessary condition for optimality, and use it to provide an example wherein the myopic strategy is not optimal. 相似文献
170.
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. 相似文献