全文获取类型
| 收费全文 | 386篇 |
| 免费 | 0篇 |
专业分类
| 386篇 |
出版年
| 2021年 | 6篇 |
| 2019年 | 8篇 |
| 2018年 | 5篇 |
| 2017年 | 6篇 |
| 2016年 | 5篇 |
| 2015年 | 5篇 |
| 2014年 | 8篇 |
| 2013年 | 78篇 |
| 2012年 | 5篇 |
| 2011年 | 4篇 |
| 2010年 | 5篇 |
| 2009年 | 3篇 |
| 2008年 | 4篇 |
| 2007年 | 4篇 |
| 2006年 | 8篇 |
| 2005年 | 3篇 |
| 2004年 | 4篇 |
| 2003年 | 5篇 |
| 2002年 | 3篇 |
| 2000年 | 4篇 |
| 1998年 | 4篇 |
| 1997年 | 6篇 |
| 1996年 | 8篇 |
| 1994年 | 6篇 |
| 1993年 | 9篇 |
| 1992年 | 6篇 |
| 1991年 | 7篇 |
| 1989年 | 9篇 |
| 1988年 | 9篇 |
| 1987年 | 5篇 |
| 1986年 | 8篇 |
| 1985年 | 10篇 |
| 1984年 | 5篇 |
| 1983年 | 6篇 |
| 1982年 | 7篇 |
| 1981年 | 5篇 |
| 1980年 | 10篇 |
| 1979年 | 7篇 |
| 1978年 | 9篇 |
| 1977年 | 6篇 |
| 1976年 | 8篇 |
| 1975年 | 10篇 |
| 1974年 | 6篇 |
| 1973年 | 9篇 |
| 1972年 | 5篇 |
| 1971年 | 4篇 |
| 1970年 | 6篇 |
| 1969年 | 5篇 |
| 1968年 | 6篇 |
| 1967年 | 3篇 |
排序方式： 共有386条查询结果，搜索用时 15 毫秒
231.
Myerson 3 and 4 proposed and characterized a modification of the Shapley value in the context of communication situations. In this paper we propose several characterizations of the extension of the Banzhaf value proposed by Owen 7 to communication situations. In particular we characterize this value with the properties of fairness, isolation, and pairwise merging. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
232.
233.
234.
With incomplete data the maximum likelihood estimates of the parameters of the Weibull process can only be obtained by solving the likelihood equations iteratively. In this article we show that the solution of the likelihood equations may lie outside of the parameter space if none of the processes can be observed from time zero. 相似文献
235.
In hinterland container transportation the use of barges is getting more and more important. We propose a real‐life operational planning problem model from an inland terminal operating company, in which the number of containers shipped per barge is maximized and the number of terminals visited per barge is minimized. This problem is solved with an integer linear program (ILP), yielding strong cost reductions, about 20%, compared to the method used currently in practice. Besides, we develop a heuristic that solves the ILP in two stages. First, it decides for each barge which terminals to visit and second it assigns containers to the barges. This heuristic produces almost always optimal solutions and otherwise near‐optimal solutions. Moreover, the heuristic runs much faster than the ILP, especially for large‐sized instances. 相似文献
236.
The scope of this paper is to forecast the extent to which a settlement of the Cyprus issue may be possible given the decisions taken during the Copenhagen EU summit. It aims, in addition, at investigating the possibilities of improvement in Greek-Turkish relations which may lead, in turn, to reducing the arms race between the two countries. The paper uses a Genetically Evolved Certainty Neuron Fuzzy Cognitive Map algorithm to consider a number of scenarios examining the possible reactions of all sides involved in the Cyprus issue, namely Greece, Turkey, Cyprus, the Turkish-Cypriot community and the international environment. All simulation exercises suggest that the Greek and the Cypriot side should not necessarily rely on the decisions taken during the Copenhagen summit conference. The forecasts point out, in addition, that the optimism of the Greek government concerning the outlook of its relations with Turkey, and a subsequent reduction of the arms race against it, is far from being justified. 相似文献
237.
A. S. Andreou K. E. Parsopoulos M. N. Vrahatis G. A. Zombanakis 《Defence and Peace Economics》2013,24(4):329-347
The aim of this paper is to indicate the extent to which the arms race against Turkey, in which Greece and Cyprus have been entangled, imposes a defence expenditure burden that is tough for the two allies to bear. To do so we have resorted to evaluating the optimal military expenditure for the two countries, allied in the context of the Integrated Defence Doctrine, which is compatible with the constraints imposed by the resources of their economies. All experiments and scenarios examined lead to the conclusion that the current defence burden of the two allies seems to be driving their economies beyond capacity limits. The fact remains, however, that under the circumstances, a one-sided disarmament policy like the one currently followed by Greece, is a risky choice given that the long-term armament programmes pursued by Turkey, whose role in this arms race has been proven as leading, leave very small room to the Greek and Cypriot sides to reduce their own defence expenditure. 相似文献
238.
The defense establishments of all major powers are changing to reflect changes in the foundations of national security strategy and resource allocation. The authors believe economists should play an active role in formulating these changes and offer an orientation to the U.S. debate, presenting three major alternatives: the “Base Force” (Bush Administration), Mr. Aspin's Force “C,” and the “Low” Alternative (Prof. Kaufmann and Dr. Steinbruner). These alternatives are compared using first‐order measures of capabilities, budgets and risk. Budgetary estimates are based on newly‐developed analytical tools. 相似文献
239.
In this article, we define a scheduling/packing problem called the Job Splitting Problem, motivated by the practices in the printing industry. There are n types of items to be produced on an m‐slot machine. A particular assignment of the types to the slots is called a “run” configuration and requires a setup cost. Once a run begins, the production continues according to that configuration and the “length” of the run represents the quantity produced in each slot during that run. For each unit of production in excess of demand, there is a waste cost. Our goal is to construct a production plan, i.e., a set of runs, such that the total setup and waste cost is minimized. We show that the problem is strongly NP‐hard and propose two integer programming formulations, several preprocessing steps, and two heuristics. We also provide a worst‐case bound for one of the heuristics. Extensive tests on real‐world and randomly generated instances show that the heuristics are both fast and effective, finding near‐optimal solutions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
240.
Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献