全文获取类型
收费全文 | 7860篇 |
免费 | 253篇 |
国内免费 | 160篇 |
专业分类
化学 | 440篇 |
晶体学 | 1篇 |
力学 | 230篇 |
综合类 | 92篇 |
数学 | 7207篇 |
物理学 | 303篇 |
出版年
2023年 | 38篇 |
2022年 | 81篇 |
2021年 | 90篇 |
2020年 | 95篇 |
2019年 | 103篇 |
2018年 | 108篇 |
2017年 | 138篇 |
2016年 | 132篇 |
2015年 | 109篇 |
2014年 | 318篇 |
2013年 | 380篇 |
2012年 | 422篇 |
2011年 | 314篇 |
2010年 | 327篇 |
2009年 | 469篇 |
2008年 | 486篇 |
2007年 | 524篇 |
2006年 | 345篇 |
2005年 | 321篇 |
2004年 | 241篇 |
2003年 | 239篇 |
2002年 | 246篇 |
2001年 | 218篇 |
2000年 | 230篇 |
1999年 | 183篇 |
1998年 | 167篇 |
1997年 | 149篇 |
1996年 | 183篇 |
1995年 | 169篇 |
1994年 | 124篇 |
1993年 | 131篇 |
1992年 | 134篇 |
1991年 | 119篇 |
1990年 | 97篇 |
1989年 | 72篇 |
1988年 | 91篇 |
1987年 | 59篇 |
1986年 | 88篇 |
1985年 | 113篇 |
1984年 | 77篇 |
1983年 | 25篇 |
1982年 | 50篇 |
1981年 | 39篇 |
1980年 | 38篇 |
1979年 | 29篇 |
1978年 | 49篇 |
1977年 | 46篇 |
1976年 | 27篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有8273条查询结果,搜索用时 15 毫秒
71.
《Operations Research Letters》2019,47(5):353-357
The most effective software packages for solving mixed 0–1linear programs use strong valid linear inequalities derived from polyhedral theory. We introduce a new procedure which enables one to take known valid inequalities for the knapsack polytope, and convert them into valid inequalities for the fixed-charge and single-node flow polytopes. The resulting inequalities are very different from the previously known inequalities (such as flow cover and flow pack inequalities), and define facets under certain conditions. 相似文献
72.
Larry Jenkins 《Annals of Operations Research》1990,27(1):77-96
In contrast to methods of parametric linear programming which were developed soon after the invention of the simplex algorithm and are easily included as an extension of that method, techniques for parametric analysis on integer programs are not well known and require considerable effort to append them to an integer programming solution algorithm.The paper reviews some of the theory employed in parametric integer programming, then discusses algorithmic work in this area over the last 15 years when integer programs are solved by different methods. A summary of applications is included and the article concludes that parametric integer programming is a valuable tool of analysis awaiting further popularization. 相似文献
73.
S. Cafieri M. D’Apuzzo M. Marino A. Mucherino G. Toraldo 《Journal of Optimization Theory and Applications》2006,129(1):55-75
In this paper, we present an interior-point algorithm for large and sparse convex quadratic programming problems with bound
constraints. The algorithm is based on the potential reduction method and the use of iterative techniques to solve the linear
system arising at each iteration. The global convergence properties of the potential reduction method are reassessed in order
to take into account the inexact solution of the inner system. We describe the iterative solver, based on the conjugate gradient
method with a limited-memory incomplete Cholesky factorization as preconditioner. Furthermore, we discuss some adaptive strategies
for the fill-in and accuracy requirements that we use in solving the linear systems in order to avoid unnecessary inner iterations
when the iterates are far from the solution. Finally, we present the results of numerical experiments carried out to verify
the effectiveness of the proposed strategies. We consider randomly generated sparse problems without a special structure.
Also, we compare the proposed algorithm with the MOSEK solver.
Research partially supported by the MIUR FIRB Project RBNE01WBBB “Large-Scale Nonlinear Optimization.” 相似文献
74.
Harold R. Parks 《Journal of Mathematical Analysis and Applications》2006,324(2):934-940
A variant of lexicographic order called symmetrized-lexicographic order is defined. The symmetrized-lexicographic order finds its application in the goal programming procedure called the method of points. The symmetrized-lexicographic order is shown to be representable using linear algebra and, thus, the method of points can be implemented as a linear programming problem. 相似文献
75.
The main goals of this paper are to: i) relate two iteration-complexity bounds derived for the Mizuno-Todd-Ye predictor-corrector
(MTY P-C) algorithm for linear programming (LP), and; ii) study the geometrical structure of the LP central path. The first
iteration-complexity bound for the MTY P-C algorithm considered in this paper is expressed in terms of the integral of a certain
curvature function over the traversed portion of the central path. The second iteration-complexity bound, derived recently
by the authors using the notion of crossover events introduced by Vavasis and Ye, is expressed in terms of a scale-invariant
condition number associated with m × n constraint matrix of the LP. In this paper, we establish a relationship between these bounds by showing that the first one
can be majorized by the second one. We also establish a geometric result about the central path which gives a rigorous justification
based on the curvature of the central path of a claim made by Vavasis and Ye, in view of the behavior of their layered least
squares path following LP method, that the central path consists of long but straight continuous parts while the remaining curved part is relatively “short”.
R. D. C. Monteiro was supported in part by NSF Grants CCR-0203113 and CCF-0430644 and ONR grant N00014-05-1-0183. T. Tsuchiya
was supported in part by Japan-US Joint Research Projects of Japan Society for the Promotion of Science “Algorithms for linear
programs over symmetric cones” and the Grants-in-Aid for Scientific Research (C) 15510144 of Japan Society for the Promotion
of Science. 相似文献
76.
Sébastien Verel Arnaud Liefooghe Laetitia Jourdan Clarisse Dhaenens 《European Journal of Operational Research》2013
The structure of the search space explains the behavior of multiobjective search algorithms, and helps to design well-performing approaches. In this work, we analyze the properties of multiobjective combinatorial search spaces, and we pay a particular attention to the correlation between the objective functions. To do so, we extend the multiobjective NK-landscapes in order to take the objective correlation into account. We study the co-influence of the problem dimension, the degree of non-linearity, the number of objectives, and the objective correlation on the structure of the Pareto optimal set, in terms of cardinality and number of supported solutions, as well as on the number of Pareto local optima. This work concludes with guidelines for the design of multiobjective local search algorithms, based on the main fitness landscape features. 相似文献
77.
78.
R. Chandrasekaran 《Discrete Applied Mathematics》2009,157(18):3708-3720
Mixed Software Programming refers to a novel software development paradigm resulting from efforts to combine two different programming approaches: Solo Programming and Pair Programming. Solo Programming refers to the traditional practice of assigning a single developer to develop a software module and Pair Programming refers to a relatively new approach where two developers work simultaneously on developing a module. In Mixed Programming, given a set of modules to be developed, a chosen subset of modules may be developed using Solo Programming and the remaining modules using Pair Programming.Motivated by applications in Mixed Software Programming, we consider the following generalization of classical fractional 1-matching problem: Given an undirected simple graph G=(V;E), and a positive number F, find values for xe,e∈E, satisfying the following:
- 1.
- .
- 2.
- , where δ(i)={e∈E:e=(i,j)},i∈V.
- 3.
- Maximize {2∑e∈Exe−F|{i∈V:∑e∈δ(i)xe=1}|}.
79.
In this paper we present a case study from the lighting industry concerned with the scheduling of a set of job families each representing the production of a particular end-item in a given quantity. It is a job shop type problem, where each job family has a number of routing alternatives, and the solution has to respect batching and machine availability constraints. All jobs of the same job family have a common release date and a common due date, and they differ only in size. The objective is to minimize the total tardiness of the job families, rather than that of individual jobs. We propose a two-phase method based on solving a mixed-integer linear program and then improving the initial solution by tabu search. We evaluate our method on real-world as well as generated instances. 相似文献
80.
Vladimír Vrkoslav Barbora Rumlov Timotej Strme Josef Cva
ka 《Journal of separation science》2020,43(13):2579-2588
A new capillary high‐performance liquid chromatography method with atmospheric pressure chemical ionization mass spectrometry was developed for the analysis of fatty acid methyl esters and long‐chain alcohols. The chromatographic separation was achieved using a Zorbax SB‐C18 HPLC column (0.3 × 150 mm, 3.5 μm) with a mobile phase composed of acetonitrile and formic acid and delivered isocratically at a flow rate of 10 μL/min. The column temperature was programmed simply, using a common column oven. Good reproducibility of the temperature profile and retention times were achieved. The temperature programming during the isocratic high‐performance liquid chromatography run had a similar effect as a solvent gradient; it reduced retention times of later eluting analytes and improved their detection limits. Two atmospheric pressure chemical ionization sources of the mass spectrometry detector were compared: an enclosed conventional ion source and an in‐house made ion source with a glass microchip nebulizer. The enclosed source provided better detectability of saturated fatty acid methyl esters and made it possible to determine the double bond positions using acetonitrile‐related adducts, while the open chip‐based source provided better analytical figures of merit for unsaturated fatty acid methyl esters. Temperature‐programmed capillary high‐performance liquid chromatography is a promising method for analyzing neutral lipids in lipidomics and other applications. 相似文献