全文获取类型
收费全文 | 295篇 |
免费 | 8篇 |
出版年
2021年 | 5篇 |
2019年 | 10篇 |
2018年 | 6篇 |
2017年 | 10篇 |
2016年 | 7篇 |
2014年 | 7篇 |
2013年 | 46篇 |
2011年 | 3篇 |
2010年 | 5篇 |
2009年 | 5篇 |
2008年 | 3篇 |
2006年 | 5篇 |
2005年 | 4篇 |
2004年 | 6篇 |
2003年 | 3篇 |
2002年 | 10篇 |
2001年 | 4篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1998年 | 4篇 |
1997年 | 5篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1993年 | 11篇 |
1992年 | 4篇 |
1991年 | 6篇 |
1989年 | 4篇 |
1988年 | 13篇 |
1987年 | 3篇 |
1986年 | 6篇 |
1985年 | 11篇 |
1984年 | 8篇 |
1983年 | 4篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 7篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 8篇 |
1973年 | 3篇 |
1972年 | 2篇 |
1971年 | 10篇 |
1970年 | 3篇 |
1969年 | 5篇 |
1968年 | 2篇 |
1967年 | 2篇 |
排序方式: 共有303条查询结果,搜索用时 15 毫秒
171.
For more than a decade, multiattribute utility/value theory and multiobjective mathematical programming have offered different approaches to similar problems. Unfortunately, the two areas have developed with little interaction in spite of their common aims. We consider the use of utility/value functions in a mathematical programming framework, and demonstrate that these functions often possess desirable properties from an optimization point of view. We conclude that a hybridization of approaches is more viable than is perhaps commonly assumed. 相似文献
172.
S. P. Lalley 《海军后勤学研究》1988,35(5):441-446
Minimax strategies are obtained for an infiltration game in which one player must move through a one-dimensional interval defended by the other player. 相似文献
173.
A counterexample is given to demonstrate that previously proposed necessary conditions for the bilevel programming problem are not correct. An interpretation of the difficulty is given by appealing to a “theorem of alternative” result presented in the original work. 相似文献
174.
New partial orderings of life distributions are given. The concepts of decreasing mean residual life, new better than used in expectation, harmonic new better than used in expectation, new better than used in failure rate, and new better than used in failure rate average are generalized, so as to compare the aging properties of two arbitrary life distributions. 相似文献
175.
Postmodern terrorism presents a significant challenge to global security and law enforcement institutions. Non-state actors operating across international borders, engaged in an apparent global insurgency of extremism that transects the traditional boundaries of crime and war, pose significant challenges to both intelligence and law enforcement agencies. These networked global insurgents blend political and religious fanaticism with criminal enterprises to challenge the rule of law and pose an epochal shift in the structures and relations among states. Negotiating this epochal shift requires traditional organs of national security (the diplomatic, military and intelligence services) to forge new partnerships with police and public safety organizations at the state and local (sub-national), as well as transnational levels. Significant operational, policy and cultural challenges must be overcome to forge an effective multi-lateral global network to counter global terrorism and insurgency. 相似文献
176.
177.
This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
178.
We present transient and asymptotic reliability indices for a single‐unit system that is subject to Markov‐modulated shocks and wear. The transient results are derived from the (transform) solution of an integro‐differential equation describing the joint distribution of the cumulative degradation process and the state of the modulating process. Additionally, we prove the asymptotic normality of a properly centered and time‐scaled version of the cumulative degradation at time t. This asymptotic result leads to a simple normal approximation for a properly centered and space‐scaled version of the systes lifetime distribution. Two numerical examples illustrate the quality of the normal approximation. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
179.
We address the problem of optimal decision‐making in conflicts based on Lanchester square law attrition model where a defending force needs to be partitioned optimally, and allocated to two different attacking forces of differing strengths and capabilities. We consider a resource allocation scheme called the Time Zero Allocation with Redistribution (TZAR) strategy, where allocation is followed by redistribution of defending forces, on the occurrence of certain decisive events. Unlike previous work on Lanchester attrition model based tactical decision‐making, which propose time sequential tactics through an optimal control approach, the present article focuses on obtaining simpler resource allocation tactics based on a static optimization framework, and demonstrates that the results obtained are similar to those obtained by the more complex dynamic optimal control solution. Complete solution for this strategy is obtained for optimal partitioning of resources of the defending forces. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
180.
We consider a discrete time‐and‐space route‐optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically moving targets. This article formulates a novel convex mixed‐integer nonlinear program for this problem that generalizes earlier models to situations with multiple targets, searcher deconfliction, and target‐ and location‐dependent search effectiveness. We present two solution approaches, one based on the cutting‐plane method and the other on linearization. These approaches result in the first practical exact algorithms for solving this important problem, which arises broadly in military, rescue, law enforcement, and border patrol operations. The cutting‐plane approach solves many realistically sized problem instances in a few minutes, while existing branch‐and‐bound algorithms fail. A specialized cut improves solution time by 50[percnt] in difficult problem instances. The approach based on linearization, which is applicable in important special cases, may further reduce solution time with one or two orders of magnitude. The solution time for the cutting‐plane approach tends to remain constant as the number of searchers grows. In part, then, we overcome the difficulty that earlier solution methods have with many searchers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献