全文获取类型
收费全文 | 653篇 |
免费 | 13篇 |
出版年
2021年 | 7篇 |
2020年 | 6篇 |
2019年 | 10篇 |
2018年 | 5篇 |
2017年 | 15篇 |
2016年 | 14篇 |
2015年 | 9篇 |
2014年 | 13篇 |
2013年 | 85篇 |
2012年 | 22篇 |
2011年 | 28篇 |
2010年 | 24篇 |
2009年 | 17篇 |
2008年 | 30篇 |
2007年 | 14篇 |
2006年 | 18篇 |
2005年 | 8篇 |
2004年 | 6篇 |
2002年 | 9篇 |
2001年 | 7篇 |
1999年 | 4篇 |
1998年 | 8篇 |
1997年 | 10篇 |
1995年 | 6篇 |
1994年 | 6篇 |
1993年 | 18篇 |
1992年 | 10篇 |
1991年 | 9篇 |
1989年 | 15篇 |
1988年 | 13篇 |
1987年 | 12篇 |
1986年 | 16篇 |
1985年 | 16篇 |
1984年 | 9篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 9篇 |
1980年 | 14篇 |
1979年 | 14篇 |
1978年 | 8篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 7篇 |
1974年 | 8篇 |
1972年 | 14篇 |
1971年 | 10篇 |
1970年 | 6篇 |
1969年 | 12篇 |
1968年 | 8篇 |
1966年 | 4篇 |
排序方式: 共有666条查询结果,搜索用时 15 毫秒
131.
During the course of the last few years, attacks on the traveling salesman problem have resulted in a variety of often innovative and rather powerful computational procedures. In this article, we present a review of these results for problems defined on weighted and unweighted graphs. Some account of computational behavior for exact algorithms is provided; however, the primary coverage deals with the strategy of particular procedures. In addition, we include some aspects of nonexact algorithms with major interest confined to the establishment of worst-case bounds. 相似文献
132.
In this paper a model is developed for determining optimal strategies for two competing firms which are about to submit sealed tender bids on K contracts. A contract calls for the winning firm to supply a specific amount of a commodity at the bid price. By the same token, the production of that commodity involves various amounts of N different resources which each firm possesses in limited quantities. It is assumed that the same two firms bid on each contract and that each wants to determine a bidding strategy which will maximize its profits subject to the constraint that the firm must be able to produce the amount of products required to meet the contracts it wins. This bidding model is formulated as a sequence of bimatrix games coupled together by N resource constraints. Since the firms' strategy spaces are intertwined, the usual quadratic programming methods cannot be used to determine equilibrium strategies. In lieu of this a number of theorems are given which partially characterize such strategies. For the single resource problem techniques are developed for determining equilibrium strategies. In the multiple resource problem similar methods yield subequilibrium strategies or strategies that are equilibrium from at least one firm's point of view. 相似文献
133.
This paper investigates the effect of the optimal solution of a (capacitated) generalized transportation problem when the data of the problem (the rim conditions—i.e., the available time of machine types and demands of product types, the per unit production costs, the per unit production time and the upper bounds) are continuously varied as a linear function of a single parameter. Operators that effect the transformation of optimal solution associated with such data changes, are shown to be a product of basis preserving operators (described in our earlier papers) that operate on a sequence of adjacent basis structures. Algorithms are furnished for the three types of operators—rim, cost, and weight. The paper concludes with a discussion of the production and managerial interpretations of the operators and a comment on the “production paradox”. 相似文献
134.
This paper considers the problem of computing, by iterative methods, optimal policies for Markov decision processes. The policies computed are optimal for all sufficiently small interest rates. 相似文献
135.
136.
The design of a system with many locations, each with many items which may fail while in use, is considered. When items fail, they require repair; the particular type of repair being governed by a probability distribution. As repairs may be lengthy, spares are kept on hand to replace failed items. System ineffectiveness is measured by expected weighted shortages over all items and locations, in steady state. This can be reduced by either having more spares or shorter expected repair times. Design consists of a provisioning of the number of spares for each item, by location; and specifying the expected repair times for each type of repair, by item and location. The optimal design minimizes expected shortages within a budget constraint, which covers both (i) procurement of spares and (ii) procurement of equipment and manning levels for the repair facilities. All costs are assumed to be separable so that a Lagrangian approach is fruitful, yielding an implementable algorithm with outputs useful for sensitivity analysis. A numerical example is presented. 相似文献
137.
W. L. Wilkinson 《海军后勤学研究》1973,20(3):505-516
This paper presents an algorithm for determining the upper and lower bounds for arc flows in a maximal dynamic flow solution. The procedure is basically an extended application of the Ford-Fulkerson dynamic flow algorithm which also solves the minimal cost flow problem. A simple example is included. The presence of bounded optimal are flows entertains the notion that one can pick a particular solution which is preferable by secondary criteria. 相似文献
138.
The literature on maintenance models is surveyed. The focus is on work appearing since the 1965 survey, “Maintenance Policies for Stochastically Failing Equipment: A Survey” by John McCall and the 1965 book, The Mathematical Theory of Reliability, by Richard Barlow and Frank Proschan. The survey includes models which involve an optimal decision to procure, inspect, and repair and/or replace a unit subject to deterioration in service. 相似文献
139.
The problem of selecting materials, their thicknesses and order for armor designed for the defeat of shaped charge threats, has been formulated as a constrained optimization problem. The mathematical model provides an optimal order and thickness of each layer of material such that the resulting armor configuration will be of minimum mass per unit area subject to constraints on total thickness and shaped charge jet tip exit velocity. 相似文献
140.
This paper develops bounds on the uncertainties in system availabilities or reliabilities which have been computed from structural (series, parallel, etc.) relations among uncertain subsystem availabilities or reliabilities. It is assumed that the highly available (reliable) subsystems have been tested or simulated to determine their unavailabilities (unreliabilities) to within some small percentages of uncertainty. It is shown that series, parallel and r out of n structures which are nominally highly available will have unavailability uncertainties whose percentages errors are of the same order as the subsystem uncertainties. Thus overall system analysis errors, even for large systems, are of the same order of magnitude as the uncertainties in the component probabilities. Both systematic (bias type) uncertainties and independent random uncertainties are considered. 相似文献