全文获取类型
收费全文 | 562篇 |
免费 | 14篇 |
出版年
2021年 | 8篇 |
2019年 | 11篇 |
2018年 | 9篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 7篇 |
2014年 | 10篇 |
2013年 | 122篇 |
2012年 | 5篇 |
2011年 | 6篇 |
2009年 | 8篇 |
2008年 | 5篇 |
2007年 | 13篇 |
2006年 | 6篇 |
2005年 | 9篇 |
2004年 | 7篇 |
2003年 | 8篇 |
2002年 | 9篇 |
2000年 | 5篇 |
1999年 | 5篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 12篇 |
1995年 | 7篇 |
1994年 | 10篇 |
1993年 | 14篇 |
1992年 | 13篇 |
1991年 | 11篇 |
1990年 | 12篇 |
1989年 | 20篇 |
1988年 | 17篇 |
1987年 | 11篇 |
1986年 | 14篇 |
1985年 | 9篇 |
1983年 | 5篇 |
1982年 | 10篇 |
1981年 | 9篇 |
1980年 | 8篇 |
1979年 | 10篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 7篇 |
1974年 | 8篇 |
1973年 | 6篇 |
1971年 | 8篇 |
1970年 | 7篇 |
1969年 | 5篇 |
1967年 | 6篇 |
1948年 | 4篇 |
排序方式: 共有576条查询结果,搜索用时 15 毫秒
481.
Michael A. Trick 《海军后勤学研究》1992,39(2):137-151
We examine the basis structure of the linear relaxation of the generalized assignment problem. The basis gives a surprising amount of information. This leads to a very simple heuristic that uses only generalized network optimization codes. Lower bounds can be generated by cut generation, where the violated inequalities are found directly from the relaxation basis. An improvement heuristic with the same flavor is also presented. 相似文献
482.
We present a branch‐and‐price technique for optimal staff scheduling with multiple rest breaks, meal break, and break windows. We devise and implement specialized branching rules suitable for solving the set covering type formulation implicitly, using column generation. Our methodology is more widely applicable and computationally superior to the alternative methods in the literature. We tested our methodology on 365 test problems involving between 1728 and 86400 shift variations, and 20 demand patterns. In a direct comparison with an alternative method, our approach yields significant improvements both in cpu time and in the number of problem instances solved to optimality. The improvements were particularly marked for problems involving larger numbers of feasible shifts. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 185–200, 2000 相似文献
483.
When solving location problems in practice it is quite common to aggregate demand points into centroids. Solving a location problem with aggregated demand data is computationally easier, but the aggregation process introduces error. We develop theory and algorithms for certain types of centroid aggregations for rectilinear 1‐median problems. The objective is to construct an aggregation that minimizes the maximum aggregation error. We focus on row‐column aggregations, and make use of aggregation results for 1‐median problems on the line to do aggregation for 1‐median problems in the plane. The aggregations developed for the 1‐median problem are then used to construct approximate n‐median problems. We test the theory computationally on n‐median problems (n ≥ 1) using both randomly generated, as well as real, data. Every error measure we consider can be well approximated by some power function in the number of aggregate demand points. Each such function exhibits decreasing returns to scale. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 614–637, 2003. 相似文献
484.
485.
486.
Michael Kluth 《Defense & Security Analysis》2017,33(2):158-173
How have European cross-border defence industrial mergers and acquisitions affected domestic procurement bias among the major EU powers? This article departs from the findings of Andrew Moravcsik more than two decades ago suggesting that major West European states had no ingrained preferences for defence industrial autarchy. When cross-national armament projects were derailed, this could be attributed to political efforts of national defence industrial champions favouring purely domestic projects. As former national champions join pan-European defence groups, their preferences are likely modified. Does this shift procurement towards non-European “off-the-shelf” solutions which, according to Moravcsik, are favoured by defence departments? Or does it give impetus to a stronger preference for European as opposed to domestic systems? In this article, procurement patterns in the aftermath of cross-border defence industry consolidation will be analysed. Procurement bias is assessed in two industry segments characterised by pervasive consolidation. 相似文献
487.
488.
This paper deals with the sequencing problem of minimizing linear delay costs with parallel identical processors. The theoretical properties of this m-machine problem are explored, and the problem of determining an optimum scheduling procedure is examined. Properties of the optimum schedule are given as well as the corresponding reductions in the number of schedules that must be evaluated in the search for an optimum. An experimental comparison of scheduling rules is reported; this indicates that although a class of effective heuristics can be identified, their relative behavior is difficult to characterize. 相似文献
489.
Michael Miller 《The Nonproliferation Review》2013,20(1):33-60
Recently, post-explosion nuclear forensics, or nuclear attribution, has gained a new spotlight within the nuclear weapons scientific and policymaking community. Academics are beginning to ask whether post-explosion forensics might create a replacement for an international nonproliferation regime, or at least offer a fallback option to deter states and individuals from selling nuclear materials. This paper examines current attribution technology from unclassified literature and finds the technology to be well developed but not foolproof, such that nuclear attribution currently provides little deterrent value. If current capabilities were publicized more thoroughly and if the post-explosion process of assessing the evidence were internationalized, states and intermediate actors might be deterred more effectively. Developing a nuclear fingerprint database is also discussed. While useful, its impact on deterrence would be minimal. 相似文献
490.