全文获取类型
收费全文 | 951篇 |
免费 | 53篇 |
国内免费 | 48篇 |
专业分类
化学 | 16篇 |
力学 | 9篇 |
综合类 | 22篇 |
数学 | 934篇 |
物理学 | 71篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 10篇 |
2021年 | 22篇 |
2020年 | 12篇 |
2019年 | 14篇 |
2018年 | 20篇 |
2017年 | 28篇 |
2016年 | 26篇 |
2015年 | 18篇 |
2014年 | 49篇 |
2013年 | 53篇 |
2012年 | 45篇 |
2011年 | 45篇 |
2010年 | 48篇 |
2009年 | 63篇 |
2008年 | 66篇 |
2007年 | 62篇 |
2006年 | 46篇 |
2005年 | 55篇 |
2004年 | 27篇 |
2003年 | 43篇 |
2002年 | 35篇 |
2001年 | 30篇 |
2000年 | 32篇 |
1999年 | 20篇 |
1998年 | 24篇 |
1997年 | 18篇 |
1996年 | 14篇 |
1995年 | 11篇 |
1994年 | 12篇 |
1993年 | 5篇 |
1992年 | 8篇 |
1991年 | 2篇 |
1990年 | 9篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 1篇 |
1986年 | 9篇 |
1985年 | 34篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有1052条查询结果,搜索用时 0 毫秒
1.
Zvonko Čerin 《Central European Journal of Mathematics》2005,3(1):1-13
We consider alternating sums of squares of odd and even terms of the Lucas sequence and alternating sums of their products.
These alternating sums have nice representations as products of appropriate Fibonacci and Lucas numbers. 相似文献
2.
Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems. 相似文献
3.
4.
5.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献
6.
7.
8.
We consider a class of non-linear mixed integer programs with n integer variables and k continuous variables. Solving instances from this class to optimality is an NP-hard problem. We show that for the cases with
k=1 and k=2, every optimal solution is integral. In contrast to this, for every k≥3 there exist instances where every optimal solution takes non-integral values.
Received: August 2001 / Accepted: January 2002?Published online March 27, 2002 相似文献
9.
Hua Ning LIU Wen Peng ZHANG 《数学学报(英文版)》2007,23(5):915-924
The main purpose of this paper is to use the generalized Bernoulli numbers, Gauss sums and the mean value theorems of Dirichlet L-functions between a quadratic residue and its inverse modulo p value formula. to study the asymptotic property of the difference (a prime), and to give an interesting hybrid mean 相似文献
10.
We show that for any optimal solution
for a given separable quadratic integer programming problem there exist an optimal solution
for its continuous relaxation such that
wheren is the number of variables and(A) is the largest absolute subdeterminant of the integer constraint matrixA. Also for any feasible solutionz, which is not optimal for the separable quadratic integer programming problem, there exists a feasible solution
having greater objective function value and with
. We further prove, under some additional assumptions, that the distance between a pair of optimal solutions to an integer quadratic programming problem with right hand side vectorsb andb, respectively, depends linearly on b–b1. Finally the validity of all the results for nonseparable mixed-integer quadratic programs is established. The proximity results obtained in this paper are extensions of some of the results described in Cook et al. (1986) for linear integer programming.This research was partially supported by Natural Sciences and Engineering Research Council of Canada Grant 5-83998. 相似文献