首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   305篇
  免费   8篇
  国内免费   17篇
化学   50篇
力学   37篇
数学   201篇
物理学   42篇
  2023年   3篇
  2022年   8篇
  2021年   4篇
  2020年   7篇
  2019年   6篇
  2018年   8篇
  2017年   9篇
  2016年   9篇
  2015年   5篇
  2014年   19篇
  2013年   20篇
  2012年   17篇
  2011年   20篇
  2010年   20篇
  2009年   17篇
  2008年   23篇
  2007年   19篇
  2006年   12篇
  2005年   8篇
  2004年   9篇
  2003年   5篇
  2002年   6篇
  2001年   6篇
  2000年   6篇
  1999年   10篇
  1998年   6篇
  1997年   2篇
  1996年   4篇
  1995年   3篇
  1994年   3篇
  1993年   3篇
  1992年   2篇
  1990年   7篇
  1989年   2篇
  1988年   3篇
  1987年   2篇
  1986年   1篇
  1985年   4篇
  1984年   3篇
  1983年   2篇
  1982年   1篇
  1981年   3篇
  1979年   2篇
  1975年   1篇
排序方式: 共有330条查询结果,搜索用时 15 毫秒
321.
In this paper, we propose a methodology for branch-and-cut-and-price when cuts and columns are generated simultaneously. The methodology is illustrated with two application cases: the Split Delivery Vehicle Routing Problem (SDVRP) and the Bus Rapid Transit Route Design Problem (BRTRDP).  相似文献   
322.
An interesting behavior of customers arriving to a queue for service concerns the manner in which they join the queue. The arrival discipline of the customers may be impolite, in the sense that an arriving customer who finds all servers busy may pick a position which is not necessarily at the end of the line. We introduce and discuss in detail such an arrival discipline of sufficient generality which has interesting applications. In particular, we show that the more impolite an arrival discipline is, the bigger is the variance of the waiting time. We also study a special model in more depth to provide simple computational formulas for several performance measures.  相似文献   
323.
Depth-Optimized Convexity Cuts   总被引:1,自引:0,他引:1  
This paper presents a general, self-contained treatment of convexity or intersection cuts. It describes two equivalent ways of generating a cut—via a convex set or a concave function—and a partial-order notion of cut strength. We then characterize the structure of the sets and functions that generate cuts that are strongest with respect to the partial order. Next, we specialize this analytical framework to the case of mixed-integer linear programming (MIP). For this case, we formulate two kinds of the deepest cut generation problem, via sets or via functions, and subsequently consider some special cases which are amenable to efficient computation. We conclude with computational tests of one of these procedures on a large set of MIPLIB problems.  相似文献   
324.
This paper analyzes the introduction of multiple central cuts in a conic formulation of the analytic center cutting plane method (in short ACCPM). This work extends earlier work on the homogeneous ACCPM, and parallels the analysis of the multiple cut process in the standard ACCPM. The main issue is the calculation of a direction that restores feasibility after introducing p new cutting planes at the query point. We prove that the new analytic center can be recovered in O(p log p) damped Newton iterations, where is a parameter depending of the data. We also present two special cases where the complexity can be decreased to O (p log p). Finally, we show that the number of calls to the oracle is the same as in the single cut case, up to a factor .  相似文献   
325.
A variant of the ellipsoid method for nonlinear programming is introduced to enhance the speed of convergence. This variant is based on a new simple scheme to reduce the ellipsoid volume by using two center cuts generated in two consecutive iterations of the ellipsoid method. Computational tests show a significant improvement in computational efficiency. The tests show that the improvement is more significant for larger-size problems.  相似文献   
326.
For a given graph H, a non-increasing sequence π=(d1,d2,…,dn) of nonnegative integers is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. The split graph on r+s vertices is denoted by Sr,s. In this paper, we give a Rao-type characterization for π to be potentially Sr,s-graphic. A simplification of this characterization is also presented.  相似文献   
327.
328.
O.S.Lee  S.H.Kim  Y.H.Han 《实验力学》2006,21(1):51-60
0Introduction Thehighstrainratestress strainresponsesofpolymersandpolymericcompositematerialshave receivedincreasedscientificandindustrialattentioninrecentyears.Polymericmaterialsaresubjected todynamicloadingandhighstrainratedeformationinavarietyofimporta…  相似文献   
329.
硬质聚氨酯泡沫塑料本构关系的研究   总被引:34,自引:0,他引:34  
胡时胜  刘剑飞  王梧 《力学学报》1998,30(2):151-156
介绍用大尺寸分离式Hopkinson压杆对四种密度的硬质聚氨酯泡沫塑料进行高应变率实验,完整地给出了这种材料在103/s高应变率下的包括弹性区、屈服区和致密区变形全过程的动态应力应变曲线,并提出了包括应力、应变、应变率和密度等参量的本构关系.  相似文献   
330.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号