全文获取类型
收费全文 | 167篇 |
免费 | 2篇 |
出版年
2020年 | 3篇 |
2019年 | 6篇 |
2018年 | 8篇 |
2017年 | 5篇 |
2016年 | 5篇 |
2015年 | 5篇 |
2014年 | 3篇 |
2013年 | 60篇 |
2012年 | 2篇 |
2010年 | 1篇 |
2009年 | 1篇 |
2008年 | 3篇 |
2007年 | 1篇 |
2006年 | 2篇 |
2005年 | 1篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 4篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 3篇 |
1980年 | 2篇 |
1975年 | 2篇 |
1973年 | 2篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1968年 | 2篇 |
1966年 | 1篇 |
排序方式: 共有169条查询结果,搜索用时 0 毫秒
51.
The rise of China has been fuelled by a massive military modernisation programme relying, in large part, on the acquisition of foreign military equipment. The question of how the world’s major powers define their arms transfer policies towards China is therefore crucially important. This article makes two original contributions. First, drawing on neoclassical realism, it proposes an explanatory framework integrating international and domestic factors to explain variations in major powers’ arms transfers. Second, based on a large body of elite interviews and diplomatic cables, it offers the first comprehensive comparison of American, British, French and Russian arms transfer policies towards China since the end of the Cold War. 相似文献
52.
53.
This paper investigates the multivariate Polya distribution (MPD) for application in combat models for which enemy targets must be randomly assigned to fighting units. Six sets of actual combat data motivate the allocation model. Scenarios include air‐to‐air combat, tank, and submarine warfare. Goodness of fit tests are derived which verify the validity of the MPD, and reinforce the notion that multinomial allocation is too simplistic for such combat models. Simulations to determine optimal allocations for minimal combat cost are applied in order to illustrate the role of the MPD in combat modeling. © 2001 John Wiley & Sons,Inc. Naval Research Logistics 48: 1–17, 2001 相似文献
54.
A procedure for obtaining a facilities scatter diagram within a rectangular boundary is developed using a multifacility location model. This method gives favorable computational results and has the advantage over other scatter diagram methods of being able to accommodate fixed facility locations. Examples illustrate how this method can be used by a designer/analyst either as a one-step algorithm or iteratively to build a layout. 相似文献
55.
The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
56.
57.
58.
Paul Zipkin 《海军后勤学研究》1982,29(2):257-270
Transportation problems with uncertain demands are useful applied models themselves, and also they represent in a formal way the problem of estimating demands for use in deterministic models. We consider the effects of using a small, aggregate model of this type in place of a larger, more detailed one. Formulation of the aggregate objective function turns out to depend on how one chooses to use (disaggregate) the solution; several alternative methods are examined. Bounds are derived on the error induced by the approximation, thus facilitating comparison of alternative aggregations. We also consider the problem of estimating demands for an aggregate-level deterministic problem. In a specific sense, it is often not the case (as one might expect) that such aggregate demands are easier to estimate than the detailed demands. This is because aggregation and centralization are not the same thing. 相似文献
59.
60.
We consider the scheduling of n jobs on m identical machines when the jobs become available for processing at ready times ai, ai, ? 0, require di time units for processing and must be completed by times bi for i = 1, 2, … n. The objective chosen is that of minimizing the total elapsed time to complete all jobs subject to the ready time and due date constraints, preemption is not allowed. We present a multi-stage solution algorithm for this problem that is based on an implicit enumeration procedure and also uses the labelling type algorithm which solves the problem when preemption is allowed. 相似文献