全文获取类型
收费全文 | 568篇 |
免费 | 8篇 |
专业分类
576篇 |
出版年
2020年 | 7篇 |
2019年 | 14篇 |
2018年 | 13篇 |
2017年 | 19篇 |
2016年 | 16篇 |
2015年 | 12篇 |
2014年 | 16篇 |
2013年 | 130篇 |
2012年 | 5篇 |
2011年 | 9篇 |
2010年 | 9篇 |
2009年 | 12篇 |
2008年 | 6篇 |
2007年 | 4篇 |
2006年 | 5篇 |
2005年 | 7篇 |
2004年 | 6篇 |
2003年 | 13篇 |
2002年 | 9篇 |
2001年 | 6篇 |
2000年 | 7篇 |
1999年 | 5篇 |
1998年 | 8篇 |
1997年 | 8篇 |
1996年 | 6篇 |
1995年 | 13篇 |
1994年 | 10篇 |
1993年 | 10篇 |
1992年 | 13篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 13篇 |
1988年 | 14篇 |
1987年 | 12篇 |
1986年 | 14篇 |
1985年 | 12篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1980年 | 6篇 |
1979年 | 5篇 |
1978年 | 5篇 |
1976年 | 6篇 |
1975年 | 5篇 |
1974年 | 11篇 |
1973年 | 6篇 |
1972年 | 5篇 |
1971年 | 5篇 |
1970年 | 5篇 |
1969年 | 5篇 |
1968年 | 6篇 |
排序方式: 共有576条查询结果,搜索用时 46 毫秒
51.
52.
We address the problem of dispatching a vehicle with different product classes. There is a common dispatch cost, but holding costs that vary by product class. The problem exhibits multidimensional state, outcome and action spaces, and as a result is computationally intractable using either discrete dynamic programming methods, or even as a deterministic integer program. We prove a key structural property for the decision function, and exploit this property in the development of continuous value function approximations that form the basis of an approximate dispatch rule. Comparisons on single product‐class problems, where optimal solutions are available, demonstrate solutions that are within a few percent of optimal. The algorithm is then applied to a problem with 100 product classes, and comparisons against a carefully tuned myopic heuristic demonstrate significant improvements. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 742–769, 2003. 相似文献
53.
In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003. 相似文献
55.
A probabilistic model is developed that applies to military bombardment, advertising for a mass audience, and other kinds of situations in which striking a target means that less of it is left to strike. The model provides the basis for decision analysis based on marginal gain in such circumstances. Heterogneous resources are considered as well as composite targets. All expenditures are quantized. The model has been developed as part of a computer-based military expert system, to replace a large complex set of expert opinions. In that application it sharply improves efficiency, yet conforms to major tenets of tactical doctrine. 相似文献
56.
A system of two parallel queues where the arrivals from a single stream of customers join the shorter queue is considered. Arrivals form a homogeneous Poisson stream and the service times in each of the two queues are independent exponential variates. By treating one of the queues as bounded, the steady-state probability vector for the system can be expressed in a modified matrix-geometric form and can be computed efficiently. Computational procedures for the sojourn time distribution and characteristics of the departure stream are developed. Some numerical results are presented, and based on these results an efficient approximation scheme for the model is developed which can be readily extended to systems with more than two parallel queues. 相似文献
57.
The problem is to protect a set of t targets by n perfect interceptors against an attack by m perfect weapons. If the defender solves for an optimal preallocated preferential defense and associated game value assuming m1 attackers, and the attacker knows the assumption of the defender and utilizes m2 attackers, he may be able to achieve significantly more damage than had the defender assumed that there would be m2 attackers. The article treats the robustness of preallocated preferential defense to assumptions about the size of the attack and presents results of an alternative approach. 相似文献
58.
Lawrence James 《Defense & Security Analysis》1985,1(2):143-144
The Face of Battle: by John Keegan. Jonathan Cape, London, 1976; Viking Press, New York, 1976; Penguin Books, Harmondsworth, 1978, 1983, 1984. 相似文献
59.
In this article, we examine the problem of producing a spanning Eulerian subgraph in an undirected graph. After the ?-completeness of the general problem is established, we present polynomial-time algorithms for both the maximization and minimization versions where instances are defined on a restricted class of graphs referred to as series-parallel. Some novelties in the minimization case are discussed, as are heuristic ideas. 相似文献
60.