全文获取类型
收费全文 | 492篇 |
免费 | 23篇 |
国内免费 | 1篇 |
出版年
2021年 | 6篇 |
2019年 | 11篇 |
2018年 | 9篇 |
2017年 | 13篇 |
2016年 | 10篇 |
2015年 | 9篇 |
2014年 | 10篇 |
2013年 | 125篇 |
2012年 | 7篇 |
2011年 | 9篇 |
2010年 | 8篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 6篇 |
2006年 | 11篇 |
2005年 | 9篇 |
2004年 | 6篇 |
2003年 | 5篇 |
2002年 | 6篇 |
2000年 | 5篇 |
1997年 | 7篇 |
1996年 | 10篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 12篇 |
1992年 | 12篇 |
1991年 | 9篇 |
1990年 | 4篇 |
1989年 | 10篇 |
1988年 | 9篇 |
1987年 | 8篇 |
1986年 | 7篇 |
1985年 | 10篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 7篇 |
1980年 | 9篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1976年 | 7篇 |
1975年 | 13篇 |
1974年 | 6篇 |
1973年 | 9篇 |
1972年 | 5篇 |
1971年 | 5篇 |
1970年 | 6篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 4篇 |
排序方式: 共有516条查询结果,搜索用时 15 毫秒
431.
This article addresses the problem of scheduling the United States Navy's Atlantic Fleet to satisfy overseas strategic requirements. An integer programming formulation is developed but results in a model with prohibitive size. This fact and the qualitative nature of additional secondary objectives and constraints suggest an interactive optimization approach. A system that solves a natural relaxation of the integer program within an interactive environment is discussed. 相似文献
432.
In this article we investigate the problem of locating a facility among a given set of demand points when the weights associated with each demand point change in time in a known way. It is assumed that the location of the facility can be changed one or more times during the time horizon. We need to find the time “breaks” when the location of the facility is to be changed, and the location of the facility during each time segment between breaks. We investigate the minisum Weber problem and also minimax facility location. For the former we show how to calculate the objective function for given time breaks and optimally solve the rectilinear distance problem with one time break and linear change of weights over time. Location of multiple time breaks is also discussed. For minimax location problems we devise two algorithms that solve the problem optimally for any number of time breaks and any distance metric. These algorithms are also applicable to network location problems. 相似文献
433.
This article defines and develops a simulation optimization system based upon response surface classification and the integration of multiple search strategies. Response surfaces are classified according to characteristics that indicate which search technique will be most successful. Typical surface characteristics include statistical measures and topological features, while search techniques encompass response surface methodology, simulated annealing, random search, etc. The classify-then-search process flow and a knowledge-based architecture are developed and then demonstrated with a detailed computer example. The system is useful not only as an approach to optimizing simulations, but also as a means for integrating search techniques and thereby providing the user with the most promising path toward an optimal solution. © 1995 John Wiley & Sons, Inc. 相似文献
434.
In this note we describe a local-search heuristic (LSH) for large non-unicost set-covering problems (SCPs). The new heuristic is based on the simulated annealing algorithm and uses an improvement routine designed to provide low-cost solutions within a reasonable amount of CPU time. The solution costs associated with the LSH compared very favorably to the best previously published solution costs for 20 large SCPs taken from the literature. In particular, the LSH yielded new benchmark solutions for 17 of the 20 test problems. We also report that, for SCPs where column cost is correlated with column coverage, the new heuristic provides solution costs competitive with previously published results for comparable problems. © 1995 John Wiley & Sons, Inc. 相似文献
435.
It is shown that two recent results of Baxter and Harche [1] on monotone and balanced optimal assemblies hold only under conditions that are more restrictive than those originally proposed by the authors. We describe such additional conditions, illustrate why they are needed, and establish their sufficiency. We also consider a recent result by Malon [11] and demonstrate that, while the result itself is correct, its two proofs were incomplete. A complete proof of an extension of the result is then suggested. © 1995 John Wiley & Sons, Inc. 相似文献
436.
This article presents the application of a simulated annealing heuristic to an NP-complete cyclic staff-scheduling problem. The new heuristic is compared to branch-and-bound integer programming algorithms, as well as construction and linear programming-based heuristics. It is designed for use in a continuously operating scheduling environment with the objective of minimizing the number of employees necessary to satisfy forecast demand. The results indicate that the simulated annealing-based method tends to dominate the branch-and-bound algorithms and the other heuristics in terms of solution quality. Moreover, the annealing algorithm exhibited rapid convergence to a low-cost solution. The simulated annealing heuristic is executed in a single program and does not require mathematical programming software. © 1993 John Wiley & Sons, Inc. 相似文献
437.
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. 相似文献
438.
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 相似文献
439.
440.
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. 相似文献