全文获取类型
收费全文 | 697篇 |
免费 | 15篇 |
出版年
2021年 | 11篇 |
2020年 | 8篇 |
2019年 | 25篇 |
2018年 | 14篇 |
2017年 | 19篇 |
2016年 | 17篇 |
2015年 | 14篇 |
2014年 | 13篇 |
2013年 | 155篇 |
2011年 | 7篇 |
2009年 | 8篇 |
2008年 | 7篇 |
2007年 | 7篇 |
2006年 | 7篇 |
2005年 | 12篇 |
2004年 | 9篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 9篇 |
1998年 | 10篇 |
1997年 | 17篇 |
1996年 | 9篇 |
1995年 | 9篇 |
1994年 | 14篇 |
1992年 | 11篇 |
1991年 | 22篇 |
1989年 | 9篇 |
1988年 | 9篇 |
1987年 | 20篇 |
1986年 | 12篇 |
1985年 | 11篇 |
1984年 | 6篇 |
1983年 | 10篇 |
1982年 | 9篇 |
1981年 | 6篇 |
1980年 | 11篇 |
1979年 | 12篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1976年 | 9篇 |
1975年 | 10篇 |
1974年 | 13篇 |
1973年 | 16篇 |
1972年 | 7篇 |
1971年 | 7篇 |
1970年 | 10篇 |
1969年 | 7篇 |
1968年 | 7篇 |
1967年 | 6篇 |
排序方式: 共有712条查询结果,搜索用时 125 毫秒
81.
Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n3) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n3) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
82.
This paper presents a model for choosing a minimum-cost mix of strategic defenses to assure that specified production capacities for several economic sectors survive after a nuclear attack. The defender selects a mix of strategic defenses for each of several geographic regions. The attacker chooses an allocation of attacking weapons to geographic regions, within specified weapon inventories. The attack is optimized against any economic sector. This formulation allows the defense planner the capability to assess the results of the optimal defense structure for a “worst case” attack. The model is a mathematical program with nonlinear programming problems in the constraints; an example of its application is given and is solved using recently developed optimization techniques. 相似文献
83.
James G. Taylor 《海军后勤学研究》1974,21(1):79-106
The optimization of the dynamics of combat (optimal distribution of fire over enemy target types) is studied through a sequence of idealized models by use of the mathematical theory of optimal control. The models are for combat over a period of time described by Lanchester-type equations with a choice of tactics available to one side and subject to change with time. The structure of optimal fire distribution policies is discussed with reference to the influence of combatant objectives, termination conditions of the conflict, type of attrition process, and variable attrition-rate coefficients. Implications for intelligence, command and control systems, and human decision making are pointed out. The use of such optimal control models for guiding extensions to differential games is discussed. 相似文献
84.
A basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A number of algorithms have been developed for finding solutions, and this paper reports a comparative evaluation of these procedures. Computer programs for five separate algorithms were written and all were run on a data base designed to highlight computational differences. Optimizing algorithms developed by Emmons and by Srinivasan appeared to be particularly efficient in the comparative study. 相似文献
85.
Computerized Scheduling of Seagoing Tankers The tanker scheduling problem considered in this paper is that of the Defense Fuel Supply Center (DFSC) and the Military Sealift Command (MSC) in the worldwide distribution of bulk petroleum products. Routes and cargoes which meet delivery schedule dates for a multiplicity of product requirements at minimum cost are to be determined for a fleet of tankers. A general mathematical programming model is presented, and then a mixed integer model is developed which attempts to reflect the true scheduling task of DFSC and MSC as closely as possible. The problem is kept to within a workable size by the systematic construction of a set of tanker routes which does not contain many possible routes that can be judged unacceptable from practical considerations alone. 相似文献
86.
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. 相似文献
87.
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. 相似文献
88.
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. 相似文献
89.
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. 相似文献
90.