全文获取类型
收费全文 | 751篇 |
免费 | 44篇 |
国内免费 | 8篇 |
专业分类
化学 | 18篇 |
力学 | 38篇 |
综合类 | 31篇 |
数学 | 639篇 |
物理学 | 77篇 |
出版年
2024年 | 2篇 |
2023年 | 7篇 |
2022年 | 11篇 |
2021年 | 11篇 |
2020年 | 8篇 |
2019年 | 8篇 |
2018年 | 16篇 |
2017年 | 21篇 |
2016年 | 28篇 |
2015年 | 19篇 |
2014年 | 64篇 |
2013年 | 53篇 |
2012年 | 40篇 |
2011年 | 35篇 |
2010年 | 45篇 |
2009年 | 60篇 |
2008年 | 51篇 |
2007年 | 61篇 |
2006年 | 24篇 |
2005年 | 24篇 |
2004年 | 14篇 |
2003年 | 16篇 |
2002年 | 17篇 |
2001年 | 16篇 |
2000年 | 20篇 |
1999年 | 13篇 |
1998年 | 8篇 |
1997年 | 7篇 |
1996年 | 9篇 |
1995年 | 13篇 |
1994年 | 6篇 |
1993年 | 3篇 |
1992年 | 7篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 11篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 17篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1970年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有803条查询结果,搜索用时 15 毫秒
71.
D. AnghinolfiM. Paolucci S. SaconeS. Siri 《European Journal of Operational Research》2011,214(3):588-594
In this paper we propose a planning procedure for serving freight transportation requests in a railway network with fast transfer equipment at terminals. We consider a transportation system where different customers make their requests (orders) for moving boxes, i.e., either containers or swap bodies, between different origins and destinations, with specific requirements on delivery times. The decisions to be taken concern the route (and the corresponding sequence of trains) that each box follows in the network and the assignment of boxes to train wagons, taking into account that boxes can change more than one train and that train timetables are fixed.The planning procedure includes a pre-analysis step to determine all the possible sequences of trains for serving each order, followed by the solution of a 0-1 linear programming problem to find the optimal assignment of each box to a train sequence and to a specific wagon for each train in the sequence. This latter is a generalized assignment problem which is NP-hard. Hence, in order to find good solutions in acceptable computation times, two MIP heuristic approaches are proposed and tested through an experimental analysis considering realistic problem instances. 相似文献
72.
为缩短客户从提交订单到领取汽车时间,通过对汽车企业定制化生产供应链要素分析,以订单处理带动生产管理改进.通过改善企业软能力,增强应对市场应变能力,允许一定提前期的订单修改,减少订单处理与等待时间;为适应订单的变化,生产中管理中采用“漏斗模型”,利用粗集理论制定动态生产计划,提高生产效率,达到最终减少客户等待时间目的. 相似文献
73.
74.
A new supplier price break and discount scheme taking into account order frequency and lead time is introduced and incorporated into an integrated inventory planning model for a serial supply chain that minimizes the overall incurred cost including procurement, inventory holding, production, and transportation. A mixed-integer linear programming (MILP) formulation is presented addressing this multi-period, multi-supplier, and multi-stage problem with predetermined time-varying demand for the case of a single product. Then, the length of the time period is considered as a variable. A new MILP formulation is derived when each period of the model is split into multiple sub-periods, and under certain conditions, it is proved that the optimal solution and objective value of the original model form a feasible solution and an upper bound for the derived model. In a numerical example, three scenarios of the derived model are solved where the number of sub-period is set to 2, 3, and 4. The results further show the decrease of the optimal objective value as the length of the time period is shortened. Sufficient evidence demonstrates that the length of the time period has a significant influence on supplier selection, lot sizing allocation, and inventory planning decisions. This poses the necessity of the selection of appropriate length of a time period, considering the trade-off between model complexity and cost savings. 相似文献
75.
Consider-then-choose models, borne out by empirical literature in marketing and psychology, note that customers follow a two-stage procedure to choose among alternatives. In this paper, we consider the assortment optimization problem of a retailer who manages a category of vertically differentiated products under customers’ consider-then-choose behavior. We characterize some structural results of the optimal assortment and find that the problem can be solved as the shortest path problem. Also, we develop an efficient algorithm to identify an optimal assortment. 相似文献
76.
A stochastic manpower planning model under varying class sizes 总被引:1,自引:0,他引:1
Solution related to different types of manpower planning problems arising in different industries and organizations are very
much helpful for proper planning and implementation of different objectives. Previously those type of problems are mostly
solved under the deterministic set up. Gradually several scientists have developed different types of stochastic models appropriate
for solving such types of problems. The present study is an attempt to develop a stochastic manpower planning model under
the set up where the classes are of varying sizes and promotion occurs only on the basis of seniority.
The work of second author was supported by a research fellowship from Council of Scientific and Industrial Research (Sanction
No. 9/28(611)/2003-EMR-I), India. 相似文献
77.
谭泽光 《应用数学学报(英文版)》1998,14(1):96-105
1.ExtendedEntropyModelEntropymodelsarewidelyusedasaforecastingtechniqueinregionalplanning,see11]and[7].Theydescribeinacertainwaythemostprobablespatialinteractionandcanbeusedtoestimateorigin-destinationtripmatrices.Butthemodelsaretoosimple,soitisdifficulttomeetpracticalrequirements.HallefjordandJo..stenl2]putforwardthegeneralizationofthestandardentropymodels.Onthebasisofthisandaccordingtothedemandofthepredictionofthetripamountfortransportationplanning,wearriveatthefollowing:wherep,μandnarepo… 相似文献
78.
A bilevel program is a mathematical program involving functions defined implicitly as solutions to another mathematical program. We discuss a method for extracting derivative information on the implicit function, which is especially efficient when the lower-level problem has simple bounds on the variables and/or many inactive constraints. Computational experience on problems with up to 230 variables and 30 constraints is presented.Computational support from Robert Bivins and Myron Stein is gratefully acknowledged. We have also appreciated comments from Jon Bard and an anonymous referee. This work was supported in part by the US Department of Energy through the Los Alamos National Laboratory. 相似文献
79.
80.
Robert-Paul Berretty Mark H. Overmars A. Frank van der Stappen 《Computational Geometry》1998,11(3-4):157-173
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. The weak and realistic low obstacle density (L.O.D.) assumption results in linear complexity in the number of obstacles of the free space (Van der Stappen et al., 1997). In this paper we address the dynamic version of the motion planning problem in which a robot moves among polygonal obstacles which move along polylines. The obstacles are assumed to move along constant complexity polylines, and to respect the low density property at any given time. We will show that in this situation a cell decomposition of the free space of size O(n2(n) log2 n) can be computed in O(n2(n) log2 n) time. The dynamic motion planning problem is then solved in O(n2(n) log3 n) time. We also show that these results are close to optimal. 相似文献