全文获取类型
收费全文 | 640篇 |
免费 | 11篇 |
出版年
2021年 | 11篇 |
2019年 | 15篇 |
2018年 | 9篇 |
2017年 | 7篇 |
2016年 | 9篇 |
2015年 | 5篇 |
2014年 | 9篇 |
2013年 | 101篇 |
2010年 | 5篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 14篇 |
2004年 | 9篇 |
2003年 | 11篇 |
2002年 | 9篇 |
2001年 | 6篇 |
2000年 | 7篇 |
1998年 | 12篇 |
1997年 | 12篇 |
1996年 | 17篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 13篇 |
1992年 | 12篇 |
1991年 | 14篇 |
1990年 | 12篇 |
1989年 | 25篇 |
1988年 | 22篇 |
1987年 | 14篇 |
1986年 | 19篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 14篇 |
1981年 | 11篇 |
1980年 | 16篇 |
1979年 | 12篇 |
1978年 | 12篇 |
1977年 | 9篇 |
1976年 | 10篇 |
1975年 | 10篇 |
1974年 | 12篇 |
1973年 | 7篇 |
1972年 | 6篇 |
1971年 | 13篇 |
1970年 | 9篇 |
1969年 | 8篇 |
1968年 | 6篇 |
1967年 | 10篇 |
1966年 | 6篇 |
排序方式: 共有651条查询结果,搜索用时 31 毫秒
451.
From an original motivation in quantitative inventory modeling, we develop methods for testing the hypothesis that the service times of an M/G/1 queue are exponentially distributed, given a sequence of observations of customer line and/or system waits. The approaches are mostly extensions of the well-known exponential goodness-of-fit test popularized by Gnedenko, which results from the observation that the sum of a random exponential sample is Erlang distributed and thus that the quotient of two independent exponential sample means is F distributed. 相似文献
452.
For a linear fractional programming problem, Sharma and Swarup have constructed a dual problem, also a linear fractional program, in which the objective functions of both primal and dual problems are the same. Craven and Mond have extended this result to a nonlinear fractional programming problem with linear constraints, and a dual problem for which the objective function is the same as that of the primal. This theorem is now further extended from linear to differentiable convex constraints. 相似文献
453.
Gabriel R. Bitran 《海军后勤学研究》1979,26(4):689-693
In this paper we present the results of a limited number of experiments with linear fractional problems. Six solution procedures were tested and the results are expressed in the number of simplex-like pivots required to solve a sample of twenty problems randomly generated. 相似文献
454.
This paper analyses the E/M/c queueing system and shows how to calculate the expected number in the system, both at a random epoch and immediately preceding an arrival. These expectations are expressed in terms of certain initial probabilities which are determined by linear equations. The advantages and disadvantages of this method are also discussed. 相似文献
455.
In multi-commodity inventory systems with variable setup costs, the mixed ordering policy assumes that commodities may be ordered either individually, or may be arbitrarily grouped for joint ordering. Thus, for a two-commodity system, commodity one or commodity two or commodities one and two may be ordered incurring respectively fixed order costs of K, K1, or K2, where max (K1, K2) ≤ K ≤ K1 + K2, This paper considers a two-commodity periodic review system. The stationary characteristics of the system are analyzed, and, for a special case, explicit solutions are obtained for the distribution of the stock levels at the beginning of the periods. In a numerical example, optimal policy variables are computed, and the mixed ordering policy is compared with individual and joint ordering policies. 相似文献
456.
This paper considers the two different flow shop scheduling problems that arise when, in a two machine problem, one machine is characterized by sequence dependent setup times. The objective is to determine a schedule that minimizes makespan. After establishing the optimally of permutation schedules for both of these problems, an efficient dynamic programming formulation is developed for each of them. Each of these formulations is shown to be comparable, from a computational standpoint, to the corresponding formulation of the traveling salesman problem. Then, the relative merits of the dynamic programming and branch and bound approaches to these two scheduling problems are discussed. 相似文献
457.
458.
459.
The Akko 1 shipwreck is the remains of a 26-metre-long Egyptian armed vessel or auxiliary naval brig built at the beginning of the 19th century. Remains of six flintlock muskets were retrieved from the shipwreck, and characterised by various metallurgical methods. The research aimed to study the composition and microstructure of the musket fittings and their manufacturing processes, and if possible, to determine the date and origin of the raw materials. The lead isotope analysis of the fittings suggests that their raw material originated in Great Britain. Based on their typology and composition, the fittings were made in Great Britain of brass alloy and manufactured by casting, probably at the same workshop; and the staple was manufactured by casting and drawing. Considering the zinc content, combined with the manufacturing techniques, the fittings were manufactured between the latter part of the 18th and the early 19th centuries, which might indicate that they were purchased in the course of 19th century weapons trade to be used on board the Egyptian ship. 相似文献
460.
David R. Morrison Jason J. Sauppe Wenda Zhang Sheldon H. Jacobson Edward C. Sewell 《海军后勤学研究》2017,64(1):64-82
The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017 相似文献