全文获取类型
收费全文 | 264篇 |
免费 | 16篇 |
出版年
2021年 | 6篇 |
2020年 | 2篇 |
2019年 | 6篇 |
2018年 | 7篇 |
2017年 | 5篇 |
2016年 | 5篇 |
2015年 | 4篇 |
2014年 | 7篇 |
2013年 | 32篇 |
2011年 | 3篇 |
2010年 | 3篇 |
2009年 | 8篇 |
2008年 | 5篇 |
2006年 | 4篇 |
2005年 | 4篇 |
2004年 | 7篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 3篇 |
1998年 | 3篇 |
1997年 | 9篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 10篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 11篇 |
1987年 | 4篇 |
1986年 | 7篇 |
1985年 | 9篇 |
1984年 | 9篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1974年 | 6篇 |
1972年 | 2篇 |
1971年 | 8篇 |
1970年 | 4篇 |
1969年 | 5篇 |
1967年 | 2篇 |
排序方式: 共有280条查询结果,搜索用时 15 毫秒
131.
P.R. Kumaraswamy 《战略研究杂志》2013,36(4):192-206
The absence of formal diplomatic relations between India and Israel from India's hesitant recognition of Israel in 1950 and the establishment of full relations in January 1992, was the result of a complex interplay between two sets of tensions. The first involved the Arab–Israeli dispute, and India's sympathies with a post-colonial Arab world and with the Non-Aligned Movement; the second involved accommodating Muslim opinion within India. Normalization has proceeded more strongly as the growth of Hindu nationalism has weakened Muslim leverage on Indian foreign policy. 相似文献
132.
133.
We revisit the causal relationship between military spending and unemployment in the G7 countries applying a bootstrap panel causality analysis that accounts for both cross-sectional dependence and for heterogeneity across countries. Using per capita real GDP as a controlled variable, we found a unidirectional causality running from military spending to unemployment for Canada, Japan, and the US, one-way causality running from unemployment to military spending for France and Germany, and bidirectional causality for Italy and the UK. The empirical evidence does not seem to provide consistent results regarding the causal relationship between military spending and unemployment in G7 countries. 相似文献
134.
135.
We study a problem of scheduling products on the same facility, which is motivated by a car paint shop. Items of the same product are identical. Operations on the items are performed sequentially in batches, where each batch is a set of operations on the same product. Some of the produced items are of the required good quality and some items can be defective. Defectiveness of an item is determined by a given simulated function of its product, its preceding product, and the position of its operation in the batch. Defective items are kept in a buffer of a limited capacity, and they are then remanufactured at the same facility. A minimum waiting time exists for any defective item before its remanufacturing can commence. Each product has a sequence independent setup time which precedes its first operation or its operation following an operation of another product. A due date is given for each product such that all items of the same product have the same due date and the objective is to find a schedule which minimizes maximum lateness of product completion times with respect to their due dates. The problem is proved NP‐hard in the strong sense, and a heuristic Group Technology (GT) solution approach is suggested and analyzed. The results justify application of the GT approach to scheduling real car paint shops with buffered rework. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 458–471, 2014 相似文献
136.
Kyle Y. Lin 《海军后勤学研究》2014,61(1):56-65
Two forces engage in a duel, with each force initially consisting of several heterogeneous units. Each unit can be assigned to fire at any opposing unit, but the kill rate depends on the assignment. As the duel proceeds, each force—knowing which units are still alive in real time—decides dynamically how to assign its fire, in order to maximize the probability of wiping out the opposing force before getting wiped out. It has been shown in the literature that an optimal pure strategy exists for this two‐person zero‐sum game, but computing the optimal strategy remained cumbersome because of the game's huge payoff matrix. This article gives an iterative algorithm to compute the optimal strategy without having to enumerate the entire payoff matrix, and offers some insights into the special case, where one force has only one unit. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 56–65, 2014 相似文献
137.
Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014 相似文献
138.
Harold P. Benson 《海军后勤学研究》2004,51(4):467-476
The construction of convex and concave envelopes of real‐valued functions has been of interest in mathematical programming for over 3 decades. Much of this interest stems from the fact that convex and concave envelopes can play important roles in algorithms for solving various discrete and continuous global optimization problems. In this article, we use a simplicial subdivision tool to present and validate the formula for the concave envelope of a monomial function over a rectangle. Potential algorithmic applications of this formula are briefly indicated. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
139.
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. 相似文献
140.
We analyze the moments of the random time required for a vehicle to traverse a transportation network link of arbitrary length when its speed is governed by a random environment. The problem is motivated by stochastic transportation network applications in which the estimation of travel time moments is of great importance. We analyze this random time in a transient and asymptotic sense by employing results from the field of fluid queues. The results are demonstrated on two example problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献