全文获取类型
收费全文 | 986篇 |
免费 | 61篇 |
国内免费 | 51篇 |
专业分类
化学 | 250篇 |
力学 | 21篇 |
综合类 | 14篇 |
数学 | 510篇 |
物理学 | 303篇 |
出版年
2023年 | 9篇 |
2022年 | 16篇 |
2021年 | 14篇 |
2020年 | 19篇 |
2019年 | 17篇 |
2018年 | 17篇 |
2017年 | 24篇 |
2016年 | 28篇 |
2015年 | 24篇 |
2014年 | 54篇 |
2013年 | 89篇 |
2012年 | 40篇 |
2011年 | 53篇 |
2010年 | 46篇 |
2009年 | 51篇 |
2008年 | 61篇 |
2007年 | 69篇 |
2006年 | 56篇 |
2005年 | 49篇 |
2004年 | 42篇 |
2003年 | 45篇 |
2002年 | 47篇 |
2001年 | 30篇 |
2000年 | 35篇 |
1999年 | 21篇 |
1998年 | 23篇 |
1997年 | 16篇 |
1996年 | 11篇 |
1995年 | 14篇 |
1994年 | 7篇 |
1993年 | 12篇 |
1992年 | 10篇 |
1991年 | 4篇 |
1990年 | 9篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 5篇 |
1985年 | 5篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 7篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1971年 | 1篇 |
排序方式: 共有1098条查询结果,搜索用时 15 毫秒
1.
We consider three known bounds for the quadratic assignment problem (QAP): an eigenvalue, a convex quadratic programming (CQP), and a semidefinite programming (SDP) bound. Since the last two bounds were not compared directly before, we prove that the SDP bound is stronger than the CQP bound. We then apply these to improve known bounds on a discrete energy minimization problem, reformulated as a QAP, which aims to minimize the potential energy between repulsive particles on a toric grid. Thus we are able to prove optimality for several configurations of particles and grid sizes, complementing earlier results by Bouman et al. (2013). The semidefinite programs in question are too large to solve without pre-processing, and we use a symmetry reduction method by Permenter and Parrilo (2020) to make computation of the SDP bounds possible. 相似文献
2.
The purpose of this paper is to present a new primal extreme point algorithm for solving assignment problems which both circumvents and exploits degeneracy. The algorithm is based on the observation that the degeneracy difficulties of the simplex method result from the unnecessary inspection of alternative basis representations of the extreme points. This paper characterizes a subsetQ of all bases that are capable of leading to an optimal solution to the problem if one exists. Using this characterization, an extreme point algorithm is developed which considers only those bases inQ. Computational results disclose that the new algorithm is substantially more efficient than previously developed primal and primal-dual extreme point (simplex) methods for assignment problems. 相似文献
3.
In the assignment game framework, we try to identify those assignment matrices in which no entry can be increased without
changing the core of the game. These games will be called buyer-seller exact games and satisfy the condition that each mixed-pair
coalition attains the corresponding matrix entry in the core of the game. For a given assignment game, a unique buyer-seller
exact assignment game with the same core is proved to exist. In order to identify this matrix and to provide a characterization
of those assignment games which are buyer-seller exact in terms of the assignment matrix, attainable upper and lower core
bounds for the mixed-pair coalitions are found. As a consequence, an open question posed in Quint (1991) regarding a canonical
representation of a “45o-lattice” by means of the core of an assignment game can now be answered.
Received: March 2002/Revised version: January 2003
RID="*"
ID="*" Institutional support from research grants BEC 2002-00642 and SGR2001-0029 is gratefully acknowledged
RID="**"
ID="**" The authors thank the referees for their comments 相似文献
4.
Capacity Constrained Transit Assignment with Common Lines 总被引:1,自引:0,他引:1
Fumitaka Kurauchi Michael G. H. Bell Jan-Dirk Schmöcker 《Journal of Mathematical Modelling and Algorithms》2003,2(4):309-327
This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking
common lines into account. The approach handles congested transit networks, where some passengers will not be able to board
because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends
on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献
5.
In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into K50. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10049 相似文献
6.
Roberto Montemanni 《4OR: A Quarterly Journal of Operations Research》2003,1(3):257-260
A survey of the results described in the authors PhD thesis (Montemanni 2001) is presented. The thesis, which was supervised by Prof. Derek H. Smith and Dr. Stuart M. Allen, has been defended in January 2002 at the University of Glamorgan (U.K.). The thesis proposes new heuristic algorithms, based on well-known meta-heuristic paradigms, and new lower bounding techniques, based on linear programming, for the fixed spectrum frequency assignment problem.Received: May 2003, Revised: May 2003, AMS classification:
90C27, 90C59,05C90, 90C05Roberto Montemanni: Present address: Istituto Dalle Molle di Studi sullIntelligenza Artificiale (IDSIA), Galleria 2, 6928 Manno-Lugano, Switzerland (e-mail: roberto@idsia.ch) 相似文献
7.
工程施工中运输网络优化方案 总被引:5,自引:0,他引:5
施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 . 相似文献
8.
随机交通均衡配流模型及其等价的变分不等式问题 总被引:7,自引:0,他引:7
本文讨论了交通网络系统的随机用户均衡原理的数学表述问题.在路段出行成本是流量的单调函数的较弱条件下,对具有固定需求和弹性需求的模式,首次证明了随机均衡配流模型可表示为一个变分不等式问题,同时也说明了该变分不等式问题与相应的互补问题以及一个凸规划问题之间的等价关系. 相似文献
9.
非线性DEDS的周期时间部分合并配置与能稳性 总被引:2,自引:0,他引:2
对于具有状态反馈的非自治非线性DEDS,通过引入强连通系的最大能并子集,定义了周期时间部分合并配置和能稳性,给出了周期时间部分合并配置的一个充要条件以及能稳性的一个充分条件,前者推广了已有结果. 相似文献
10.