全文获取类型
收费全文 | 563篇 |
免费 | 18篇 |
出版年
2021年 | 11篇 |
2019年 | 10篇 |
2018年 | 7篇 |
2017年 | 16篇 |
2016年 | 10篇 |
2015年 | 16篇 |
2014年 | 13篇 |
2013年 | 136篇 |
2011年 | 7篇 |
2009年 | 4篇 |
2008年 | 8篇 |
2007年 | 6篇 |
2006年 | 8篇 |
2005年 | 11篇 |
2004年 | 4篇 |
2003年 | 4篇 |
2002年 | 7篇 |
2001年 | 6篇 |
2000年 | 6篇 |
1999年 | 7篇 |
1998年 | 10篇 |
1997年 | 10篇 |
1996年 | 8篇 |
1995年 | 10篇 |
1994年 | 12篇 |
1993年 | 11篇 |
1992年 | 12篇 |
1991年 | 12篇 |
1990年 | 4篇 |
1989年 | 10篇 |
1988年 | 18篇 |
1987年 | 10篇 |
1986年 | 16篇 |
1985年 | 11篇 |
1984年 | 6篇 |
1983年 | 7篇 |
1982年 | 4篇 |
1981年 | 11篇 |
1980年 | 6篇 |
1979年 | 12篇 |
1978年 | 7篇 |
1977年 | 7篇 |
1975年 | 12篇 |
1974年 | 7篇 |
1973年 | 6篇 |
1972年 | 7篇 |
1971年 | 5篇 |
1970年 | 6篇 |
1969年 | 6篇 |
1966年 | 4篇 |
排序方式: 共有581条查询结果,搜索用时 15 毫秒
501.
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. 相似文献
502.
This article presents models for determining the optimum number of Red weapons required to win a heterogeneous combat in which m(m> 1) types of Red weapons face a single type of Blue weapon under a newly defined termination policy. Red aims at either minimizing the total cost or maximizing the aggregated remaining force strength. Kuhn-Tucker and simulated annealing techniques are used for obtaining the optimal solution. The methodology is illustrated by analysing heterogeneous combat to determine (i) the feasibility of introducing new types of weapons and (ii) the number of weapons required to win if a specific type of weapon, say infantry, dominates. © 1995 John Wiley & Sons, Inc. 相似文献
503.
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. 相似文献
504.
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. 相似文献
505.
We consider a device that deteriorates over time according to a Markov process so that the failure rate at each state is constant. The reliability of the device is characterized by a Markov renewal equation, and an IFRA (increasing failure rate on average) property of the lifetime is obtained. The optimal replacement and repair problems are analyzed under various cost structures. Furthermore, intuitive and counterintuitive characterizations of the optimal policies and results on some interesting special problems are presented. © 1992 John Wiley & Sons, Inc. 相似文献
506.
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 相似文献
507.
We undertake inference for a stochastic form of the Lanchester combat model. In particular, given battle data, we assess the type of battle that occurred and whether or not it makes any difference to the number of casualties if an army is attacking or defending. Our approach is Bayesian and we use modern computational techniques to fit the model. We illustrate our method using data from the Ardennes campaign. We compare our results with previous analyses of these data by Bracken and Fricker. Our conclusions are somewhat different to those of Bracken. Where he suggests that a linear law is appropriate, we show that the logarithmic or linear‐logarithmic laws fit better. We note however that the basic Lanchester modeling assumptions do not hold for the Ardennes data. Using Fricker's modified data, we show that although his “super‐logarithmic” law fits best, the linear, linear‐logarithmic, and logarithmic laws cannot be ruled out. We suggest that Bayesian methods can be used to make inference for battles in progress. We point out a number of advantages: Prior information from experts or previous battles can be incorporated; predictions of future casualties are easily made; more complex models can be analysed using stochastic simulation techniques. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 541–558, 2000 相似文献
508.
In a recent paper, Teng, Chern, and Yang consider four possible inventory replenishment models and determine the optimal replenishment policies for them. They compare these models to identify the best alternative on the basis of minimum total relevant inventory costs. The total cost functions for Model 1 and Model 4 as derived by them are not exact for the comparison. As a result, their conclusion on the least expensive replenishment policy is incorrect. The present article provides the actual total costs for Model 1 and Model 4 to make a correct comparison of the four models. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 602–606, 2000 相似文献
509.
Monte Carlo estimation of the maximal flow distribution with discrete stochastic arc capacity levels
George S. Fishman 《海军后勤学研究》1989,36(6):829-849
This article describes a highly efficient Monte Carolo sampling plan for estimating ordinates of the complementary distribution function of the maximal s-t flow in a directed network with source node s, terminal node t and whose arcs assume random capacities. Communication, electric power, transportation, and water distribution systems fit this representation. The article derives point estimates and interval estimates that hold for finite sample sizes, and shows the extent to which the proposed technique saves time, as compared to crude Monte Carlo sampling, in achieving a specified accuracy. 相似文献
510.
A general model for the failure of fibrous composite materials is described. It is shown to contain some of the well-known models in the literature. The composite material is viewed as a coherent system of independent identically distributed component strengths. Under the assumption that the applied load is redistributed “homotonically” to the unfailed components upon the failure of a component (an individual fiber segment) and that the distributions of component strengths are IFRA, it is shown that the system (composite) strength distribution is also IFRA. Examples are given using carbon reinforced composite data to illustrate the IFRA property. 相似文献