全文获取类型
收费全文 | 96篇 |
免费 | 2篇 |
出版年
2021年 | 2篇 |
2019年 | 6篇 |
2018年 | 1篇 |
2017年 | 8篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 18篇 |
2012年 | 1篇 |
2011年 | 1篇 |
2010年 | 2篇 |
2009年 | 1篇 |
2007年 | 2篇 |
2006年 | 2篇 |
2005年 | 1篇 |
2004年 | 3篇 |
2003年 | 1篇 |
2002年 | 5篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1998年 | 2篇 |
1995年 | 1篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1971年 | 3篇 |
1969年 | 1篇 |
1968年 | 1篇 |
排序方式: 共有98条查询结果,搜索用时 15 毫秒
31.
Competitive imperatives are causing manufacturing firms to consider multiple criteria when designing products. However, current methods to deal with multiple criteria in product design are ad hoc in nature. In this paper we present a systematic procedure to efficiently solve bicriteria product design optimization problems. We first present a modeling framework, the AND/OR tree, which permits a simplified representation of product design optimization problems. We then show how product design optimization problems on AND/OR trees can be framed as network design problems on a special graph—a directed series‐parallel graph. We develop an enumerative solution algorithm for the bicriteria problem that requires as a subroutine the solution of the parametric shortest path problem. Although this parametric problem is hard on general graphs, we show that it is polynomially solvable on the series‐parallel graph. As a result we develop an efficient solution algorithm for the product design optimization problem that does not require the use of complex and expensive linear/integer programming solvers. As a byproduct of the solution algorithm, sensitivity analysis for product design optimization is also efficiently performed under this framework. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 574–592, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10031 相似文献
32.
Consider a stochastic simulation experiment consisting of v independent vector replications consisting of an observation from each of k independent systems. Typical system comparisons are based on mean (long‐run) performance. However, the probability that a system will actually be the best is sometimes more relevant, and can provide a very different perspective than the systems' means. Empirically, we select one system as the best performer (i.e., it wins) on each replication. Each system has an unknown constant probability of winning on any replication and the numbers of wins for the individual systems follow a multinomial distribution. Procedures exist for selecting the system with the largest probability of being the best. This paper addresses the companion problem of estimating the probability that each system will be the best. The maximum likelihood estimators (MLEs) of the multinomial cell probabilities for a set of v vector replications across k systems are well known. We use these same v vector replications to form vk unique vectors (termed pseudo‐replications) that contain one observation from each system and develop estimators based on AVC (All Vector Comparisons). In other words, we compare every observation from each system with every combination of observations from the remaining systems and note the best performer in each pseudo‐replication. AVC provides lower variance estimators of the probability that each system will be the best than the MLEs. We also derive confidence intervals for the AVC point estimators, present a portion of an extensive empirical evaluation and provide a realistic example. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 341–358, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10019 相似文献
33.
Frank O’Donnell 《Contemporary Security Policy》2017,38(1):78-101
India’s nuclear doctrine and posture has traditionally been shaped by minimum deterrence logic. This logic includes assumptions that possession of only a small retaliatory nuclear force generates sufficient deterrent effect against adversaries, and accordingly that development of limited nuclear warfighting concepts and platforms are unnecessary for national security. The recent emergence of Pakistan’s Nasr tactical nuclear missile platform has generated pressures on Indian minimum deterrence. This article analyzes Indian official and strategic elite responses to the Nasr challenge, including policy recommendations and attendant implications. It argues that India should continue to adhere to minimum deterrence, which serves as the most appropriate concept for Indian nuclear policy and best supports broader foreign and security policy objectives. However, the form through which Indian minimum deterrence is delivered must be rethought in light of this new stage of regional nuclear competition. 相似文献
34.
One of the most important issues facing the post‐Cold War U.S. defense establishment concerns the future allocation of combat tasks and responsibilities among different branches of the armed forces. The challenge is to reduce unnecessary redundancy across roles and missions when resources are highly constrained, without compromising military effectiveness. Defining the policy problem as one of resource allocation rather than operational effectiveness, we develop a methodology for allocating roles and missions. Our methodology focuses at the highest level of force aggregation and uses a mathematical programming model to produce cross‐service cross‐mission trade‐offs that will yield the best total force combat and non‐combat potential within resource consumption constraints. 相似文献
35.
36.
37.
The problem dealt with in this article is as follows. There are n “demand points” on a sphere. Each demand point has a weight which is a positive constant. A facility must be located so that the maximum of the weighted distances (distances are the shortest arcs on the surface of the sphere) is minimized; this is called the minimax problem. Alternatively, in the maximin problem, the minimum weighted distance is maximized. A setup cost associated with each demand point may be added for generality. It is shown that any maximin problem can be reparametrized into a minimax problem. A method for finding local minimax points is described and conditions under which these are global are derived. Finally, an efficient algorithm for finding the global minimax point is constructed. 相似文献
38.
39.
In this paper we present some results in parametric studies on several transportation-type problems. Specifically, a characterization is obtained for the optimal values of the variables in the problem of determining an optimal growth path in a logistics system. We also derive an upper bound beyond which the optimal growth path remains the same. The results are then extended to the goal programming model and the prespecified market growth rate problem. 相似文献
40.
In this paper we consider a multiperiod deterministic capacity expansion and shipment planning problem for a single product. The product can be manufactured in several producing regions and is required in a number of markets. The demands for each of the markets are non-decreasing over time and must be met exactly during each time period (i.e., no backlogging or inventorying for future periods is permitted). Each region is assumed to have an initial production capacity, which may be increased at a given cost in any period. The demand in a market can be satisfied by production and shipment from any of the regions. The problem is to find a schedule of capacity expansions for the regions and a schedule of shipments from the regions to the markets so as to minimize the discounted capacity expansion and shipment costs. The problem is formulated as a linear programming model, and solved by an efficient algorithm using the operator theory of parametric programming for the transporation problem. Extensions to the infinite horizon case are also provided. 相似文献