全文获取类型
收费全文 | 565篇 |
免费 | 21篇 |
专业分类
586篇 |
出版年
2021年 | 12篇 |
2019年 | 9篇 |
2018年 | 7篇 |
2017年 | 10篇 |
2016年 | 10篇 |
2015年 | 9篇 |
2014年 | 10篇 |
2013年 | 90篇 |
2011年 | 5篇 |
2009年 | 11篇 |
2007年 | 11篇 |
2005年 | 6篇 |
2004年 | 10篇 |
2003年 | 6篇 |
2002年 | 13篇 |
2001年 | 9篇 |
2000年 | 7篇 |
1999年 | 9篇 |
1998年 | 10篇 |
1997年 | 12篇 |
1996年 | 8篇 |
1995年 | 18篇 |
1994年 | 14篇 |
1993年 | 13篇 |
1992年 | 14篇 |
1991年 | 16篇 |
1990年 | 10篇 |
1989年 | 9篇 |
1988年 | 13篇 |
1987年 | 14篇 |
1986年 | 7篇 |
1985年 | 8篇 |
1984年 | 14篇 |
1983年 | 9篇 |
1982年 | 6篇 |
1981年 | 13篇 |
1980年 | 9篇 |
1979年 | 14篇 |
1978年 | 8篇 |
1977年 | 9篇 |
1976年 | 7篇 |
1975年 | 10篇 |
1974年 | 8篇 |
1973年 | 9篇 |
1972年 | 10篇 |
1971年 | 8篇 |
1970年 | 5篇 |
1969年 | 6篇 |
1968年 | 7篇 |
1967年 | 4篇 |
排序方式: 共有586条查询结果,搜索用时 15 毫秒
1.
This article shows how simple systems of linear equations with {0,1} variables can be aggregated into a single linear equation whose {0,1} solutions are identical to the solutions of the original system. Structures of the original systems are exploited to keep the aggregator's integer coefficients from becoming unnecessarily large. The results have potential application in integer programming and information theory, especially for problems that contain assignment-type constraints along with other constraints. Several unresolved questions of a number-theoretic nature are mentioned at the conclusion of the article. 相似文献
2.
New closure theorems for shock models in reliability theory are presented. If the number of shocks to failure and the times between the arrivals of shocks have probability distributions of phase type, then so has the time to failure. PH-distributions are highly versatile and may be used to model many qualitative features of practical interest. They are also well-suited for algorithmic implementation. The computational aspects of our results are discussed in some detail. 相似文献
3.
We consider the problem of assigning alternatives evaluated on several criteria into ordered categories C1,C2,…,Cp. This problem is known as the multi‐criteria sorting problem and arises in many situations such as classifying countries into different risk levels based on economical and socio‐political criteria, evaluating credit applications of bank customers. We are interested in sorting methods that are grounded on the construction of outranking relations. Among these, the Electre Tri method requires defining multidimensional profiles that represent the “frontier” separating consecutive categories Ch and Ch+1, and assigns an alternative to categories according to how it compares to each of the profiles. The explicit specification of the profiles of consecutive categories can be difficult for decision makers. We develop a new outranking based sorting method that does not require the explicit definition of profiles. We instead require the decision maker to assign a subset of reference alternatives to the categories. To assign the remaining alternatives, each such alternative is compared to reference alternatives, and assigned to categories accordingly. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
4.
An algorithm is given for solving minimum-cost flow problems where the shipping cost over an arc is a convex function of the number of units shipped along that arc. This provides a unified way of looking at many seemingly unrelated problems in different areas. In particular, it is shown how problems associated with electrical networks, with increasing the capacity of a network under a fixed budget, with Laplace equations, and with the Max-Flow Min-Cut Theorem may all be formulated into minimum-cost flow problems in convex-cost networks. 相似文献
5.
Models are formulated for determining continuous review (Q, r) policies for a multiitem inventory subject to constraints. The objective function is the minimization of total time-weighted shortages. The constraints apply to inventory investment and reorder workload. The formulations are thus independent of the normal ordering, holding, and shortage costs. Two models are presented, each representing a convex programming problem. Lagrangian techniques are employed with the first, simplified model in which only the reorder points are optimized. In the second model both the reorder points and the reorder quantities are optimized utilizing penalty function methods. An example problem is solved for each model. The final section deals with the implementation of these models in very large inventory systems. 相似文献
6.
A Student's t-test proposed by Ogawa is considered for the hypothesis Ho: σ=σo against the alternative hypothesis H1: σ ≠ σo, where σ is the scale parameter of the Extremevalue distribution of smallest values with known location parameter μ. The test is based on a few sample quantiles chosen from a large sample so as to give asymptotically maximum power to the test when the number of sample quantiles is fixed. A table which facilitates the computation of the test statistic is given. Several schemes for determining the ranks of the sample quantiles by the optimal spacings are compared and the effect of the bias of the estimate of σ on the test is investigated through a Monte Carlo study. 相似文献
7.
Location of both public and private facilities has become an important consideration in today's society. Progress in solution of location problems has been impeded by difficulty of the fixed charge problem and the lack of an efficient algorithm for large problems. In this paper a method is developed for solving large-scale public location problems. An implicit enumeration scheme with an imbedded transportation algorithm forms the basis of the solution technique. 相似文献
8.
9.
10.
Capacity expansion models typically minimize the discounted cost of acquisition and operation over a given planning horizon. In this article we generalize this idea to one in which a capital supply curve replaces the usual discount rate. A capital supply curve is a means to model financial outlook, investment limits, and risk. We show that when such a curve is included in a capacity expansion model, it will, under certain conditions, provide a less capital intensive solution than one which incorporates a discount rate. In this article, we also provide an algorithm that solves capacity expansion models that incorporate a capital supply curve. The attractive feature of this algorithm is that it provides a means to utilize the “discount rate” models efficiently. Throughout, we give applications in power generation planning and computational experience for this application is also presented. 相似文献