全文获取类型
收费全文 | 58篇 |
免费 | 9篇 |
出版年
2021年 | 3篇 |
2019年 | 1篇 |
2018年 | 2篇 |
2016年 | 1篇 |
2015年 | 3篇 |
2014年 | 3篇 |
2013年 | 2篇 |
2012年 | 1篇 |
2011年 | 1篇 |
2009年 | 4篇 |
2008年 | 3篇 |
2006年 | 1篇 |
2005年 | 1篇 |
2004年 | 5篇 |
2003年 | 3篇 |
2002年 | 1篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1997年 | 4篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1981年 | 1篇 |
1978年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有67条查询结果,搜索用时 31 毫秒
31.
Kyle Y. Lin 《海军后勤学研究》2004,51(4):501-521
Consider a sequential dynamic pricing model where a seller sells a given stock to a random number of customers. Arriving one at a time, each customer will purchase one item if the product price is lower than her personal reservation price. The seller's objective is to post a potentially different price for each customer in order to maximize the expected total revenue. We formulate the seller's problem as a stochastic dynamic programming model, and develop an algorithm to compute the optimal policy. We then apply the results from this sequential dynamic pricing model to the case where customers arrive according to a continuous‐time point process. In particular, we derive tight bounds for the optimal expected revenue, and develop an asymptotically optimal heuristic policy. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
32.
In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
33.
Andrej Y U. Garnaev 《海军后勤学研究》1993,40(5):745-753
The article considers a two-person zero-sum game in which the movement of the players is constrained to integer points …, −1, 0, 1, … of a line L. Initially the searcher (hider) is at point x = 0 (x = d, d > 0). The searcher and the hider perform simple motion on L with maximum speeds w and u, respectively, where w > u > 0. Each of the players knows the other's initial position but not the other's subsequent positions. The searcher has a bomb which he can drop at any time during his search. Between the dropping of the bomb and the bomb exploding there is a T time lag. If the bomb explodes at point i and the hider is at point i − 1, or i, or i + 1, then the destruction probability is equal to P, or 1, or P, respectively, where 0 < P < 1. d, w, u, and T are integer constants. The searcher can drop the bomb at integer moments of time t = 0, 1, … . The aim of the searcher is to maximize the probability of the destruction of the hider. © 1993 John Wiley & Sons, Inc. 相似文献
34.
The paper considers the economic lot scheduling problem (ELSP) where production facility is assumed to deteriorate, owing to aging, with an increasing failure rate. The time to shift from an “in‐control” state to an “out‐of‐control” state is assumed to be normally distributed. The system is scheduled to be inspected at the end of each production lot. If the process is found to be in an “out‐of‐control” state, then corrective maintenance is performed to restore it to an “in‐control” state before the start of the next production run. Otherwise, preventive maintenance is carried out to enhance system reliability. The ELSP is formulated under the capacity constraint taking into account the quality related cost due to possible production of non‐conforming items, process inspection, and maintenance costs. In order to find a feasible production schedule, both the common cycle and time‐varying lot sizes approaches are utilized. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 650–661, 2003 相似文献
35.
We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
36.
Rachel Carr Jonathon Coleman Mikhail Danilov Giorgio Gratta Karsten Heeger Patrick Huber 《Science & Global Security》2019,27(1):15-28
We present neutrino-based options for verifying that the nuclear reactors at North Korea’s Yongbyon Nuclear Research Center are no longer operating or that they are operating in an agreed manner, precluding weapons production. Neutrino detectors may be a mutually agreeable complement to traditional verification protocols because they do not require access inside reactor buildings, could be installed collaboratively, and provide persistent and specific observations. At Yongbyon, neutrino detectors could passively verify reactor shutdowns or monitor power levels and plutonium contents, all from outside the reactor buildings. The monitoring options presented here build on recent successes in basic particle physics. Following a dedicated design study, these tools could be deployed in as little as one year at a reasonable cost. In North Korea, cooperative deployment of neutrino detectors could help redirect a limited number of scientists and engineers from military applications to peaceful technical work in an international community. Opportunities for scientific collaboration with South Korea are especially strong. We encourage policymakers to consider collaborative neutrino projects within a broader program of action toward stability and security on the Korean Peninsula. 相似文献
37.
We introduce the notion of comparison of the criticality of two nodes in a coherent system, and devlop a monotonicity property of the reliability function under component pairwise rearrangement. We use this property to find the optimal component arrangement. Worked examples illustrate the methods proposed. 相似文献
38.
Hazard rate processes are discussed in the context of doubly stochastic Poisson processes. We derive an explicit expression for the reliability function corresponding to an increasing hazard rate processes with independent increments. Also, bounds are obtained for the reliability function of a system with a general hazard rate process. 相似文献
39.
The shortest path problem between two specified nodes in a general network possesses the unimodularity property and, therefore, can be solved by efficient labelling algorithms. However, the introduction of an additional linear constraint would, in general, destroy this property and the existing algorithms are not applicable in this case. This paper presents a parametric approach for solving this problem. The algorithm presented would require, on the average, a number of iterations which is polynomially bounded. The similarity of this approach to that of the generalized Lagrange multiplier technique is demonstrated and a numerical example is presented. 相似文献
40.
Mikhail Tsypkin 《Defense & Security Analysis》2012,28(1):55-64
Russia has sharply objected to US plans for ballistic missile defense. The Russian official explanation is that the real purpose of the US missile defense plan is to make it impossible for Russia to retaliate against a US nuclear (or massive conventional) attack, thus making Russia subject to military blackmail by the US. The Russian response has been the result of a sum total of various factors, mostly political and cultural, while the technical capabilities of the proposed system have played a secondary role. 相似文献