全文获取类型
收费全文 | 3844篇 |
免费 | 275篇 |
国内免费 | 12篇 |
出版年
2021年 | 64篇 |
2019年 | 95篇 |
2018年 | 58篇 |
2017年 | 87篇 |
2016年 | 83篇 |
2015年 | 83篇 |
2014年 | 81篇 |
2013年 | 726篇 |
2012年 | 45篇 |
2010年 | 57篇 |
2009年 | 65篇 |
2008年 | 65篇 |
2007年 | 89篇 |
2006年 | 51篇 |
2005年 | 73篇 |
2004年 | 62篇 |
2003年 | 45篇 |
2002年 | 61篇 |
2001年 | 40篇 |
2000年 | 52篇 |
1999年 | 88篇 |
1998年 | 95篇 |
1997年 | 88篇 |
1996年 | 101篇 |
1995年 | 71篇 |
1994年 | 90篇 |
1993年 | 89篇 |
1992年 | 76篇 |
1991年 | 98篇 |
1990年 | 60篇 |
1989年 | 83篇 |
1988年 | 82篇 |
1987年 | 76篇 |
1986年 | 77篇 |
1985年 | 68篇 |
1983年 | 44篇 |
1982年 | 45篇 |
1981年 | 46篇 |
1980年 | 51篇 |
1979年 | 45篇 |
1978年 | 49篇 |
1977年 | 45篇 |
1976年 | 45篇 |
1975年 | 46篇 |
1974年 | 52篇 |
1973年 | 50篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 40篇 |
1969年 | 40篇 |
排序方式: 共有4131条查询结果,搜索用时 18 毫秒
801.
采用叠加组播技术为XMSF提供多对多的通信服务,同时使用拥塞控制机制保证其网络服务质量。提出了一种新的组播拥塞控制模型,在MAX-PLUS代数基础上采用线性循环法分析计算了其吞吐量,经过仿真验证了该模型的可行性和灵活性。 相似文献
802.
Multi-echelon logistic systems are essential parts of the service support function of high technology firms. The combination of technological developments and competitive pressures has led to the development of services systems with a unique set of characteristics. These characteristics include (1) low demand probabilities: (2) high cost items; (3) complex echelon structures; (4) existence of pooling mechanisms among stocking locations at the same echelon level; (5) high priority for service, which is often expressed in terms of response time service levels for product groups of items: (6) scrapping of failed parts; and (7) recycling of issued stock due to diagnostic use. This article develops a comprehensive model of a stochastic, multi-echelon inventory system that takes account of the above characteristics. Solutions to the constrained optimization problem are found using a branch and bound procedure. The results of applying this procedure to a spare parts inventory system for a computer manufacturer have led to a number of important policy conclusions. 相似文献
803.
本文针对D.F.Delong教授在文献[1]中提出的一种新算法——WCE迭代算法,运用非线性数值分析理论,导出了该算法的收敛条件。进而,从理论上证明了WCE算法的收敛性与初值选取无关。并且,这一结论也由作者通过计算机仿真研究取得的数值结果所完全证实。 相似文献
804.
有容量限制的运输问题 总被引:3,自引:0,他引:3
陈庆华 《国防科技大学学报》1986,(3):87-92
具有容量限制的运输问题可以用有界变量的线性规划问题求解,但是问题的规模往往变得很大,给求解带来不便。本文给出求解这一问题的表上作业法。 相似文献
805.
This article presents a branch and bound method for solving the problem of minimizing a separable concave function over a convex polyhedral set where the variables are restricted to be integer valued. Computational results are reported. 相似文献
806.
This paper provides a framework in which warranty policies for non-repairable items can be evaluated according to risk preferences of both buyers and sellers. In particular, a warranty price schedule is established such that sellers are indifferent among the policies. Given this schedule, a buyer's response is expressed by selecting the price-warranty combination that minimizes disutility. Within this framework, a warranty can be viewed as an instrumet of risk management that can induce more sales and greater profitability. For given utility functions, analytical results for the development of a price schedule are developed. Numerical results illustrate the substitution effects between warranty terms, prices, and risk parameters. 相似文献
807.
Craig A. Tovey 《海军后勤学研究》1986,33(4):717-724
We consider the problem of rescheduling n jobs to minimize the makespan on m parallel identical processors when m changes value. We show this problem to be NP-hard in general. Call a list schedule totally optimal if it is optimal for all m = 1, …,n. When n is less than 6, there always exists a totally optimal schedule, but for n ≥ 6 this can fail. We show that an exact solution is less robust than the largest processing time first (LPT) heuristic and discuss implications for polynomial approximation schemes and hierarchical planning models. 相似文献
808.
R. K. Ahuja 《海军后勤学研究》1986,33(4):725-739
In this paper, we consider a variant of the classical transportation problem as well as of the bottleneck transportation problem, which we call the minimax transportation problem. The problem considered is to determine a feasible flow xij from a set of origins I to a set of destinations J for which max(i,j)εIxJ{cijxij} is minimum. In this paper, we develop a parametric algorithm and a primal-dual algorithm to solve this problem. The parametric algorithm solves a transportation problem with parametric upper bounds and the primal-dual algorithm solves a sequence of related maximum flow problems. The primal-dual algorithm is shown to be polynomially bounded. Numerical investigations with both the algorithms are described in detail. The primal-dual algorithm is found to be computationally superior to the parametric algorithm and it can solve problems up to 1000 origins, 1000 destinations and 10,000 arcs in less than 1 minute on a DEC 10 computer system. The optimum solution of the minimax transportation problem may be noninteger. We also suggest a polynomial algorithm to convert this solution into an integer optimum solution. 相似文献
809.
Consider a fleet of vehicles comprised of K1 identical tankers and K2 identical nontankers (small aircraft). Tankers are capable of refueling other tankers as well as nontankers. The problem is to find that refueling sequence of the tankers that maximizes the range simultaneously attainable by all K2 nontankers. A recent paper established that the “unit refueling sequence,” comprised of one tanker refueling at each of K1 refueling operations, is optimal. The same paper also proffered the following conjecture for the case that the number of refueling operations is constrained to be less than the number of tankers: A nonincreasing refueling sequence is optimal. This article proves the conjecture. 相似文献
810.
Single- and multi-facility location problems are often solved with iterative computational procedures. Although these procedures have proven to converage, in practice it is desirable to be able to compute a lower bound on the objective function at each iteration. This enables the user to stop the iterative process when the objective function is within a prespecified tolerance of the optimum value. In this article we generalize a new bounding method to include multi-facility problems with lp distances. A proof is given that for Euclidean distance problems the new bounding procedure is superior to two other known methods. Numerical results are given for the three methods. 相似文献