全文获取类型
收费全文 | 507篇 |
免费 | 17篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2020年 | 5篇 |
2019年 | 12篇 |
2018年 | 7篇 |
2017年 | 14篇 |
2016年 | 11篇 |
2015年 | 7篇 |
2014年 | 10篇 |
2013年 | 123篇 |
2012年 | 5篇 |
2011年 | 6篇 |
2010年 | 7篇 |
2009年 | 6篇 |
2008年 | 5篇 |
2007年 | 6篇 |
2006年 | 8篇 |
2005年 | 6篇 |
2003年 | 5篇 |
2002年 | 5篇 |
2001年 | 5篇 |
2000年 | 5篇 |
1998年 | 5篇 |
1997年 | 7篇 |
1996年 | 9篇 |
1995年 | 8篇 |
1994年 | 9篇 |
1993年 | 11篇 |
1992年 | 12篇 |
1991年 | 15篇 |
1989年 | 10篇 |
1988年 | 7篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 14篇 |
1984年 | 7篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 11篇 |
1979年 | 7篇 |
1978年 | 9篇 |
1976年 | 8篇 |
1975年 | 10篇 |
1974年 | 10篇 |
1973年 | 10篇 |
1972年 | 5篇 |
1971年 | 5篇 |
1970年 | 8篇 |
1969年 | 5篇 |
1968年 | 7篇 |
1967年 | 5篇 |
排序方式: 共有525条查询结果,搜索用时 31 毫秒
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.
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. 相似文献
435.
The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting the leader's objective function into a parameterized constraint, and then attempt to solve the resultant problem. This produces a candidate solution that is used to find a point in the BLPP feasible reagion. Incremental improvements are sought, which ultimately lead to a global optimum. An example is presented to highlight the computations and to demonstrate some basic characteristics of the solution. Computational experience indicates that the algorithm is capable of solving problems with up to 50 variables in a reasonable amount of time. 相似文献
436.
This contribution reflects on the state of strategic studies today and the criticism it has received in recent years, as being outdated and irrelevant. The authors formulate some premises for reinvigorating this field of inquiry by widening its scope and research agenda to do more justice to the wide variety of actors, perspectives and practices observable in the enterprise of strategy in our contemporary globalised world. 相似文献
437.
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. 相似文献
438.
439.
440.