全文获取类型
收费全文 | 605篇 |
免费 | 2篇 |
专业分类
化学 | 7篇 |
力学 | 11篇 |
综合类 | 4篇 |
数学 | 567篇 |
物理学 | 18篇 |
出版年
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 2篇 |
2020年 | 3篇 |
2018年 | 1篇 |
2017年 | 2篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2014年 | 14篇 |
2013年 | 28篇 |
2012年 | 75篇 |
2011年 | 15篇 |
2010年 | 9篇 |
2009年 | 28篇 |
2008年 | 13篇 |
2007年 | 23篇 |
2006年 | 25篇 |
2005年 | 14篇 |
2004年 | 10篇 |
2003年 | 7篇 |
2002年 | 17篇 |
2001年 | 14篇 |
2000年 | 11篇 |
1999年 | 9篇 |
1998年 | 10篇 |
1997年 | 6篇 |
1996年 | 15篇 |
1995年 | 6篇 |
1994年 | 11篇 |
1993年 | 6篇 |
1992年 | 8篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 15篇 |
1985年 | 26篇 |
1984年 | 25篇 |
1983年 | 19篇 |
1982年 | 24篇 |
1981年 | 15篇 |
1980年 | 28篇 |
1979年 | 19篇 |
1978年 | 30篇 |
1977年 | 5篇 |
1972年 | 2篇 |
1969年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有607条查询结果,搜索用时 21 毫秒
71.
Jonathan E. Spingarn 《Mathematical Programming》1985,32(2):199-223
A primal–dual decomposition method is presented to solve the separable convex programming problem. Convergence to a solution and Lagrange multiplier vector occurs from an arbitrary starting point. The method is equivalent to the proximal point algorithm applied to a certain maximal monotone multifunction. In the nonseparable case, it specializes to a known method, the proximal method of multipliers. Conditions are provided which guarantee linear convergence.This research was sponsored, in part, by the Air Force Office of Scientific Research under grant 80-0195. 相似文献
72.
G. Tinhofer 《Mathematical Programming》1984,28(3):337-348
A graphsack problem is a certain binary linear optimization problem with applications in optimal network design. From there
a rational graphsack problem is derived by allowing the variables to vary continuously between 0 and 1. In this paper we deal
with rational graphsack problems. First we develop the concept of compressed solutions and the concept of augmenting cuts.
Making use of these concepts a very simple optimality criterion is derived. Finally an efficient algorithm solving rational
graphsack problems is given which is polynomially bounded in time and which is closely related to the simplex algorithm. 相似文献
73.
A hybrid approach to discrete mathematical programming 总被引:9,自引:0,他引:9
The dynamic programming and branch-and-bound approaches are combined to produce a hybrid algorithm for separable discrete mathematical programs. Linear programming is used in a novel way to compute bounds. Every simplex pivot permits a bounding test to be made on every active node in the search tree. Computational experience is reported. 相似文献
74.
Elmor L. Peterson 《Mathematical Programming》1977,12(1):392-405
F.E. Clark has shown that if at least one of the feasible solution sets for a pair of dual linear programming problems is nonempty then at least one of them is both nonempty and unbounded. Subsequently, M. Avriel and A.C. Williams have obtained the same result in the more general context of (prototype posynomial) geometric programming. In this paper we show that the same result is actually false in the even more general context of convex programming — unless a certain regularity condition is satisfied.We also show that the regularity condition is so weak that it is automatically satisfied in linear programming (prototype posynomial) geometric programming, quadratic programming (with either linear or quadratic constraints),l
p
-regression analysis, optimal location, roadway network analysis, and chemical equilibrium analysis. Moreover, we develop an equivalent regularity condition for each of the usual formulations of duality.Research sponsored by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR-73-2516. 相似文献
75.
Jean-François Pusztaszeri Paul E. Rensing Thomas M. Liebling 《Journal of Global Optimization》1996,9(1):41-64
Colliding beams experiments in High Energy Physics rely on solid state detectors to track the flight paths of charged elementary particles near their primary point of interaction. Reconstructing tracks in this region requires, per collision, a partitioning of up to 103 highly correlated observations into an unknown number of tracks. We report on the successful implementation of a combinatorial track finding algorithm to solve this pattern recognition problem in the context of the ALEPH experiment at CERN. Central to the implementation is a 5-dimensional axial assignment model (AP5) encompassing noise and inefficiencies of the detector, whose weights of assignments are obtained by means of an extended Kalman filter. A preprocessing step, involving the clustering and geometric partitioning of the observations, ensures reasonable bounds on the size of the problems, which are solved using a branch & bound algorithm with LP relaxation. Convergence is reached within one second of CPU time on a RISC workstation in average. 相似文献
76.
非光滑半无限多目标规划弱非控解的充分性 总被引:4,自引:0,他引:4
张庆祥 《高校应用数学学报(A辑)》1996,(4):461-466
本文利用锥次微分的概念,在一点处定义了η-(A,N)凸函数、η-(A,N)伪凸函数和η-(A,N)严格伪凸函数,在相当弱的假设下,在η-(A,N)意义下,给出了非光滑η-(A,N)凸半无限多目标规划弱非控解的一些充分条件。 相似文献
77.
Cost minimization multi-product production problems with static production resource usage and internal product flow requirements have been solved by linear programming (LP) with input/output analysis. If the problem is complicated by interval resource estimates, interval linear programming (ILP) can be used. The solution of realistic problems by the above method is cumbersome. This paper suggests that linear goal programming (LGP) can be used to model a multi-product production system. LGP's unique modeling capabilities are used to solve a production planning problem with variable resource parameters. Input/output analysis is used to determine the technological coefficients for the goal constraints and is also used to derive an information sub-model that is used to reduce the number of variable resource goal constraints. Preliminary findings suggest that the LGP approach is more cost-efficient (in terms of CPU time) and in addition provides valuable information for aggregate planning. 相似文献
78.
Robert Fourer 《Mathematical Programming》1983,25(3):251-292
This and a companion paper consider how current implementations of the simplex method may be adapted to better solve linear
programs that have a staged, or ‘staircase’, structure. The preceding paper considered ‘inversion’ routines that factorize
the basis and solve linear systems. The present paper examines ‘pricing’ routines that compute reduced costs for nonbasic
variables and that select a variable to enter the basis at each iteration. Both papers describe extensive (although preliminary)
computer experiments, and can point to some quite promising results. For pricing in particular, staircase computation strategies
appear to offer modest but consistent savings; staircase selection strategies, properly chosen, may offer substantial savings
in number of iterations, time per iteration, or both. 相似文献
79.
J. E. Spingarn 《Mathematical Programming》1982,22(1):82-92
Optimality conditions for families of nonlinear programming problems inR
n
are studied from a generic point of view. The objective function and some of the constraints are assumed to depend on a parameter, while others are held fixed. Techniques of differential topology are used to show that under suitable conditions, certain strong second-order conditions are necessary for optimality except possibly for parameter values lying in a negligible set.Research sponsored, in part, by the Air Force Office of Scientific Research, under grants number 77-3204 and 79-0120. 相似文献
80.
Israel Zang 《Mathematical Programming》1978,15(1):36-52
The gradient path of a real valued differentiable function is given by the solution of a system of differential equations. For a quadratic function the above equations are linear, resulting in a closed form solution. A quasi-Newton type algorithm for minimizing ann-dimensional differentiable function is presented. Each stage of the algorithm consists of a search along an arc corresponding to some local quadratic approximation of the function being minimized. The algorithm uses a matrix approximating the Hessian in order to represent the arc. This matrix is updated each stage and is stored in its Cholesky product form. This simplifies the representation of the arc and the updating process. Quadratic termination properties of the algorithm are discussed as well as its global convergence for a general continuously differentiable function. Numerical experiments indicating the efficiency of the algorithm are presented. 相似文献