全文获取类型
收费全文 | 303篇 |
免费 | 13篇 |
国内免费 | 1篇 |
出版年
2021年 | 4篇 |
2019年 | 11篇 |
2018年 | 7篇 |
2017年 | 6篇 |
2016年 | 6篇 |
2015年 | 4篇 |
2014年 | 7篇 |
2013年 | 48篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 7篇 |
2007年 | 8篇 |
2006年 | 4篇 |
2005年 | 8篇 |
2004年 | 6篇 |
2003年 | 3篇 |
2002年 | 10篇 |
2001年 | 5篇 |
2000年 | 3篇 |
1999年 | 8篇 |
1998年 | 8篇 |
1997年 | 8篇 |
1996年 | 4篇 |
1994年 | 8篇 |
1993年 | 10篇 |
1992年 | 5篇 |
1991年 | 7篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 9篇 |
1987年 | 3篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1974年 | 3篇 |
1973年 | 4篇 |
1972年 | 3篇 |
1969年 | 2篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 3篇 |
1948年 | 2篇 |
排序方式: 共有317条查询结果,搜索用时 15 毫秒
231.
Charles H. Reilly Clark A. Mount-Campbell Fernando Mata Eric K. Walton Eric A. Aebker Curt A. Levis 《海军后勤学研究》1991,38(6):779-797
We consider the problem of allotting locations in the geostationary orbit to communication satellites, subject to angle of elevation and electromagnetic interference constraints. An optimization framework is used as a means of finding feasible allotment plans. Specifically, we present a two-phase solution procedure for the satellite location problem (SLP). The objective in SLP is to allot geostationary orbital locations to satellites so as to minimize the sum of the absolute differences between the locations prescribed for the satellites and corresponding specified desired locations. We describe two heuristics, an ordering procedure and a k-permutation algorithm, that are used in tandem to find solutions to SLP. Solutions to a worldwide example problem with 183 satellites serving 208 service areas are summarized. 相似文献
232.
A cutting plane method, based on a geometric inequality, is described as a means of solving geometric programs. While the method is applied to the primal geometric program, it is shown to retain the geometric programming duality relationships. Several methods of generating the cutting planes are discussed and illustrated on some example problems. 相似文献
233.
The notions of minimax paths, trees, and cut sets are defined for undirected graphs; and relationships between these entities are established. Simple solution procedures based on these relationships are presented. 相似文献
234.
This paper represents a continuation of three previous papers [1-.3] in the study of competitive bidding processes. It treats the case where a bidder's knowledge of his competitor's cost i s given by a probability distribution over a certain interval. The results obtained extend the work of Vickrey [4] to the case where the cost intervals a r e not necessarily symmetric. 相似文献
235.
The Tactical Warfare Simulation Program is a procedure by which the major interactions among opposing military units and terrain features can be treated in a tactical limited warfare situation. It is a critical-area, sequence-of-event model and is programmed in SIM-SCRIPT. In this program a military unit is described by such properties as strength, size, location, velocity, and attrition rates. Some of the events which can occur to a military unit are entering/leaving terrain features, becoming engaged/disengaged with opposing units, retreating, reaching an objective, and breaking. Following a discussion of the general features of the program, a study of a hypothetical war is presented. 相似文献
236.
David R. Morrison Jason J. Sauppe Wenda Zhang Sheldon H. Jacobson Edward C. Sewell 《海军后勤学研究》2017,64(1):64-82
The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017 相似文献
237.
238.
Håkon Lunde Saxi 《Defence Studies》2017,17(2):171-197
At NATO’s 2014 Wales Summit, the UK and Germany unveiled two new initiatives for European defence cooperation, known, respectively, as the Joint Expeditionary Force (JEF) and the Framework Nations Concept (FNC). Both were the result of economic pressures and the need to exercise intra-alliance leadership, but they represented very different approaches to cooperation. The JEF was to be a UK-led contingency force for short-notice operations, selectively incorporating forces from allies and partners. The FNC sought to coordinate capability development between groups of allies, centred on larger framework nations, to develop coherent capability-clusters available to meet NATO’s force requirements. The common denominator and novelty of the initiatives was the building of forces and capabilities multinationally by having major states act as framework nations for groups of smaller allies. The UK and Germany have ownership and continue to provide leadership to these initiatives. This is one key reason why they continue to evolve to accommodate changing circumstances and are likely to endure. 相似文献
239.
Hüseyin Bağcı 《Defence Studies》2017,17(1):38-62
Turkey has been investing in its national defence industrial base since the 1980s. As with other developing countries, Turkey’s motivations for investing in national defence industries can be boiled down to the pursuit of defence autarky, economic benefits and international prestige. However, after 40 years of investment, Turkey is unable to reach the primary goals of defence industrialisation. We argue that three factors are important to understanding Turkey’s persistence in these primary goals. First, Turkey believes that there is an overall improvement in its defence industrial capabilities and the goal of autarky is still reachable. Second, increased defence exports support the belief that Turkish defence industries have become sustainable and the trend will continue in the future. The third reason, perhaps most important of all, has to do with the domestic political gains of defence industrialisation: the AKP uses defence industry and indigenous weapon systems for prestige and, therefore, garners broader support. 相似文献
240.
This paper considers a warehouse sizing problem whose objective is to minimize the total cost of ordering, holding, and warehousing of inventory. Unlike typical economic lot sizing models, the warehousing cost structure examined here is not the simple unit rate type, but rather a more realistic step function of the warehouse space to be acquired. In the cases when only one type of stock‐keeping unit (SKU) is warehoused, or when multiple SKUs are warehoused, but, with separable inventory costs, closed form solutions are obtained for the optimal warehouse size. For the case of multi‐SKUs with joint inventory replenishment cost, a heuristic with a provable performance bound of 94% is provided. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 299–312, 2001 相似文献