全文获取类型
收费全文 | 5214篇 |
免费 | 505篇 |
国内免费 | 267篇 |
专业分类
化学 | 1805篇 |
晶体学 | 88篇 |
力学 | 645篇 |
综合类 | 31篇 |
数学 | 1362篇 |
物理学 | 2055篇 |
出版年
2024年 | 6篇 |
2023年 | 33篇 |
2022年 | 72篇 |
2021年 | 81篇 |
2020年 | 108篇 |
2019年 | 120篇 |
2018年 | 99篇 |
2017年 | 117篇 |
2016年 | 170篇 |
2015年 | 117篇 |
2014年 | 171篇 |
2013年 | 425篇 |
2012年 | 236篇 |
2011年 | 247篇 |
2010年 | 201篇 |
2009年 | 251篇 |
2008年 | 254篇 |
2007年 | 355篇 |
2006年 | 285篇 |
2005年 | 240篇 |
2004年 | 260篇 |
2003年 | 201篇 |
2002年 | 242篇 |
2001年 | 180篇 |
2000年 | 192篇 |
1999年 | 170篇 |
1998年 | 150篇 |
1997年 | 125篇 |
1996年 | 110篇 |
1995年 | 98篇 |
1994年 | 111篇 |
1993年 | 83篇 |
1992年 | 73篇 |
1991年 | 45篇 |
1990年 | 27篇 |
1989年 | 27篇 |
1988年 | 29篇 |
1987年 | 24篇 |
1986年 | 37篇 |
1985年 | 36篇 |
1984年 | 38篇 |
1983年 | 9篇 |
1982年 | 20篇 |
1981年 | 16篇 |
1980年 | 17篇 |
1979年 | 8篇 |
1978年 | 16篇 |
1977年 | 14篇 |
1976年 | 15篇 |
1973年 | 8篇 |
排序方式: 共有5986条查询结果,搜索用时 687 毫秒
991.
Many studies on hardware framework and routing policy are devoted to reducing the transmission time for a flow network. A time version of the shortest path problem thus arises to find a quickest path, which sends a given amount of data from the unique source to the unique sink with minimum transmission time. More specifically, the capacity of each arc in the flow network is assumed to be deterministic. However, in many real-life networks, such as computer systems, telecommunication systems, etc., the capacity of each arc should be stochastic due to failure, maintenance, etc. Such a network is named a stochastic-flow network. Hence, the minimum transmission time is not a fixed number. We extend the quickest path problem to evaluating the probability that d units of data can be sent under the time constraint T. Such a probability is named the system reliability. In particular, the data are transmitted through two minimal paths simultaneously in order to reduce the transmission time. A simple algorithm is proposed to generate all (d,T)-MPs and the system reliability can then be computed in terms of (d,T)-MPs. Moreover, the optimal pair of minimal paths with highest system reliability could be obtained. 相似文献
992.
We consider a lot sizing problem with setup times where the objective is to minimize the total inventory carrying cost only. The demand is dynamic over time and there is a single resource of limited capacity. We show that the approaches implemented in the literature for more general versions of the problem do not perform well in this case. We examine the Lagrangean relaxation (LR) of demand constraints in a strong reformulation of the problem. We then design a primal heuristic to generate upper bounds and combine it with the LR problem within a subgradient optimization procedure. We also develop a simple branch and bound heuristic to solve the problem. Computational results on test problems taken from the literature show that our relaxation procedure produces consistently better solutions than the previously developed heuristics in the literature. 相似文献
993.
A multi-product manufacturing problem generally consists of the total cost minimization. In case where the shelf life constraint is imposed, various options to deal with the situation are widely discussed in the literature. These options include a reduction in the production rate and cycle time separately, and the simultaneous reduction of production rate and cycle time. When the production rate is decreased, the unit manufacturing cost increases and because of this the inventory holding costs need modification. In the existing literature, this has been ignored in the computation of cost and therefore a revisit to the problem has been justified. The present paper modifies the holding cost and this problem has been reformulated for the basic case. This has also been extended for an inclusion of shortages that are backordered completely or partially. 相似文献
994.
The bandwidth packing problem is defined as the selection and routing of messages from a given list of messages with prespecified requirements on demand for bandwidth. The messages have to be routed over a network with given topology so that the generated revenue is maximized. Messages to be routed are classified into two priority classes. An integer programming based formulation of this problem is proposed and a Lagrangean relaxation based methodology is described for solving this problem. A general purpose heuristic is then developed for generating feasible solutions of good quality. Several numerical experiments are conducted using a number of problem parameters such as number of messages, ratio of messages for lower and higher priority classes, capacity of links, and demand distribution of messages belonging to different classes and high quality solutions to the priority bandwidth packing problem are generated under the different situations. 相似文献
995.
Alexandre Salles da Cunha Nelson Maculan Mauricio G.C. Resende 《Discrete Applied Mathematics》2009,157(6):1198-1217
Given an undirected graph G with penalties associated with its vertices and costs associated with its edges, a Prize Collecting Steiner (PCS) tree is either an isolated vertex of G or else any tree of G, be it spanning or not. The weight of a PCS tree equals the sum of the costs for its edges plus the sum of the penalties for the vertices of G not spanned by the PCS tree. Accordingly, the Prize Collecting Steiner Problem in Graphs (PCSPG) is to find a PCS tree with the lowest weight. In this paper, after reformulating and re-interpreting a given PCSPG formulation, we use a Lagrangian Non Delayed Relax and Cut (NDRC) algorithm to generate primal and dual bounds to the problem. The algorithm is capable of adequately dealing with the exponentially many candidate inequalities to dualize. It incorporates ingredients such as a new PCSPG reduction test, an effective Lagrangian heuristic and a modification in the NDRC framework that allows duality gaps to be further reduced. The Lagrangian heuristic suggested here dominates their PCSPG counterparts in the literature. The NDRC PCSPG lower bounds, most of the time, nearly matched the corresponding Linear Programming relaxation bounds. 相似文献
996.
We investigate the complexity of finding solutions to infinite recursive constraint satisfaction problems. We show that, in general, the problem of finding a solution to an infinite recursive constraint satisfaction problem is equivalent to the problem of finding an infinite path through a recursive tree. We also identify natural classes of infinite recursive constraint satisfaction problems where the problem of finding a solution to the infinite recursive constraint satisfaction problem is equivalent to the problem of finding an infinite path through finitely branching recursive trees or recursive binary trees. There are a large number of results in the literature on the complexity of the problem of finding an infinite path through a recursive tree. Our main result allows us to automatically transfer such results to give equivalent results about the complexity of the problem of finding a solution to a recursive constraint satisfaction problem. 相似文献
997.
为求线性比试和问题的全局最优解,本文给出了一个分支定界算法.通过一个等价问题和一个新的线性化松弛技巧,初始的非凸规划问题归结为一系列线性规划问题的求解.借助于这一系列线性规划问题的解,算法可收敛于初始非凸规划问题的最优解.算法的计算量主要是一些线性规划问题的求解.数值算例表明算法是切实可行的. 相似文献
998.
999.
Large part of combinatorial optimization research has been devoted to the study of exact methods leading to a number of very
diversified solution approaches. Some of those older frameworks can now be revisited in a metaheuristic perspective, as they
are quite general frameworks for dealing with optimization problems. In this work, we propose to investigate the possibility
of reinterpreting decompositions, with special emphasis on the related Benders and Lagrangean relaxation techniques. We show
how these techniques, whose heuristic effectiveness is already testified by a wide literature, can be framed as a “master
process that guides and modifies the operations of subordinate heuristics”, i.e., as metaheuristics. Obvious advantages arise
from these approaches, first of all the runtime evolution of both upper and lower bounds to the optimal solution cost, thus
yielding both a high-quality heuristic solution and a runtime quality certificate of that same solution. 相似文献
1000.
Katta G. Murty 《Optimization Letters》2009,3(2):211-237
We consider the problem of developing an efficient algorithm for enumerating the extreme points of a convex polytope specified
by linear constraints. Murty and Chung (Math Program 70:27–45, 1995) introduced the concept of a segment of a polytope, and used it to develop some steps for carrying out the enumeration efficiently until the convex hull of the
set of known extreme points becomes a segment. That effort stops with a segment, other steps outlined in Murty and Chung (Math
Program 70:27–45, 1995) for carrying out the enumeration after reaching a segment, or for checking whether the segment is
equal to the original polytope, do not constitute an efficient algorithm. Here we describe the central problem in carrying
out the enumeration efficiently after reaching a segment. We then discuss two procedures for enumerating extreme points, the
mukkadvayam checking procedure, and the nearest point procedure. We divide polytopes into two classes: Class 1 polytopes have
at least one extreme point satisfying the property that there is a hyperplane H through that extreme point such that every facet of the polytope incident at that extreme point has relative interior point
intersections with both sides of H; Class 2 polytopes have the property that every hyperplane through any extreme point has at least one facet incident at that
extreme point completely contained on one of its sides. We then prove that the procedures developed solve the problem efficiently
when the polytope belongs to Class 2. 相似文献