全文获取类型
收费全文 | 89篇 |
免费 | 3篇 |
出版年
2021年 | 2篇 |
2017年 | 4篇 |
2015年 | 2篇 |
2013年 | 16篇 |
2011年 | 1篇 |
2010年 | 1篇 |
2008年 | 1篇 |
2007年 | 2篇 |
2006年 | 3篇 |
2004年 | 2篇 |
2002年 | 2篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 4篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1976年 | 5篇 |
1975年 | 5篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1972年 | 3篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有92条查询结果,搜索用时 15 毫秒
71.
A number of results pertaining to preservation of aging properties (IFR, IFRA etc.) under various shock models are available in the literature. Our aim in this paper is to examine in the same spirit, the preservation of unimodality under various shock models. For example, it is proved that in a non-homogeneous Poisson shock model if {pk}K≥0, the sequence of probabilities with which the device fails on the kth shock, is unimodal then under some suitable conditions on the mean value function Λ (t), the corresponding survival function is also unimodal. The other shock models under which the preservation of unimodality is considered in this paper are pure birth shock model and a more general shock model in which shocks occur according to a general counting process. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 952–957, 1999 相似文献
72.
The paper considers the open shop scheduling problem to minimize the make-span, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not allowed, the problem is NP-hard in the strong sense if the number of machines is variable, and is NP-hard in the ordinary sense in the case of two machines. For the latter case we give a heuristic algorithm that runs in linear time and produces a schedule with the makespan that is at most 5/4 times the optimal value. We also show that the two-machine problem in the nonpreemptive case is solvable in pseudopolynomial time by a dynamic programming algorithm, and that the algorithm can be converted into a fully polynomial approximation scheme. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 705–731, 1998 相似文献
73.
V. Venkateswaran 《海军后勤学研究》1991,38(5):679-698
In recent years, much attention has focused on mathematical programming problems with equilibrium constraints. In this article we consider the case where the constraints are complementarity constraints. Problems of this type arise, for instance, in the design of traffic networks. We develop here a descent algorithm for this problem that will converge to a local optimum in a finite number of iterations. The method involves solving a sequence of subproblems that are linear programs. Computational tests comparing our algorithm with the branch-and-bound algorithm in [7] bear out the efficacy of our method. When solving large problems, there is a definite advantage to coupling both methods. A local optimum incumbent provided by our algorithm can significantly reduce the computational effort required by the branch-and-bound algorithm. 相似文献
74.
Derrick V. Frazier 《Defence Studies》2017,17(4):379-397
Multinational Military Exercises (MMEs) are often viewed by states as opportunities to increase interoperability, improve cooperation, and solve common security problems. We argue that in addition to this, MMEs work as tools to shape the shared beliefs of coalition partners surrounding threat. Specifically, MMEs allow multinational forces to identify best practices, consolidate beliefs, and codify behavior through doctrine, typically by means of some institutional process. We examine our argument on MMEs through an analysis of various multinational and coalition partner efforts to identify security threats and cooperate through the development of common doctrine at the strategic, operational, and tactical levels of warfare. Our analysis suggests that the use of MMEs for doctrine development does help to socialize states in terms of identifying common threats and subsequently sharing a process by which to address them. 相似文献
75.
An interactive economic model of military spending is proposed. It is quantified on the basis of cross section data for East Asia. Projections of military spending to the end of the decade suggest that the growth of military spending in the region will decline slightly in the current decade. East Asian military spending can, however, be greatly influenced by the path of Chinese and US military efforts. An expansion of military spending by China could cause neighboring countries to greatly increase their military expenditures. 相似文献
76.
Justin V. Hastings 《The Nonproliferation Review》2013,20(3):429-450
This article uses a geographic approach to examine one aspect of the nuclear black market: the coordinators who bring buyers and sellers together, and transport goods between them. The most important factor in determining the geographical structure of a proliferation network is the network coordinator's access (or lack thereof) to unique state resources. Coordinators with access to state resources and prerogatives can avoid embedding themselves in hostile countries or relying on commercial infrastructure, often leading to territorially diffuse logistical networks. Coordinators without such access are forced to rely on commercial infrastructure and favorable local political, economic, and social conditions, often resulting in territorially centralized logistical networks. This is illustrated through case studies of Abdul Qadeer Khan's supply networks to Pakistan, Libya, and Iran. The article concludes with some observations about the implications of a geographical approach for understanding nuclear proliferation networks. 相似文献
77.
Erdem Eskigun Reha Uzsoy Paul V. Preckel George Beaujon Subramanian Krishnan Jeffrey D. Tew 《海军后勤学研究》2007,54(3):282-300
We present a large‐scale network design model for the outbound supply chain of an automotive company that considers transportation mode selection (road vs. rail) and explicitly models the relationship between lead times and the volume of flow through the nodes of the network. We formulate the problem as a nonlinear zero‐one integer program, reformulate it to obtain a linear integer model, and develop a Lagrangian heuristic for its solution that gives near‐optimal results in reasonable time. We also present scenario analyses that examine the behavior of the supply chain under different parameter settings and the performance of the solution procedures under different experimental conditions. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
78.
Designing Code Division Multiple Access networks includes determining optimal locations of radio towers and assigning customer markets to the towers. In this paper, we describe a deterministic model for tower location and a stochastic model to optimize revenue given a set of constructed towers. We integrate these models in a stochastic integer programming problem with simple recourse that optimizes the location of towers under demand uncertainty. We develop algorithms using Benders' reformulation, and we provide computational results. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
79.
Quantity discounts are considered in the context of the single-period inventory model known as “the newsboy problem.” It is argued that the behavioral implications of the all-units discount schedule are more complex and interesting than the literature has suggested. Consideration of this behavior and the use of marginal analysis lead to a new method for solving this problem that is both conceptually simpler and more efficient than the traditional approach. This marginal-cost solution procedure is described graphically, an algorithm is presented, and an example is used to demonstrate that this solution procedure can be extended easily to handle complex discount schedules, such as some combined (simultaneously applied) purchasing and transportation cost discount schedules. 相似文献
80.
This paper investigates the effect on the optimum solution of a (capacitated) transportation problem when the data of the problem (the rim conditions-i. e., the warehouse supplies and market demands-, the per unit transportation costs and the upper bounds) are continuously varied as a (linear) function of a single parameter. Operators that effect the transformation of optimum solution associated with such data changes, are shown to be a product of basis preserving operators (described in the earlier paper) that operate on a sequence of adjacent basis structures. Algorithms are provided for both rim and cost operators. The paper concludes with a discussion of the economic and managerial interpretations of the operators. 相似文献