全文获取类型
收费全文 | 893篇 |
免费 | 21篇 |
出版年
2021年 | 14篇 |
2019年 | 29篇 |
2018年 | 19篇 |
2017年 | 20篇 |
2016年 | 20篇 |
2015年 | 20篇 |
2014年 | 11篇 |
2013年 | 166篇 |
2011年 | 8篇 |
2009年 | 9篇 |
2008年 | 8篇 |
2007年 | 11篇 |
2006年 | 11篇 |
2005年 | 15篇 |
2004年 | 16篇 |
2003年 | 10篇 |
2002年 | 8篇 |
2000年 | 14篇 |
1999年 | 10篇 |
1998年 | 12篇 |
1997年 | 24篇 |
1996年 | 19篇 |
1994年 | 18篇 |
1993年 | 7篇 |
1992年 | 11篇 |
1991年 | 22篇 |
1990年 | 12篇 |
1989年 | 19篇 |
1988年 | 12篇 |
1987年 | 21篇 |
1986年 | 16篇 |
1985年 | 16篇 |
1984年 | 12篇 |
1983年 | 15篇 |
1982年 | 13篇 |
1981年 | 13篇 |
1980年 | 16篇 |
1979年 | 17篇 |
1978年 | 14篇 |
1977年 | 15篇 |
1976年 | 14篇 |
1975年 | 12篇 |
1974年 | 18篇 |
1973年 | 18篇 |
1972年 | 15篇 |
1971年 | 19篇 |
1970年 | 9篇 |
1969年 | 11篇 |
1968年 | 10篇 |
1967年 | 8篇 |
排序方式: 共有914条查询结果,搜索用时 15 毫秒
121.
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. 相似文献
122.
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. 相似文献
123.
The hyperbolic integer program is treated as a special case of a hyperbolic program with a finite number of feasible points. The continuous hyperbolic program also belongs to this class since its solution can be obtained by considering only the extreme points of the feasible set. A general algorithm for solving the hyperbolic integer program which reduces to solving a sequence of linear integer problems is proposed. When the integer restriction is removed, this algorithm is similar to the Isbell-Marlow procedure. The geometrical aspects of the hyperbolic problem are also discussed and several cutting plane algorithms are given. 相似文献
124.
M. S. Bazaraa 《海军后勤学研究》1973,20(2):357-366
In this study we interpret the exterior penalty function method as a generalized lagrangian metliod which fills duality gaps in nonconvex problems. Geometry and resolution of these gaps from a duality point of view are highlighted. 相似文献
125.
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. 相似文献
126.
Robert A. Agnew 《海军后勤学研究》1972,19(1):137-143
Suppose that a contractor is faced with a sequence of “minimum bid wins contract” competitions. Assuming that a contractor knows his cost to fulfill the contract at each competition and that competitors are merely informed whether or not they have won, bids may be selected sequentially via a tailored stochastic approximation procedure. The efficacy of this approach in certain bidding environments is investigated. 相似文献
127.
Models are formulated for determining continuous review (Q, r) policies for a multiitem inventory subject to constraints. The objective function is the minimization of total time-weighted shortages. The constraints apply to inventory investment and reorder workload. The formulations are thus independent of the normal ordering, holding, and shortage costs. Two models are presented, each representing a convex programming problem. Lagrangian techniques are employed with the first, simplified model in which only the reorder points are optimized. In the second model both the reorder points and the reorder quantities are optimized utilizing penalty function methods. An example problem is solved for each model. The final section deals with the implementation of these models in very large inventory systems. 相似文献
128.
129.
130.