全文获取类型
收费全文 | 474篇 |
免费 | 13篇 |
出版年
2021年 | 5篇 |
2019年 | 12篇 |
2018年 | 10篇 |
2017年 | 12篇 |
2016年 | 7篇 |
2015年 | 8篇 |
2014年 | 8篇 |
2013年 | 107篇 |
2011年 | 5篇 |
2010年 | 7篇 |
2009年 | 7篇 |
2008年 | 10篇 |
2006年 | 7篇 |
2005年 | 9篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 6篇 |
1998年 | 7篇 |
1997年 | 5篇 |
1996年 | 12篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 8篇 |
1992年 | 11篇 |
1991年 | 11篇 |
1990年 | 7篇 |
1989年 | 10篇 |
1988年 | 11篇 |
1987年 | 11篇 |
1986年 | 8篇 |
1985年 | 8篇 |
1984年 | 6篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 8篇 |
1980年 | 11篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 5篇 |
1975年 | 9篇 |
1974年 | 4篇 |
1971年 | 9篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 5篇 |
1966年 | 7篇 |
排序方式: 共有487条查询结果,搜索用时 15 毫秒
31.
We show that the deterministic nonpreemptive scheduling problem with earliness and tardiness penalties can be solved in polynomial time for certain forms of an objective function provided that a certain optimization problem can be solved. We give instances where this problem has a solution and show that this generalizes several results from the literature. These results do not require symmetric penalization and the penalty functions need only be lower semicontinuous. 相似文献
32.
We consider the problem of finding a plan that maximizes the expected discounted return when extracting a nonrenewable resource having uncertain reserves. An extraction plan specifies the rate at which the resource is extracted as a function of time until the resource is exhausted or the time horizon is reached. The return per unit of resource extracted may depend on the rate of extraction, time, and the amount of resource previously extracted. We apply a new method called the generalized search optimization technique to find qualitative features of optimal plans and to devise algorithms for the numerical calculation of optimal plans. 相似文献
33.
Dmitrii Usanov G.A. Guido Legemaate Peter M. van de Ven Rob D. van der Mei 《海军后勤学研究》2019,66(2):105-122
The effectiveness of a fire department is largely determined by its ability to respond to incidents in a timely manner. To do so, fire departments typically have fire stations spread evenly across the region, and dispatch the closest truck(s) whenever a new incident occurs. However, large gaps in coverage may arise in the case of a major incident that requires many nearby fire trucks over a long period of time, substantially increasing response times for emergencies that occur subsequently. We propose a heuristic for relocating idle trucks during a major incident in order to retain good coverage. This is done by solving a mathematical program that takes into account the location of the available fire trucks and the historic spatial distribution of incidents. This heuristic allows the user to balance the coverage and the number of truck movements. Using extensive simulation experiments we test the heuristic for the operations of the Fire Department of Amsterdam‐Amstelland, and compare it against three other benchmark strategies in a simulation fitted using 10 years of historical data. We demonstrate substantial improvement over the current relocation policy, and show that not relocating during major incidents may lead to a significant decrease in performance. 相似文献
34.
Michael H. Clemmesen 《Defense & Security Analysis》2019,35(1):96-97
The article outlines the essential role of free play elements in various types of exercises for the development of in-depth and practical military professionalism. It thereafter argues why such use of free play contradicts the military science founded Russian Way of War. 相似文献
35.
Colin D. Robinson 《Defense & Security Analysis》2019,35(2):211-221
To engage properly with the Somali National Army, to understand it in the hope of improving stability and the lives of over 12 million Somalis, good basic information on its composition and characteristics is necessary. Authoritative accounts on the subject have been scarce for over 25 years. This account seeks to detail the army’s dispositions across southern Somalia, and, more importantly, the brigades’ clan compositions and linkages. Clan ties supersede loyalties to the central government. The army as it stands is a collection of former militias which suffer from ill-discipline and commit crime along with greater atrocities. Estimates of numbers are unreliable, but there might be 13,000 or more fighters in six brigades in the Mogadishu area and five beyond. 相似文献
36.
Timothy C. Barkdoll Donald P. Gaver Kevin D. Glazebrook Patricia A. Jacobs Sergio Posadas 《海军后勤学研究》2002,49(8):723-742
Blue strike aircraft enter region ? to attack Red targets. In Case 1, Blue conducts (preplanned) SEAD to establish air superiority. In the (reactive) SEAD scenario, which is Case 2, such superiority is already in place, but is jeopardized by prohibitive interference from Red, which threatens Blue's ability to conduct missions. We utilize both deterministic and stochastic models to explore optimal tactics for Red in such engagements. Policies are developed which will guide both Red's determination of the modes of operation of his engagement radar, and his choice of Blue opponent to target next. An index in the form of a simple transaction kill ratio plays a major role throughout. Published 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 723–742, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10046 相似文献
37.
38.
Marvin D. Troutt 《海军后勤学研究》1987,34(4):593-603
Multivariable elimination algorithms, which may be regarded as generalizations of various one-dimensional search procedures, have not found wide application. A probable reason may be the generally very irregularly shaped regions of uncertainty that evolve iteratively in the procedures. Hence hope for practical salvage of this class of algorithms seems to lie in controlling the shape of the successively smaller regions of uncertainty. In this article an extension of Bolzano search to rectangles which preserves rectangular iterates is given. Since the result is essentially geometrical in nature, a geometric proof of this procedure is given. Hopefully the proof procedure will be of independent interest. A numerical illustration of the procedure is given for a game problem, such problems lending themselves to this method. 相似文献
39.
The flow-shop scheduling problem with sequence-dependent additive setup times is considered as a special case of the general problem, and a polynomially bounded approximate method is developed to find a minimum makespan permutation schedule. The approximate algorithm is shown to yield optimal results for the two-machine case. A version of Sule's model is defined that produces the first approximation of the optimal solution for this problem. Computational experience along with numerical examples are provided to test the effectiveness of the method. 相似文献
40.
This article is concerned with the scaling variant of Karmarkar's algorithm for linear programming problems. Several researchers have presented convergence analyses for this algorithm under various nondegeneracy types of assumptions, or under assumptions regarding the nature of the sequence of iterates generated by the algorithm. By employing a slight perturbation of the algorithm, which is computationally imperceptible, we are able to prove without using any special assumptions that the algorithm converges finitely to an ε-optimal solution for any chosen ε > 0, from which it can be (polynomically) rounded to an optimum, for ε > 0 small enough. The logarithmic barrier function is used as a construct for this analysis. A rounding scheme which produces an optimal extreme point solution is also suggested. Besides the non-negatively constrained case, we also present a convergence analysis for the case of bounded variables. An application in statistics to the L1 estimation problem and related computational results are presented. 相似文献