全文获取类型
收费全文 | 231篇 |
免费 | 9篇 |
出版年
2021年 | 4篇 |
2019年 | 6篇 |
2018年 | 5篇 |
2017年 | 5篇 |
2016年 | 4篇 |
2014年 | 6篇 |
2013年 | 33篇 |
2011年 | 3篇 |
2010年 | 3篇 |
2009年 | 5篇 |
2008年 | 3篇 |
2007年 | 2篇 |
2006年 | 3篇 |
2005年 | 3篇 |
2004年 | 3篇 |
2003年 | 3篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 3篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 6篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1993年 | 9篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 10篇 |
1987年 | 4篇 |
1986年 | 7篇 |
1985年 | 9篇 |
1984年 | 8篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 2篇 |
1974年 | 6篇 |
1973年 | 2篇 |
1972年 | 2篇 |
1971年 | 7篇 |
1970年 | 3篇 |
1969年 | 4篇 |
1968年 | 3篇 |
1967年 | 2篇 |
排序方式: 共有240条查询结果,搜索用时 15 毫秒
21.
22.
In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
23.
A machine-replacement problem is analyzed in a technological-development environment, in which a new-type machine (built by a new technology) may appear in the future. The solution of the replacement problem depends on purchasing, operating, and resale costs, and on the probability distribution of the market debut of the new technology, and it indicates whether to replace the existing machine now with an available similar type of machine, or to continue to operate the existing machine for at least one more period. A dynamic discounted cost model is presented, and a method is suggested for finding the optimal age for replacement of an existing machine (under rather general conditions of a technological environment). A solution procedure and a numerical example are given. 相似文献
24.
Variations of Hale's channel assignment problem, the L(j, k)‐labeling problem and the radio labeling problem require the assignment of integers to the vertices of a graph G subject to various distance constraints. The λj,k‐number of G and the radio number of G are respectively the minimum span among all L(j, k)‐labelings, and the minimum span plus 1 of all radio labelings of G (defined in the Introduction). In this paper, we establish the λj,k‐number of ∏ K for pairwise relatively prime integers t1 < t2 < … < tq, t1 ≥ 2. We also show the existence of an infinite class of graphs G with radio number |V(G)| for any diameter d(G). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
25.
In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
26.
27.
We consider the integrated problem of optimally maintaining an imperfect, deteriorating sensor and the safety‐critical system it monitors. The sensor's costless observations of the binary state of the system become less informative over time. A costly full inspection may be conducted to perfectly discern the state of the system, after which the system is replaced if it is in the out‐of‐control state. In addition, a full inspection provides the opportunity to replace the sensor. We formulate the problem of adaptively scheduling full inspections and sensor replacements using a partially observable Markov decision process (POMDP) model. The objective is to minimize the total expected discounted costs associated with system operation, full inspection, system replacement, and sensor replacement. We show that the optimal policy has a threshold structure and demonstrate the value of coordinating system and sensor maintenance via numerical examples. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 399–417, 2017 相似文献
28.
This article proposes a strategic reason for a proprietary component supplier to license her technology to a competitor or a manufacturer: her anticipation of the manufacturer's strategic commitment to invest in research and development (R&D). We address this phenomenon with a game theoretic model. Our results show that the manufacturer's full commitment to invest in R&D enables the supplier to license, sell a larger quantity through the supply chain, and charge lower prices. These results are robust to the type of demand uncertainty faced by the manufacturer within the class of increasing generalized failure rate distributions. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 341–350, 2014 相似文献
29.
In many location problems, the solution is constrained to lie within a closed set. In this paper, optimal solutions to a special type of constrained location problem are characterized. In particular, the location problem with the solution constrained to be within a maximum distance of each demand point is considered, and an algorithm for its solution is developed and discussed. 相似文献
30.
Let X1 < X2 <… < Xn denote an ordered sample of size n from a Weibull population with cdf F(x) = 1 - exp (?xp), x > 0. Formulae for computing Cov (Xi, Xj) are well known, but they are difficult to use in practice. A simple approximation to Cov(Xi, Xj) is presented here, and its accuracy is discussed. 相似文献