全文获取类型
收费全文 | 304篇 |
免费 | 3篇 |
出版年
2020年 | 2篇 |
2019年 | 9篇 |
2018年 | 10篇 |
2017年 | 11篇 |
2016年 | 12篇 |
2015年 | 8篇 |
2014年 | 11篇 |
2013年 | 80篇 |
2012年 | 3篇 |
2011年 | 5篇 |
2010年 | 5篇 |
2009年 | 6篇 |
2008年 | 6篇 |
2007年 | 4篇 |
2006年 | 6篇 |
2005年 | 7篇 |
2004年 | 5篇 |
2003年 | 8篇 |
2002年 | 6篇 |
2001年 | 2篇 |
1999年 | 2篇 |
1998年 | 6篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 6篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 6篇 |
1985年 | 6篇 |
1984年 | 3篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1974年 | 3篇 |
1973年 | 3篇 |
1972年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1968年 | 1篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有307条查询结果,搜索用时 31 毫秒
21.
Susan B. Martin 《战略研究杂志》2016,39(3):321-364
The role of norms and military utility in the use of weapons is disputed by constructivist and realist scholars. Through an examination of US decision-making regarding anti-plant and irritant agents in the Vietnam War, I advance this debate in three key ways. First, I develop structural realism’s expectations regarding the role of military utility. Second, I demonstrate that social and material factors are at play in our understandings of both ‘norms’ and ‘military utility’, and that both played a role in US decisions. Third, I find that the dominant role – as structural realism expects – was played by military utility. 相似文献
22.
23.
24.
25.
This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network. 相似文献
26.
A basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A number of algorithms have been developed for finding solutions, and this paper reports a comparative evaluation of these procedures. Computer programs for five separate algorithms were written and all were run on a data base designed to highlight computational differences. Optimizing algorithms developed by Emmons and by Srinivasan appeared to be particularly efficient in the comparative study. 相似文献
27.
The hyperbolic integer program is treated as a special case of a hyperbolic program with a finite number of feasible points. The continuous hyperbolic program also belongs to this class since its solution can be obtained by considering only the extreme points of the feasible set. A general algorithm for solving the hyperbolic integer program which reduces to solving a sequence of linear integer problems is proposed. When the integer restriction is removed, this algorithm is similar to the Isbell-Marlow procedure. The geometrical aspects of the hyperbolic problem are also discussed and several cutting plane algorithms are given. 相似文献
28.
Rendezvous search finds the strategies that players should use in order to find one another when they are separated in a region. Previous papers have concentrated on the case where there are two players searching for one another. This paper looks at the problem when there are more than two players and concentrates on what they should do if some but not all of them meet together. It looks at two strategies—the stick together one and the split up and meet again one. This paper shows that the former is optimal among the class of strategies which require no memory and are stationary, and it gives a method of calculating the expected rendezvous time under it. However, simulation results comparing both strategies suggest that in most situations the split up and meet again strategy which requires some memory leads to faster expected rendezvous times. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:710–721, 2001 相似文献
29.
30.
The Federal Aviation Administration (FAA) and the airline community within the United States have adopted a new paradigm for air traffic flow management, called Collaborative Decision Making (CDM). A principal goal of CDM is shared decision‐making responsibility between the FAA and airlines, so as to increase airline control over decisions that involve economic tradeoffs. So far, CDM has primarily led to enhancements in the implementation of Ground Delay Programs, by changing procedures for allocating slots to airlines and exchanging slots between airlines. In this paper, we discuss how these procedures may be formalized through appropriately defined optimization models. In addition, we describe how inter‐airline slot exchanges may be viewed as a bartering process, in which each “round” of bartering requires the solution of an optimization problem. We compare the resulting optimization problem with the current procedure for exchanging slots and discuss possibilities for increased decision‐making capabilities by the airlines. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献