全文获取类型
收费全文 | 1171篇 |
免费 | 6篇 |
国内免费 | 9篇 |
专业分类
化学 | 10篇 |
力学 | 11篇 |
综合类 | 4篇 |
数学 | 1131篇 |
物理学 | 30篇 |
出版年
2023年 | 10篇 |
2022年 | 10篇 |
2021年 | 4篇 |
2020年 | 9篇 |
2019年 | 16篇 |
2018年 | 11篇 |
2017年 | 4篇 |
2016年 | 11篇 |
2015年 | 12篇 |
2014年 | 46篇 |
2013年 | 54篇 |
2012年 | 109篇 |
2011年 | 46篇 |
2010年 | 55篇 |
2009年 | 88篇 |
2008年 | 93篇 |
2007年 | 80篇 |
2006年 | 60篇 |
2005年 | 24篇 |
2004年 | 22篇 |
2003年 | 14篇 |
2002年 | 20篇 |
2001年 | 19篇 |
2000年 | 17篇 |
1999年 | 11篇 |
1998年 | 20篇 |
1997年 | 10篇 |
1996年 | 18篇 |
1995年 | 7篇 |
1994年 | 13篇 |
1993年 | 7篇 |
1992年 | 10篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 15篇 |
1985年 | 33篇 |
1984年 | 30篇 |
1983年 | 22篇 |
1982年 | 28篇 |
1981年 | 16篇 |
1980年 | 30篇 |
1979年 | 20篇 |
1978年 | 31篇 |
1977年 | 10篇 |
1972年 | 2篇 |
1969年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有1186条查询结果,搜索用时 15 毫秒
51.
A multiplier method with automatic limitation of penalty growth 总被引:3,自引:0,他引:3
This paper presents a multiplier method for solving optimization problems with equality and inequality constraints. The method realizes all the good features that were foreseen by R. Fletcher for this type of algorithm in the past, but which suffers from none of the drawbacks of the earlier attempts.Research sponsored by the National Science Foundation (RANN) Grant ENV76-04264 the National Science Foundation Grant ENG73-08214-A01 and the Sweden-American Foundation. 相似文献
52.
Fern Sassower Sisser 《Mathematical Programming》1981,20(1):110-121
The problem of minimizing a nonlinear objective function ofn variables, with continuous first and second partial derivatives, subject to nonnegativity constraints or upper and lower bounds on the variables is studied. The advisability of solving such a constrained optimization problem by making a suitable transformation of its variables in order to change the problem into one of unconstrained minimization is considered. A set of conditions which guarantees that every local minimum of the new unconstrained problem also satisfies the first-order necessary (Kuhn—Tucker) conditions for a local minimum of the original constrained problem is developed. It is shown that there are certain conditions under which the transformed objective function will maintain the convexity of the original objective function in a neighborhood of the solution. A modification of the method of transformations which moves away from extraneous stationary points is introduced and conditions under which the method generates a sequence of points which converges to the solution at a superlinear rate are given. 相似文献
53.
Graver's optimality conditions based on Hilbert bases apply to an integer program with linear equations and a linear objective function. We generalize this result to include a fairly large class of nonlinear objective functions. Our extension provides in particular a link between the superadditivity of the difference-objective function and the Hilbert bases of conic subpartitions of . 相似文献
54.
Our model is a generalized linear programming relaxation of a much studied random K-SAT problem. Specifically, a set of linear constraints on K variables is fixed. From a pool of n variables, K variables are chosen uniformly at random and a constraint is chosen from also uniformly at random. This procedure is repeated m times independently. We are interested in whether the resulting linear programming problem is feasible. We prove that the feasibility property experiences a linear phase transition, when n and m = cn for a constant c. Namely, there exists a critical value c* such that, when c < c*, the problem is feasible or is asymptotically almost feasible, as n, but, when c>c*, the distance to feasibility is at least a positive constant independent of n. Our result is obtained using the combination of a powerful local weak convergence method developed in Aldous [Ald92], [Ald01], Aldous and Steele [AS03], Steele [Ste02] and martingale techniques. By exploiting a linear programming duality, our theorem implies the following result in the context of sparse random graphs G(n, cn) on n nodes with cn edges, where edges are equipped with randomly generated weights. Let (n, c) denote maximum weight matching in G(n, cn). We prove that when c is a constant and n , the limit limn (n, c)/n, exists, with high probability. We further extend this result to maximum weight b-matchings also in G(n, cn). 相似文献
55.
Adam?N.?LetchfordEmail author Andrea?Lodi 《4OR: A Quarterly Journal of Operations Research》2003,1(3):209-224
Given an integer polyhedron
, an integer point
, and a point
, the primal separation problem is the problem of finding a linear inequality which is valid for P
I
, violated by x
*, and satisfied at equality by
. The primal separation problem plays a key role in the primal approach to integer programming. In this paper we examine the complexity of primal separation for several well-known classes of inequalities for various important combinatorial optimization problems, including the knapsack, stable set and travelling salesman problems.Received: November 2002, Revised: March 2003, 相似文献
56.
Wies?awa T. Obuchowska 《European Journal of Operational Research》2012,218(1):58-67
In this paper we address the problem of the infeasibility of systems defined by reverse convex inequality constraints, where some or all of the variables are integer. In particular, we provide a polynomial algorithm that identifies a set of all constraints critical to feasibility (CF), that is constraints that may affect a feasibility status of the system after some perturbation of the right-hand sides. Furthermore, we will investigate properties of the irreducible infeasible sets and infeasibility sets, showing in particular that every irreducible infeasible set as well as infeasibility sets in the considered system, are subsets of the set CF of constraints critical to feasibility. 相似文献
57.
On the resolution and optimization of a system of fuzzy relational equations with sup-T composition 总被引:3,自引:2,他引:1
This paper provides a thorough investigation on the resolution of a finite system of fuzzy relational equations with sup-T composition, where T is a continuous triangular norm. When such a system is consistent, although we know that the solution set can be characterized
by a maximum solution and finitely many minimal solutions, it is still a challenging task to find all minimal solutions in
an efficient manner. Using the representation theorem of continuous triangular norms, we show that the systems of sup-T equations can be divided into two categories depending on the involved triangular norm. When the triangular norm is Archimedean,
the minimal solutions correspond one-to-one to the irredundant coverings of a set covering problem. When it is non-Archimedean, they only correspond to a subset of constrained irredundant coverings of a set covering problem. We then show that the problem of minimizing a linear objective function subject to a system of sup-T equations can be reduced into a 0–1 integer programming problem in polynomial time. This work generalizes most, if not all,
known results and provides a unified framework to deal with the problem of resolution and optimization of a system of sup-T equations. Further generalizations and related issues are also included for discussion. 相似文献
58.
In this research, the main purpose is to formulate a model to determine the optimum investment on port development from national investment prospective; on the other hand, costs and benefits are calculated from consumer and investor’s viewpoint. The formulated model is an integer-programming model. The emphasis is on how to formulate an investment optimization problem where cargo operation, investment costs, cargo-handling capacity, cargo transportation network, and the world maritime fleet constraints are included. Fuzzy numbers are used for cargo forecast study results. The output of the model is the type of design ships and design berths which are needed in each sub period, so that the port planner (the government) will find out the optimum development plan of port in each sub period when there is uncertainty in cargo handling forecast (fuzzy numbers). 相似文献
59.
This paper considers the scenario of supply chain with multiple products and multiple suppliers, all of which have limited capacity. We assume that received items from suppliers are not of perfect quality. Items of imperfect quality, not necessarily defective, could be used in another inventory situation. Imperfect items are sold as a single batch, prior to receiving the next shipment, at a discounted price. The demand over a finite planning horizon is known, and an optimal procurement strategy for this multi-period horizon is to be determined. Each of products can be sourced from a set of approved suppliers, a supplier-dependent transaction cost applies for each period in which an order is placed on a supplier. A product-dependent holding cost per period applies for each product in the inventory that is carried across a period in the planning horizon. Also a maximum storage space for the buyer in each period is considered. The decision maker, the buyer, needs to decide what products to order, in what quantities, with which suppliers, and in which periods. Finally, a genetic algorithm (GA) is used to solve the model. 相似文献
60.
Jesús A. De Loera Raymond Hemmecke Matthias Köppe Robert Weismantel 《Mathematical Programming》2008,115(2):273-290
We show the existence of a fully polynomial-time approximation scheme (FPTAS) for the problem of maximizing a non-negative
polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed. Moreover, using a weaker notion
of approximation, we show the existence of a fully polynomial-time approximation scheme for the problem of maximizing or minimizing
an arbitrary polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed.
A conference version of this article, containing a part of the results presented here, appeared in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22–24, 2006, pp. 743–748. The first author gratefully acknowledges support from NSF grant DMS-0608785, a 2003 UC-Davis Chancellor’s fellow award,
the Alexander von Humboldt foundation, and IMO Magdeburg. The remaining authors were supported by the European TMR network
ADONET 504438. 相似文献