全文获取类型
收费全文 | 800篇 |
免费 | 19篇 |
出版年
2021年 | 15篇 |
2019年 | 20篇 |
2018年 | 11篇 |
2017年 | 18篇 |
2016年 | 15篇 |
2015年 | 21篇 |
2014年 | 10篇 |
2013年 | 139篇 |
2010年 | 8篇 |
2008年 | 7篇 |
2007年 | 10篇 |
2006年 | 11篇 |
2005年 | 14篇 |
2004年 | 9篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2001年 | 10篇 |
2000年 | 12篇 |
1999年 | 10篇 |
1998年 | 11篇 |
1997年 | 17篇 |
1996年 | 17篇 |
1995年 | 10篇 |
1994年 | 17篇 |
1993年 | 13篇 |
1992年 | 14篇 |
1991年 | 22篇 |
1990年 | 9篇 |
1989年 | 19篇 |
1988年 | 19篇 |
1987年 | 16篇 |
1986年 | 23篇 |
1985年 | 18篇 |
1984年 | 11篇 |
1983年 | 11篇 |
1982年 | 9篇 |
1981年 | 14篇 |
1980年 | 13篇 |
1979年 | 15篇 |
1978年 | 15篇 |
1977年 | 13篇 |
1976年 | 10篇 |
1975年 | 14篇 |
1974年 | 18篇 |
1973年 | 13篇 |
1972年 | 15篇 |
1971年 | 16篇 |
1970年 | 7篇 |
1969年 | 10篇 |
1968年 | 8篇 |
排序方式: 共有819条查询结果,搜索用时 15 毫秒
41.
An explicit steady state solution is determined for the distribution of the number of customers for a queueing system in which Poisson arrivals are bulks of random size. The number of customers per bulk varies randomly between 1 and m, m arbitrary, according to a point multinomial, and customer service is exponential. Queue characteristics are given. 相似文献
42.
The problem of multiple-resource capacity planning under an infinite time horizon is analyzed using a nonlinear programming model. The analysis generalizes to the long term the short-run pricing model for computer networks developed in Kriebel and Mikhail [5]. The environment assumes heterogeneous resource capacities by age (vingate), which service a heterogeneous and relatively captive market of users with known demand functions in each time period. Total variable operating costs are given by a continuous psuedoconcave function of system load, capacity, and resource age. Optimal investment, pricing, and replacement decision rules are derived in the presence of economies of scale and exogenous technological progress. Myopic properties of the decision rules which define natural (finite) planning subhorizons are discussed. 相似文献
43.
Charles A. Holloway 《海军后勤学研究》1977,24(2):377-380
Using the general computational strategy of restriction, necessary conditions for optimality provide an alternative criterion for entering variables when degeneracies arises in linear programming problems. Although cycling may still occur, it is shown that if it is possible to make progress at the next iteration, the criterion is guaranteed to identify a non-basic variable which increases the value of the basic solution, thereby reducing stalling. An alternative method for determining variables to exit the basis when degeneracies occur is also suggested. 相似文献
44.
S. Christian Albright 《海军后勤学研究》1976,23(1):151-159
This paper deals with the Secretary Problem where n secretaries are interviewed sequentially and the best k must be hired. The values of the secretaries are observed as they are interviewed, but beforehand only the distributions of these values are known. Furthermore, the distributions of two successive secretaries' values are governed by a Markov chain. Optimal hiring policies for finite n and limiting optimal policies as k and n approach infinity are obtained. 相似文献
45.
In this note we analyze the fractional interval programming problem (FIP) and find, explicitly, all its optimal solutions. Though our results are essentially the same as those in Charnes and Cooper [4], the proofs and analysis we provide here are considerably simpler. 相似文献
46.
The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems. 相似文献
47.
A Linear Fractional Interval Programming problem (FIP) is the problem of extremizing a linear fractional function subject to two-sided linear inequality constraints. In this paper we develop an algorithm for solving (FIP) problems. We first apply the Charnes and Cooper transformation on (FIP) and then, by exploiting the special structure of the pair of (LP) problems derived, the algorithm produces an optimal solution to (FIP) in a finite number of iterations. 相似文献
48.
Christopher G. Pernin Angela O’Mahony Thomas S. Szayna Derek Eaton Katharina Ley Best Elizabeth Bodine-Baron 《Defense & Security Analysis》2017,33(3):209-222
US national security guidance, as well as the US Army’s operational experiences since 2001, emphasizes the importance of working closely with partner countries to achieve US strategic objectives. The US Army has introduced the global landpower network (GLN) concept as a means to integrate, sustain and advance the Army’s considerable ongoing efforts to meet US national security guidance. This study develops the GLN concept further, and addresses three questions. What benefits can the GLN provide the Army? What are the essential components of the GLN? What options exist for implementing the GLN concept? By developing the GLN concept, the Army has the opportunity to transition the GLN from an often ad hoc and reactive set of relationships to one that the Army more self-consciously prioritizes and leverages as a resource to meet US strategic objectives. 相似文献
49.
This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
50.
In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献