全文获取类型
收费全文 | 578篇 |
免费 | 9篇 |
出版年
2021年 | 5篇 |
2020年 | 4篇 |
2019年 | 6篇 |
2017年 | 11篇 |
2016年 | 15篇 |
2015年 | 10篇 |
2014年 | 12篇 |
2013年 | 104篇 |
2012年 | 22篇 |
2011年 | 27篇 |
2010年 | 23篇 |
2009年 | 15篇 |
2008年 | 30篇 |
2007年 | 13篇 |
2006年 | 15篇 |
2005年 | 6篇 |
2004年 | 4篇 |
2002年 | 3篇 |
2001年 | 4篇 |
1998年 | 8篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 13篇 |
1992年 | 11篇 |
1991年 | 9篇 |
1990年 | 3篇 |
1989年 | 13篇 |
1988年 | 8篇 |
1987年 | 12篇 |
1986年 | 13篇 |
1985年 | 9篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 10篇 |
1979年 | 13篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1976年 | 9篇 |
1975年 | 8篇 |
1973年 | 4篇 |
1972年 | 14篇 |
1971年 | 3篇 |
1970年 | 5篇 |
1969年 | 11篇 |
1968年 | 7篇 |
1967年 | 4篇 |
1966年 | 5篇 |
排序方式: 共有587条查询结果,搜索用时 62 毫秒
131.
132.
This paper considers a problem of locating new facilities in the plane with respect to existing facilities, the locations of which are known. The problem consists of finding locations of new facilities which will minimize a total cost function which consists of a sum of costs directly proportional to the Euclidian distances among the new facilities, and costs directly proportional to the Euclidian distances between new and existing facilities. It is established that the total cost function has a minimum; necessary conditions for a mimumum are obtained; necessary and sufficient conditions are obtained for the function to be strictly convex (it is always convex); when the problem is “well structured,” it is established that for a minimum cost solution the locations of the new facilities will lie in the convex hull of the locations of the existing facilities. Also, a dual to the problem is obtained and interpreted; necessary and sufficient conditions for optimum solutions to the problem, and to its dual, are developed, as well as complementary slackness conditions. Many of the properties to be presented are motivated by, based on, and extend the results of Kuhn's study of the location problem known as the General Fermat Problem. 相似文献
133.
A discrete time Collection Model is formulated, involving the completion of a touring objective on a network with stochastic node states. Heuristic touring strategies are constructed, there being as yet inadequate analytic results for its optimal solution. Effectiveness of the heuristics is assessed by comparing expected tour times under the heuristics with expected tour times given perfect information. A branch and bound algorithm is presented for computing the perfect information tour times. 相似文献
134.
M. L. Juncosa 《海军后勤学研究》1971,18(2):231-242
For a young science and even for most old ones, the intensity and variety of activities involved in computer science are unsurpassed. In an effort to provide the extremely varied training needed in the field, curriculum planners have tended to slight probability and statistics. Rarely has it been a requisite and only occasionally a desired elective However, not only is an adequate foundation in probability and statistics necessary for such external computer applications as tracking and other data reduction, Monte Carlo techniques, gaming, operations research, traffic analyses, etc., but it also plays an important role in internal applications to computer science and technology This effort in Rand's continuing study of computational mathematics and its applications offers a number of examples in various areas of computational mathematics and computing machine arithmetic-to say nothing of computer design, time sharing, and the like-to support the thesis that probability and statistics should be a requisite, not simply an elective or, even worse, ignored, at any institution offering a program in computer science. Further more, a potentially profitable source of research problems can be found in the interface between probability and statistics and computer science. 相似文献
135.
This paper discusses a mixed integer programming method for solving the Facilities Location Problem with capacities on the facilities. The algorithm uses a Decomposition technique to solve the dual of the associated continuous problem in each branch-bound iteration. The method was designed to produce the global optimum solution for problems with up to 100 facilities and 1,000 customers. Computational experience and a complete example are also presented in the appendix. 相似文献
136.
This paper presents a linear programming model of a fleet of vessels which is required to transport quantities of cargo, such as coal, iron ore, limestone, and salt from certain producing ports to specific destination ports. This model has been implemented and is currently being used both for planning purposes and as an aid in scheduling the trips to be made by each vessel. 相似文献
137.
Richard F. Gebhard 《海军后勤学研究》1967,14(1):55-67
The purpose of this paper is to analyze the effect of a particular control doctrine applied to the service mechanism of a queuing process. A bilevel hysteretic control based on queue length control levels is employed in an M/M/1 queuing system. Expressions are obtained for queue length probabilities, the first two factorial moments of queue length and two figures of merit for describing control performance under the assumption of statistical equilibrium. Computational examples illustrate the effects on queuing processes subject to this type of control. Several cost formulae are considered for comparison of costs when the queue control doctrine is varied. Situations in which hysteretic control is useful are discussed. 相似文献
138.
Grace L. Yang 《海军后勤学研究》1985,32(1):45-51
Renewal theory is used to study the effectiveness of a class of continuous sampling plans first introduced by Dodge. This approach provides a simple way of viewing and computing the long-run Average Outgoing Quality (AOQ) and its maximum AOQL. More importantly, it is used to study the average outgoing quality in a short production run through an approximation formula AOQ*(t). Formulas for AOQ and AOQ*(t) are provided. By simulation, it is found that AOQ*(t) is sufficiently accurate in situations corresponding to actual practice. 相似文献
139.
Tobias Brueggemann Johann L. Hurink Tjark Vredeveld Gerhard J. Woeginger 《海军后勤学研究》2011,58(8):795-803
We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst‐case approximation guarantees for the local optima of such neighborhoods. The so‐called split neighborhood splits a feasible schedule into two layers, and then recombines the two layers by finding a perfect matching. We show that the makespan of every local optimum for split is at most a factor of 2 away from the globally optimal makespan. We then combine the split neighborhood with two neighborhoods from the literature. The combination of split with the jump neighborhood only marginally improves the approximation guarantee, whereas the combination with the lexicographic‐jump neighborhood decreases the approximation guarantee from 2 to 3/2. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
140.