全文获取类型
收费全文 | 426篇 |
免费 | 18篇 |
国内免费 | 1篇 |
出版年
2021年 | 6篇 |
2019年 | 12篇 |
2018年 | 13篇 |
2017年 | 8篇 |
2016年 | 9篇 |
2015年 | 7篇 |
2014年 | 10篇 |
2013年 | 98篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 5篇 |
2009年 | 4篇 |
2008年 | 5篇 |
2007年 | 4篇 |
2006年 | 8篇 |
2005年 | 7篇 |
2004年 | 5篇 |
2003年 | 6篇 |
2002年 | 4篇 |
2000年 | 3篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 8篇 |
1995年 | 5篇 |
1994年 | 7篇 |
1993年 | 11篇 |
1992年 | 8篇 |
1991年 | 8篇 |
1989年 | 10篇 |
1988年 | 7篇 |
1987年 | 6篇 |
1986年 | 7篇 |
1985年 | 10篇 |
1984年 | 8篇 |
1983年 | 4篇 |
1982年 | 6篇 |
1981年 | 4篇 |
1980年 | 9篇 |
1979年 | 7篇 |
1978年 | 8篇 |
1976年 | 8篇 |
1975年 | 10篇 |
1974年 | 8篇 |
1973年 | 11篇 |
1972年 | 6篇 |
1971年 | 4篇 |
1970年 | 6篇 |
1969年 | 5篇 |
1968年 | 5篇 |
1967年 | 3篇 |
排序方式: 共有445条查询结果,搜索用时 15 毫秒
61.
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. 相似文献
62.
A method is presented to locate and allocate p new facilities in relation to n existing facilities. Each of the n existing facilities has a requirement flow which must be supplied by the new facilities. Rectangular distances are assumed to exist between all facilities. The algorithm proceeds in two stages. In the first stage a set of all possible optimal new facility locations is determined by a set reduction algorithm. The resultant problem is shown to be equivalent to finding the p-median of a weighted connected graph. In the second stage the optimal locations and allocations are obtained by using a technique for solving the p-median problem. 相似文献
63.
James G. Taylor 《海军后勤学研究》1975,22(4):617-650
The treatment of force-level constraints in time-sequential combat optimization problems is illustrated by further studying the fire-programming problem of Isbell and Marlow. By using the theory of state variable inequality constraints from modern optimal control theory, sharper results are obtained on necessary conditions of optimality for an optimal fire-distribution policy (in several cases justifying conjectures made in previous analysis). This leads to simplification of the determination of the domains of controllability for extremals leading to the various terminal states of combat. (Additionally, some new results for the determination of boundary conditions for the adjoint variables in optimal control problems with state variable inequality constraints have arisen from this work.) Some further extensions of previous analysis of the fire-programming problem are also given. These clarify some key points in the solution synthesis. Some important military principles for target selection and the valuation of combat resources are deduced from the solution. As a result of this work, more general time-sequential combat optimization problems can be handled, and a more systematic solution procedure is developed. 相似文献
64.
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. 相似文献
65.
This paper investigates the effect on the optimum solution of a (capacitated) transportation problem when the data of the problem (the rim conditions-i. e., the warehouse supplies and market demands-the per unit transportation costs and the upper bounds) are continuously varied as a (linear) function of a single parameter. An operator theory is developed and algorithms provided for applying rim and cost operators that effect the transformation of optimum solution associated with changes in rim conditions and unit costs. Bound operators that effect changes in upper bounds are shown to be equivalent to rim operators. The discussion in this paper is limited to basis preserving operators for which the changes in the data are such that the optimum basis structures are preserved. 相似文献
66.
This paper describes a linear programming model used to perform cost-effectiveness analysis to determine the requirements for military strategic mobility resources. Expenditures for three classes of economic alternatives are considered: purchase of transportation resources; prepositioning of material; and augmentation of port facilities. The mix of economic alternatives that maximizes the effectiveness of the resultant transportation system is determined for a given investment level. By repeating the analysis for several levels of investment, a cost-effectiveness tradeoff curve can be developed. 相似文献
67.
This article is concerned with the optimal location of any number (n) of facilities in relation to any number (m) of destinations on the Euclidean plane. The criterion to be satisfied is the minimization of total weighted distances where the distances are rectangular. The destinations may be either single points, lines or rectangular areas. A gradient reduction solution procedure is described which has the property that the direction of descent is determined by the geometrical properties of the problem. 相似文献
68.
Rendezvous search finds the strategies that players should use in order to find one another when they are separated in a region. Previous papers have concentrated on the case where there are two players searching for one another. This paper looks at the problem when there are more than two players and concentrates on what they should do if some but not all of them meet together. It looks at two strategies—the stick together one and the split up and meet again one. This paper shows that the former is optimal among the class of strategies which require no memory and are stationary, and it gives a method of calculating the expected rendezvous time under it. However, simulation results comparing both strategies suggest that in most situations the split up and meet again strategy which requires some memory leads to faster expected rendezvous times. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:710–721, 2001 相似文献
69.
We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001 相似文献
70.
We consider a class of partitioning problems where the partitioned set is a finite set of real numbers and the objective function of a partition is a function of the vector whose coordinates are the sums of the elements in each part of the given partition (the number of such parts is assumed given). We obtain an explicit solution of such partitioning problem with polynomial complexity bounds. © John Wiley & Sons, Inc. Naval Research Logistics 47: 531–540, 2000 相似文献