首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   92篇
  免费   1篇
  2021年   1篇
  2020年   1篇
  2019年   4篇
  2018年   1篇
  2017年   6篇
  2016年   5篇
  2014年   1篇
  2013年   20篇
  2011年   1篇
  2010年   2篇
  2009年   1篇
  2007年   1篇
  2006年   2篇
  2005年   1篇
  2004年   3篇
  2003年   1篇
  2002年   5篇
  2000年   1篇
  1998年   2篇
  1994年   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年   2篇
  1968年   1篇
排序方式: 共有93条查询结果,搜索用时 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.
The idea of deploying noncollocated sources and receivers in multistatic sonar networks (MSNs) has emerged as a promising area of opportunity in sonar systems. This article is one of the first to address point coverage problems in MSNs, where a number of points of interest have to be monitored in order to protect them from hostile underwater assets. We consider discrete “definite range” sensors as well as various diffuse sensor models. We make several new contributions. By showing that the convex hull spanned by the targets is guaranteed to contain optimal sensor positions, we are able to limit the solution space. Under a definite range sensor model, we are able to exclude even more suboptimal solutions. We then formulate a nonlinear program and an integer nonlinear program to express the sensor placement problem. To address the nonconvex single‐source placement problem, we develop the Divide Best Sector (DiBS) algorithm, which quickly provides an optimal source position assuming fixed receivers. Starting with a basic implementation of DiBS, we show how incorporating advanced sector splitting methods and termination conditions further improve the algorithm. We also discuss two ways to use DiBS to find multiple source positions by placing sensors iteratively or simultaneously. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 287–304, 2017  相似文献   
33.
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.
We formulate and solve a discrete‐time path‐optimization problem where a single searcher, operating in a discretized three‐dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of one or more resources such as time, fuel, and risk along any path. We develop a specialized branch‐and‐bound algorithm for this problem that uses several network reduction procedures as well as a new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm outperforms a state‐of‐the‐art algorithm for solving time‐constrained problems and also is the first algorithm to solve multi‐constrained problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
38.
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.  相似文献   
39.
40.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号