全文获取类型
收费全文 | 1041篇 |
免费 | 21篇 |
出版年
2021年 | 14篇 |
2019年 | 27篇 |
2018年 | 17篇 |
2017年 | 17篇 |
2016年 | 17篇 |
2015年 | 14篇 |
2014年 | 11篇 |
2013年 | 175篇 |
2010年 | 11篇 |
2008年 | 10篇 |
2007年 | 18篇 |
2005年 | 14篇 |
2004年 | 16篇 |
2003年 | 14篇 |
2002年 | 10篇 |
2001年 | 10篇 |
2000年 | 13篇 |
1999年 | 9篇 |
1998年 | 16篇 |
1997年 | 19篇 |
1996年 | 26篇 |
1995年 | 10篇 |
1994年 | 16篇 |
1993年 | 19篇 |
1992年 | 18篇 |
1991年 | 26篇 |
1990年 | 19篇 |
1989年 | 36篇 |
1988年 | 27篇 |
1987年 | 25篇 |
1986年 | 26篇 |
1985年 | 21篇 |
1984年 | 17篇 |
1983年 | 11篇 |
1982年 | 20篇 |
1981年 | 18篇 |
1980年 | 24篇 |
1979年 | 18篇 |
1978年 | 19篇 |
1977年 | 16篇 |
1976年 | 15篇 |
1975年 | 14篇 |
1974年 | 22篇 |
1973年 | 14篇 |
1972年 | 14篇 |
1971年 | 22篇 |
1970年 | 10篇 |
1969年 | 14篇 |
1968年 | 9篇 |
1967年 | 11篇 |
排序方式: 共有1062条查询结果,搜索用时 15 毫秒
11.
The production-location problem of a profit maximizing firm is considered. A model is developed for a single firm, facing the joint problems of determining the optimal plant location, the optimal input mix, and the optimal plant size. A homothetic production function is used as the model of the production technologies, and the existence of a sequential “separability” between the production, or input mix, problem and the location problem is demonstrated. 相似文献
12.
This article shows how simple systems of linear equations with {0,1} variables can be aggregated into a single linear equation whose {0,1} solutions are identical to the solutions of the original system. Structures of the original systems are exploited to keep the aggregator's integer coefficients from becoming unnecessarily large. The results have potential application in integer programming and information theory, especially for problems that contain assignment-type constraints along with other constraints. Several unresolved questions of a number-theoretic nature are mentioned at the conclusion of the article. 相似文献
13.
In this article, we examine the problem of producing a spanning Eulerian subgraph in an undirected graph. After the ?-completeness of the general problem is established, we present polynomial-time algorithms for both the maximization and minimization versions where instances are defined on a restricted class of graphs referred to as series-parallel. Some novelties in the minimization case are discussed, as are heuristic ideas. 相似文献
14.
15.
16.
17.
Procedures for solving multiple criteria problems are receiving increasing attention. Two major solution approaches are those involving prior articulation and progressive articulation of preference information. A progressive articulation (interactive) optimization approach, called the Paired Comparison Method (PCM) is compared to the prior articulation approach of a priori utility function measurement in a quality control decision environment from the perspective of the decision maker. The three major issues investigated included: (1) the ease of use of each method, (2) the preferences of solutions obtained, and (3) the insight provided by the methodology into the nature and structure of the problem. The problem setting involved management students who were rquired to determine an acceptance sampling plan using both methods. The PCM provided the most preferred solutions and was considered easier to use and understand. The prior articulation of preference method was found to give more insight into the problem structure. The results suggest that a hybrid approach, combining both prior preference assessment and an interactive procedure exploiting the advantages of each, should be employed to solve multiple criteria problems. 相似文献
18.
John R. McNamara 《海军后勤学研究》1986,33(3):501-512
A posynomial geometric programming problem formulated so that the number of objective function terms is equal to the number of primal variables will have a zero degree of difficulty when augmented by multiplying each constraint term by a slack variable and including a surrogate constraint composed of the product of the slack variables, each raised to an undetermined negative exponent or surrogate multiplier. It is assumed that the original problem is canonical. The exponents in the constraint on the product of the slack variables must be estimated so that the associated solution to the augmented problem, obtained immediately, also solves the original problem. An iterative search procedure for finding the required exponents, thus solving the original problem, is described. The search procedure has proven quite efficient, often requiring only two or three iterations per degree of difficulty of the original problem. At each iteration the well-known procedure for solving a geometric programming problem with a zero degree of difficulty is used and so computations are simple. The solution generated at each iteration is optimal for a problem which differs from the original problem only in the values of some of the constraint coefficients, so intermediate solutions provide useful information. 相似文献
19.
A probabilistic model is developed that applies to military bombardment, advertising for a mass audience, and other kinds of situations in which striking a target means that less of it is left to strike. The model provides the basis for decision analysis based on marginal gain in such circumstances. Heterogneous resources are considered as well as composite targets. All expenditures are quantized. The model has been developed as part of a computer-based military expert system, to replace a large complex set of expert opinions. In that application it sharply improves efficiency, yet conforms to major tenets of tactical doctrine. 相似文献
20.