全文获取类型
收费全文 | 593篇 |
免费 | 15篇 |
出版年
2021年 | 11篇 |
2019年 | 21篇 |
2018年 | 11篇 |
2017年 | 11篇 |
2016年 | 15篇 |
2015年 | 13篇 |
2014年 | 13篇 |
2013年 | 139篇 |
2009年 | 6篇 |
2008年 | 8篇 |
2007年 | 5篇 |
2006年 | 5篇 |
2005年 | 9篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2000年 | 7篇 |
1998年 | 10篇 |
1997年 | 16篇 |
1996年 | 10篇 |
1995年 | 5篇 |
1994年 | 10篇 |
1993年 | 5篇 |
1992年 | 8篇 |
1991年 | 15篇 |
1990年 | 6篇 |
1989年 | 7篇 |
1988年 | 12篇 |
1987年 | 16篇 |
1986年 | 11篇 |
1985年 | 8篇 |
1984年 | 6篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 14篇 |
1978年 | 7篇 |
1977年 | 8篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1973年 | 13篇 |
1972年 | 9篇 |
1971年 | 7篇 |
1970年 | 10篇 |
1969年 | 7篇 |
1968年 | 5篇 |
1967年 | 8篇 |
1966年 | 5篇 |
排序方式: 共有608条查询结果,搜索用时 15 毫秒
431.
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. 相似文献
432.
433.
434.
Basheer M. Khumawala 《海军后勤学研究》1973,20(1):109-121
This paper introduces an efficient heuristic procedure for a special class of mixed integer programming problems called the uncapacitated warehouse (plant) location problem. This procedure is derived from the branching decision rules proposed for the branch and bound algorithm by the author in an earlier paper. It can be viewed as tracing a single path of the branch and bound tree (from the initial node to the terminal node), the path being determined by the particular branching decision rule used. Unlike branch and bound the computational efficiency of this procedure is substantially less than linearly related to the number of potential warehouse locations (integer variables) in the problem. Its computational efficiency is tested on problems found in the literature. 相似文献
435.
M. L. Chaudhry 《海军后勤学研究》1972,19(2):369-378
The technique of probability generating functions has been applied to solve the steady state behavior of a discrete-time, single-channel, queueing problem wherein the arrivals to the queue at consecutive time-marks are statistically independent, but the service is accomplished in phases which are Markov-dependent. Special cases of importance have been discussed. In the end, mean number of phases, its special cases, the mean queue lengths, and the variances have been ascertained. 相似文献
436.
Harvey M. Salkin 《海军后勤学研究》1972,19(2):399-402
Glover and Young, References [4] and [8], respectively, present convergent primal integer programming algorithms. The algorithm outlined in Young's paper (which was deliberately specialized) is shown to be a special case of the Glover algorithm under his acceptable source row selection, Rule 1. 相似文献
437.
Richard C. Grinold 《海军后勤学研究》1972,19(1):123-136
Large complicated projects with interdependent activities can be described by project networks. Arcs represent activities, nodes represent events, and the network's structure defines the relation between activities and events. A schedule associates an occurrence time with each event: the project can be scheduled in several different ways. We assume that a known amount of cash changes hands at each event. Given any schedule the present value of all cash transactions can be calculated. The payment scheduling problem looks for a schedule that maximizes the present value of all transactions. This problem was first introduced by Russell [2]; it is a nonlinear program with linear constraints and a nonconcave objective. This paper demonstrates that the payment scheduling problem can be transformed into an equivalent linear program. The linear program has the structure of a weighted distribution problem and an efficient procedure is presented for its solution. The algorithm requires the solution of triangular systems of equations with all matrix coefficients equal to ± or 0. 相似文献
438.
In the aftermath of the tragic events of 11 September 2001, numerous changes have been made to aviation security policy and operations throughout the nation's airports. The allocation and utilization of checked baggage screening devices is a critical component in aviation security systems. This paper formulates problems that model multiple sets of flights originating from multiple stations (e.g., airports, terminals), where the objective is to optimize a baggage screening performance measure subject to a finite amount of resources. These measures include uncovered flight segments (UFS) and uncovered passenger segments (UPS). Three types of multiple station security problems are identified and their computational complexity is established. The problems are illustrated on two examples that use data extracted from the Official Airline Guide. The examples indicate that the problems can provide widely varying solutions based on the type of performance measure used and the restrictions imposed by the security device allocations. Moreover, the examples suggest that the allocations based on the UFS measure also provide reasonable solutions with respect to the UPS measure; however, the reverse may not be the case. This suggests that the UFS measure may provide more robust screening device allocations. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
439.
Tjallie A. M. Scheltinga Sebastiaan J. H. Rietjens Sirp J. De Boer Celeste P. M. Wilderom 《Low Intensity Conflict & Law Enforcement》2005,13(1):54-69
In peace-support operations, employees of international humanitarian organisations often clash with those of the military. A lack of familiarity with each other's practices and values, embedded in their respective organisational cultures, is often seen as the culprit. This article presents and illustrates a road map to manage such cultural differences between cooperating organisations. We found that the military culture, in our Bosnian case study, was seen to operate as a hierarchical culture (characterised by formalisation, stability, predictability and efficiency). The culture of international humanitarian organisations, on the other hand, was depicted as clan-type (characterised by teamwork, participation and consensus). To facilitate the creation of cultural awareness as well as respect for, and reconciliation of, cultural differences we recommend several concrete actions that could improve civil-military cooperation. 相似文献
440.
Revenue management is the process of actively managing inventory or capacity to maximize revenues. The active management typically occurs through managerial levers such as price, promotion, or availability. We present a novel real options approach to revenue management that is specifically suited to the car rental business. We illustrate the concept with actual car rental data. The model produces minimally acceptable prices and inventory release quantities (number of cars available for rent at a given price) as a function of remaining time and available inventory. The pricing and inventory release recommendations of the developed model confirm earlier empirical analysis that suggested current practises discount too deeply early in the booking cycle. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献