全文获取类型
收费全文 | 914篇 |
免费 | 14篇 |
出版年
2021年 | 9篇 |
2019年 | 18篇 |
2018年 | 11篇 |
2017年 | 22篇 |
2016年 | 19篇 |
2015年 | 19篇 |
2014年 | 11篇 |
2013年 | 143篇 |
2012年 | 23篇 |
2011年 | 31篇 |
2010年 | 27篇 |
2009年 | 18篇 |
2008年 | 30篇 |
2007年 | 19篇 |
2006年 | 22篇 |
2005年 | 16篇 |
2004年 | 11篇 |
2001年 | 7篇 |
2000年 | 10篇 |
1999年 | 8篇 |
1998年 | 11篇 |
1997年 | 15篇 |
1996年 | 13篇 |
1995年 | 7篇 |
1994年 | 14篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 20篇 |
1990年 | 10篇 |
1989年 | 22篇 |
1988年 | 9篇 |
1987年 | 19篇 |
1986年 | 18篇 |
1985年 | 18篇 |
1984年 | 9篇 |
1983年 | 12篇 |
1982年 | 11篇 |
1981年 | 14篇 |
1980年 | 19篇 |
1979年 | 17篇 |
1978年 | 12篇 |
1977年 | 14篇 |
1976年 | 13篇 |
1975年 | 13篇 |
1974年 | 13篇 |
1973年 | 9篇 |
1972年 | 19篇 |
1971年 | 16篇 |
1969年 | 15篇 |
1968年 | 10篇 |
排序方式: 共有928条查询结果,搜索用时 15 毫秒
111.
112.
We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ1, κ2 are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature. 相似文献
113.
D J L Moore 《Whitehall Papers》2013,80(1):13-22
Abstract David Moore analyses the role of the Treasury in detemining and controlling defence policy and expenditure, and the place of the MoD within this function. 相似文献
114.
Stephen A. Book 《海军后勤学研究》1974,21(3):549-556
An asymptotic representation for large deviation probabilities of the Winsorized mean of a sequence of independent, identically distributed exponential random variables is derived. The Winsorized mean, a linear combination of exponential order statistics, is first transformed into a weighted sum of exponential random variables, and then a large deviation theorem for weighted sums can be applied. The representation obtained is then compared with results already known for the mean and the median, the two extreme cases of the Winsorized mean. 相似文献
115.
This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network. 相似文献
116.
Let X1 < X2 <… < Xn denote an ordered sample of size n from a Weibull population with cdf F(x) = 1 - exp (?xp), x > 0. Formulae for computing Cov (Xi, Xj) are well known, but they are difficult to use in practice. A simple approximation to Cov(Xi, Xj) is presented here, and its accuracy is discussed. 相似文献
117.
A. Victor Cabot 《海军后勤学研究》1974,21(2):265-274
A cutting plane method for solving concave minimization problems with linear constraints has been advanced by Tui. The principle behind this cutting plane has been applied to integer programming by Balas, Young, Glover, and others under the name of convexity cuts. This paper relates the question of finiteness of Tui's method to the so-called generalized lattice point problem of mathematical programming and gives a sufficient condition for terminating Tui's method. The paper then presents several branch-and-bound algorithms for solving concave minimization problems with linear constraints with the Tui cut as the basis for the algorithm. Finally, some computational experience is reported for the fixed-charge transportation problem. 相似文献
118.
This paper gives a new organization of the theoretical results of the Generalized Transportation Problem with capacity constraints. A graph-theoretic approach is utilized to define the basis as a one-forest consisting of one-trees (a tree with an extra edge). Algorithmic development of the pivot-step is presented by the representation of a two-tree (a tree with two extra edges). Constructive procedures and proofs leading to an efficient computer code are provided. The basic definition of an operator theory which leads to the discussion of various operators is also given. In later papers we will present additional results on the operator theory for the generalized transportation problem based on the results in the present paper. 相似文献
119.
Edward A. Silver 《海军后勤学研究》1973,20(2):241-254
This paper does not present a new result, rather it is meant to illustrate the choice of modelling procedures available to an analyst in a typical inventory control problem. The same “average cost per unit time” expression is developed by three quite different procedures. This variety of approaches, as well as the recounting of the author's chronological efforts to solve the problem, should be of interest to the reader. The specific inventory problem studied is one where the controller of an item is faced with random opportunities for replenishment at a reduced setup cost; the problem is an integral component of the broader problem of inventory control of a group of items whose replenishments are coordinated to reduce the costs of production, procurement, and/or transportation. 相似文献
120.
A complete analysis and explicit solution is presented for the problem of linear fractional programming with interval programming constraints whose matrix is of full row rank. The analysis proceeds by simple transformation to canonical form, exploitation of the Farkas-Minkowki lemma and the duality relationships which emerge from the Charnes-Cooper linear programming equivalent for general linear fractional programming. The formulations as well as the proofs and the transformations provided by our general linear fractional programming theory are here employed to provide a substantial simplification for this class of cases. The augmentation developing the explicit solution is presented, for clarity, in an algorithmic format. 相似文献