全文获取类型
收费全文 | 447篇 |
免费 | 16篇 |
出版年
2021年 | 5篇 |
2020年 | 5篇 |
2019年 | 17篇 |
2018年 | 14篇 |
2017年 | 9篇 |
2016年 | 12篇 |
2015年 | 7篇 |
2014年 | 11篇 |
2013年 | 105篇 |
2011年 | 10篇 |
2010年 | 5篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 8篇 |
2006年 | 5篇 |
2005年 | 8篇 |
2004年 | 5篇 |
2003年 | 5篇 |
2002年 | 10篇 |
2001年 | 7篇 |
2000年 | 4篇 |
1999年 | 5篇 |
1997年 | 8篇 |
1996年 | 5篇 |
1995年 | 5篇 |
1994年 | 9篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 4篇 |
1989年 | 7篇 |
1988年 | 14篇 |
1987年 | 7篇 |
1986年 | 7篇 |
1985年 | 11篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1980年 | 5篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1974年 | 7篇 |
1973年 | 4篇 |
1972年 | 5篇 |
1971年 | 8篇 |
1970年 | 6篇 |
1969年 | 5篇 |
1968年 | 3篇 |
1967年 | 3篇 |
排序方式: 共有463条查询结果,搜索用时 22 毫秒
31.
The present article discusses the properties of the mean residual life function in a renewal process. We examine the relationship this function has with the failure rate function and the conventional mean, variance and coefficient of variation of residual life. We also discuss some monotonicity properties of the mean residual life function. A partial order based on the renewal mean residual function is introduced along with its interrelationship with some existing stochastic orders. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
32.
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 相似文献
33.
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 相似文献
34.
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 相似文献
35.
A learning tabu search for a truck allocation problem with linear and nonlinear cost components
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
The two‐level problem studied in this article consists of optimizing the refueling costs of a fleet of locomotives over a railway network. The goal consists of determining: (1) the number of refueling trucks contracted for each yard (truck assignment problem denoted TAP) and (2) the refueling plan of each locomotive (fuel distribution problem denoted FDP). As the FDP can be solved efficiently with existing methods, the focus is put on the TAP only. In a first version of the problem (denoted (P1)), various linear costs (e.g., fuel, fixed cost associated with each refueling, weekly operating costs of trucks) have to be minimized while satisfying a set of constraints (e.g., limited capacities of the locomotives and the trucks). In contrast with the existing literature on this problem, two types of nonlinear cost components will also be considered, based on the following ideas: (1) if several trucks from the same fuel supplier are contracted for the same yard, the supplier is likely to propose discounted prices for that yard (Problem (P2)); (2) if a train stops too often on its route, a penalty is incurred, which represents the dissatisfaction of the clients (Problem (P3)). Even if exact methods based on a mixed integer linear program formulation are available for (P1), they are not appropriate anymore to tackle (P2) and (P3). Various methods are proposed for the TAP: a descent local search, a tabu search, and a learning tabu search (LTS). The latter is a new type of local search algorithm. It involves a learning process relying on a trail system, and it can be applied to any combinatorial optimization problem. Results are reported and discussed for a large set of instances (for (P1), (P2), and (P3)), and show the good performance of LTS. © 2014 Wiley Periodicals, Inc. 62:32–45, 2015 相似文献
36.
37.
38.
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. 相似文献
39.
This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network. 相似文献
40.
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. 相似文献