全文获取类型
收费全文 | 633篇 |
免费 | 19篇 |
出版年
2021年 | 12篇 |
2019年 | 25篇 |
2018年 | 18篇 |
2017年 | 13篇 |
2016年 | 13篇 |
2015年 | 15篇 |
2014年 | 14篇 |
2013年 | 122篇 |
2009年 | 9篇 |
2007年 | 7篇 |
2006年 | 5篇 |
2005年 | 10篇 |
2004年 | 10篇 |
2003年 | 10篇 |
2002年 | 8篇 |
2001年 | 6篇 |
2000年 | 10篇 |
1999年 | 5篇 |
1998年 | 8篇 |
1997年 | 19篇 |
1996年 | 9篇 |
1995年 | 5篇 |
1994年 | 12篇 |
1993年 | 6篇 |
1992年 | 6篇 |
1991年 | 16篇 |
1990年 | 8篇 |
1989年 | 11篇 |
1988年 | 14篇 |
1987年 | 16篇 |
1986年 | 13篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1983年 | 11篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1980年 | 10篇 |
1979年 | 14篇 |
1978年 | 7篇 |
1977年 | 9篇 |
1976年 | 10篇 |
1975年 | 9篇 |
1974年 | 12篇 |
1973年 | 14篇 |
1972年 | 9篇 |
1971年 | 10篇 |
1970年 | 10篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1967年 | 5篇 |
排序方式: 共有652条查询结果,搜索用时 31 毫秒
161.
A set of edges D called an isolation set, is said to isolate a set of nodes R from an undirected network if every chain between the nodes in R contains at least one edge from the set D. Associated with each edge of the network is a positive cost. The isolation problem is concerned with finding an isolation set such that the sum of its edge costs is a minimum. This paper formulates the problem of determining the minimal cost isolation as a 0–1 integer linear programming problem. An algorithm is presented which applies a branch and bound enumerative scheme to a decomposed linear program whose dual subproblems are minimal cost network flow problems. Computational results are given. The problem is also formulated as a special quadratic assignment problem and an algorithm is presented that finds a local optimal solution. This local solution is used for an initial bound. 相似文献
162.
163.
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. 相似文献
164.
This work is concerned with a particular class of bimatrix games, the set of equilibrium points of which games possess many of the properties of solutions to zero-sum games, including susceptibility to solution by linear programming. Results in a more general setting are also included. Some of the results are believed to constitute interesting potential additions to elementary courses in game theory. 相似文献
165.
The reliability of a serial production line is optimized with respect to the location of a single buffer. The problem was earlier defined and solved by Soyster and Toof for the special case of an even number of machines all having equal probability of failure. In this paper we generalize the results for any number of machines and remove the restriction of identical machine reliabilities. In addition, an analysis of multibuffer systems is presented with a closed form solution for the reliability when both the number of buffers and their capacity is limited. For the general multibuffer system we present an approach for determining system reliability. 相似文献
166.
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. 相似文献
167.
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. 相似文献
168.
M. Mazumdar 《海军后勤学研究》1969,16(2):199-206
This paper obtains the uniformly minimum variance unbiased estimates of two indices of performance of a system which alternates between two states “up” or “down” in accordance with a Markov process. The two indices are (1) operational readiness, which measures the probability that the system will be up when needed; and (2) operational reliability, which measures the probability that the system will be up during the entire time of need. For the purpose of obtaining these estimates, two types of observations are considered: (a) those which reveal only the state of system at isolated time-points, and (b) those which continuously record the duration of the “up” and “down” times of the system. 相似文献
169.
Data on 23 lots of various aircraft programs were gathered. Total engineering man-hours, and information on performance, weight, area, avionics systems, data, and schedule were subjected to least squares analysis. An equation is presented which indicates a relationship between total engineering manhours and a set of seven predictor variables. While the equation derived could only be used with confidence by the manufacturer whose data was analyzed, this article should be looked upon as demonstrating a method of data analysis which others may also find useful, not only for predicting engineering manhours in major aircraft programs, but also in other situations where there is an abundance of possible predictor variables, and the problem is to sort out a meaningful subset of these variables. In order to demonstrate the viability of the formula obtained, comparisons were made with various bid programs. 相似文献
170.
This paper analyzes the problem faced by a field commander who, confronted by an enemy on N battlefields, must determine an interdiction policy for the enemy's logistics system which minimizes the amount of war material flowing through this system per unit time. The resource utilized to achieve this interdiction is subject to constraint. It can be shown that this problem is equivalent to determining the set of arcs Z* to remove subject to constraint from a directed graph G such that the resulting maximal flow is minimized. A branch and bound algorithm for the solution to this problem is described, and a numerical example is provided. 相似文献