全文获取类型
收费全文 | 666篇 |
免费 | 11篇 |
出版年
2021年 | 5篇 |
2019年 | 14篇 |
2018年 | 16篇 |
2017年 | 15篇 |
2016年 | 17篇 |
2015年 | 11篇 |
2013年 | 159篇 |
2011年 | 5篇 |
2010年 | 8篇 |
2009年 | 5篇 |
2007年 | 6篇 |
2006年 | 7篇 |
2005年 | 15篇 |
2004年 | 8篇 |
2003年 | 9篇 |
2002年 | 7篇 |
2000年 | 11篇 |
1999年 | 9篇 |
1998年 | 6篇 |
1997年 | 13篇 |
1996年 | 14篇 |
1995年 | 6篇 |
1994年 | 13篇 |
1993年 | 11篇 |
1992年 | 10篇 |
1991年 | 16篇 |
1990年 | 10篇 |
1989年 | 14篇 |
1988年 | 7篇 |
1987年 | 17篇 |
1986年 | 12篇 |
1985年 | 12篇 |
1984年 | 11篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1981年 | 9篇 |
1980年 | 10篇 |
1979年 | 9篇 |
1978年 | 11篇 |
1977年 | 9篇 |
1976年 | 11篇 |
1975年 | 8篇 |
1974年 | 14篇 |
1973年 | 8篇 |
1972年 | 11篇 |
1971年 | 15篇 |
1970年 | 5篇 |
1969年 | 8篇 |
1968年 | 7篇 |
1967年 | 4篇 |
排序方式: 共有677条查询结果,搜索用时 16 毫秒
161.
This paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semiinfinite versions of the Fritz John and the Kuhn-Tucker theories, which give only necessary or sufficient conditions for optimality, but not both. 相似文献
162.
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. 相似文献
163.
164.
Suppose x1, x2, … are independently distributed random variables with Pr (xi = 1) = Pr(xi = ?1) = 1/2, and let sn =
165.
166.
Edward A. Silver 《海军后勤学研究》1972,19(2):261-280
In this paper we consider a major assembly composed of two or more subassemblies. The failure of any subassembly causes the major assembly to not function. Every failed subassembly is repaired or replaced. A total investment in stocks of spare components is to be distributed among the various subassemblies and the major assembly so as to provide the best possible customer service. This is a complicated problem: relevant factors are the failure rates, unit costs, and repair times of the various components. For the case of Poisson failures, a heuristic solution is developed which is a compromise between theoretical optimality and practical usefulness. 相似文献
167.
This paper considers a problem of locating new facilities in the plane with respect to existing facilities, the locations of which are known. The problem consists of finding locations of new facilities which will minimize a total cost function which consists of a sum of costs directly proportional to the Euclidian distances among the new facilities, and costs directly proportional to the Euclidian distances between new and existing facilities. It is established that the total cost function has a minimum; necessary conditions for a mimumum are obtained; necessary and sufficient conditions are obtained for the function to be strictly convex (it is always convex); when the problem is “well structured,” it is established that for a minimum cost solution the locations of the new facilities will lie in the convex hull of the locations of the existing facilities. Also, a dual to the problem is obtained and interpreted; necessary and sufficient conditions for optimum solutions to the problem, and to its dual, are developed, as well as complementary slackness conditions. Many of the properties to be presented are motivated by, based on, and extend the results of Kuhn's study of the location problem known as the General Fermat Problem. 相似文献
168.
A discrete time Collection Model is formulated, involving the completion of a touring objective on a network with stochastic node states. Heuristic touring strategies are constructed, there being as yet inadequate analytic results for its optimal solution. Effectiveness of the heuristics is assessed by comparing expected tour times under the heuristics with expected tour times given perfect information. A branch and bound algorithm is presented for computing the perfect information tour times. 相似文献
169.
Suppose a given set of jobs has to be processed on a multi-purpose facility which has various settings or states. There is a choice of states in which to process a job and the cost of processing depends on the state. In addition, there is also a sequence-dependent changeover cost between states. The problem is then to schedule the jobs, and pick an optimum setting for each job, so as to minimize the overall operating costs. A dynamic programming model is developed for obtaining an optimal solution to the problem. The model is then extended using the method of successive approximations with a view to handling large-dimensioned problems. This extension yields good (but not necessarily optimal) solutions at a significant computational saving over the direct dynamic programming approach. 相似文献
170.