全文获取类型
收费全文 | 1531篇 |
免费 | 148篇 |
国内免费 | 14篇 |
专业分类
化学 | 24篇 |
力学 | 9篇 |
综合类 | 53篇 |
数学 | 1530篇 |
物理学 | 77篇 |
出版年
2023年 | 12篇 |
2022年 | 35篇 |
2021年 | 47篇 |
2020年 | 21篇 |
2019年 | 33篇 |
2018年 | 31篇 |
2017年 | 51篇 |
2016年 | 36篇 |
2015年 | 40篇 |
2014年 | 81篇 |
2013年 | 75篇 |
2012年 | 70篇 |
2011年 | 82篇 |
2010年 | 100篇 |
2009年 | 112篇 |
2008年 | 136篇 |
2007年 | 126篇 |
2006年 | 78篇 |
2005年 | 70篇 |
2004年 | 43篇 |
2003年 | 49篇 |
2002年 | 34篇 |
2001年 | 42篇 |
2000年 | 45篇 |
1999年 | 29篇 |
1998年 | 31篇 |
1997年 | 24篇 |
1996年 | 17篇 |
1995年 | 22篇 |
1994年 | 11篇 |
1993年 | 12篇 |
1992年 | 9篇 |
1991年 | 4篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 18篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 18篇 |
1984年 | 10篇 |
1983年 | 5篇 |
1982年 | 4篇 |
1981年 | 4篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有1693条查询结果,搜索用时 31 毫秒
61.
针对“仓店一体化”模式下提供限时送达服务的新零售仓店,研究多拣货员、多客户、配送方式为带限时送达约束的路径优化分批配送情形下的订单拣选与配送集成调度问题。以最小化订单最大履行时间和配送成本为目标,构建了混合整数非线性规划模型,并设计两阶段启发式算法(H-2)进行求解,最后通过数值实验对算法进行验证与分析。数值实验结果表明,H-2具有较高的求解质量;相较于传统调度算法(TS)在效率提升、资源节约以及客户满意度提高方面具有更优的表现,进而为新零售仓店管理者提供决策支持。 相似文献
62.
本研究从业主—承包商交互的视角构建了一种RCPSP(resource-constrained project scheduling problem)双层优化模型,即在可更新资源约束条件下,项目双方如何进行交互决策达到双方NPV(Net present value)最大化的目标。首先对研究问题进行界定,构建资源约束下的max-NPV项目调度双层优化模型;然后利用延迟优先规则设计了一种基于时间窗延迟的嵌套式自适应遗传算法来求解该模型,以达到双方NPV最大化;最后用一个算例验证算法的有效性,同时通过PSPLIB数值实验说明算法的稳定性,并分析关键参数对项目双方收益的影响。研究结果为项目进程的安排以及奖励机制的设计提供依据,以提高双方利益。 相似文献
63.
64.
基于标准差和平均差的权系数确定方法及其应用 总被引:17,自引:1,他引:17
本文以工业经济效益的综合评价为应用背景 ,提出了一种确定多指标决策权系数的新方法———标准差和平均差极大化方法。运用该方法进行多指标决策和评价 ,概念清楚、涵义明确 ,决策和评价结果准确、可信、不具有主观随意性 相似文献
65.
研究源自于MapReduce系统的一类排序问题。给定两台恒速机和一组按列表到达的工件,每个工件包含两类任务:Map Task和Reduce Task。假设Map任务和Reduce任务都是不可中断的,Map任务可以并行处理,即可以任意分割成若干小的任务并在两台机器上同时处理,而Reduce任务只可以在单台机器上处理。一旦工件到达,必须为其指派机器和开工时间,目标是使得最后完工时间最小。对LSc算法的竞争比进行了分析,得到其一般情形下的竞争比当$s\geq(1+\sqrt{5})/2$时为$1+1/s$,否则为$1+s/(s+1)$。而当每个工件$J_j$都满足其Map任务总长大于等于Reduce任务总长时,其竞争比当$s\geq(1+\sqrt{3})/2$时不超过$1+1/(2s)$,否则为不超过$1+s/(2s+1)$。 相似文献
66.
Mathematical models for job-shop scheduling problems with routing and process plan flexibility 总被引:1,自引:0,他引:1
As a result of rapid developments in production technologies in recent years, flexible job-shop scheduling problems have become increasingly significant. This paper deals with two NP-hard optimization problems: flexible job-shop scheduling problems (FJSPs) that encompass routing and sequencing sub-problems, and the FJSPs with process plan flexibility (FJSP-PPFs) that additionally include the process plan selection sub-problem. The study is carried out in two steps. In the first step, a mixed-integer linear programming model (MILP-1) is developed for FJSPs and compared to an alternative model in the literature (Model F) in terms of computational efficiency. In the second step, one other mixed-integer linear programming model, a modification of MILP-1, for the FJSP-PPFs is presented along with its computational results on hypothetically generated test problems. 相似文献
67.
针对110警车调度问题,引入了图论中的最短路算法以及计算几何的相关理论,建立了车辆调配模型、巡逻路线模型以及基于模糊数学的评价指标模型.另外,用C++编写了一个可视化的软件,不仅实现了手动描点,自动求出覆盖线段集合的功能,同时利用计算机模拟警车的巡逻路线,最后通过计算机检验得到结果,其合理性和实用性都令人满意.针对问题一,通过人机结合,配置17辆警车就能实现D1的目标,很好地兼顾了警车巡逻的运行成本,减少公安部门车辆和人员等的投入.针对问题二,采用模糊数学相关理论使评价指标实现了从定性到定量的转变.针对问题三和六,在D1的基础上,兼顾了巡逻效果的显著性,采用最少被巡逻道路优先的贪心算法建立了动态巡逻模型,得到了合理的巡逻方案.在此方案中,我们动用了30辆警车完成了问题一的目标.另外还额外考虑了案发事件概率不均匀分布的情况,建立了改进模型.针对问题四,在完成问题三指标的基础上,为了尽可能提高巡逻车辆的隐蔽性和增强巡逻效果,采用轮盘赌算法来引入随机性.针对问题五,采用最远距离道路优先贪心策略,使模型尽可能满足条件D1,D2.针对问题七,提出了一些额外因素及其解决方案,进一步完善了模型,使模型更贴近现实. 相似文献
68.
We study bicriteria problems of minimizing maximum tardiness and total due date assignment cost in various scheduling environments. We assume that each job can be assigned a different due date without any restriction, and that each due date assignment cost is a non-decreasing function of the quoted due date. We settle the complexity of most of the problems studied by either proving that they are NP-hard or finding a polynomial time solution for them. We also include approximation and non-approximability results for several parallel-machine problems. 相似文献
69.
Bundle methods have been used frequently to solve nonsmooth optimization problems. In these methods, subgradient directions from past iterations are accumulated in a bundle, and a trial direction is obtained by performing quadratic programming based on the information contained in the bundle. A line search is then performed along the trial direction, generating a serious step if the function value is improved by or a null step otherwise. Bundle methods have been used to maximize the nonsmooth dual function in Lagrangian relaxation for integer optimization problems, where the subgradients are obtained by minimizing the performance index of the relaxed problem. This paper improves bundle methods by making good use of near-minimum solutions that are obtained while solving the relaxed problem. The bundle information is thus enriched, leading to better search directions and less number of null steps. Furthermore, a simplified bundle method is developed, where a fuzzy rule is used to combine linearly directions from near-minimum solutions, replacing quadratic programming and line search. When the simplified bundle method is specialized to an important class of problems where the relaxed problem can be solved by using dynamic programming, fuzzy dynamic programming is developed to obtain efficiently near-optimal solutions and their weights for the linear combination. This method is then applied to job shop scheduling problems, leading to better performance than previously reported in the literature. 相似文献
70.
The generalized assignment problem can be viewed as the following problem of scheduling parallel machines with costs. Each job is to be processed by exactly one machine; processing jobj on machinei requires timep
ij
and incurs a cost ofc
ij
; each machinei is available forT
i
time units, and the objective is to minimize the total cost incurred. Our main result is as follows. There is a polynomial-time algorithm that, given a valueC, either proves that no feasible schedule of costC exists, or else finds a schedule of cost at mostC where each machinei is used for at most 2T
i
time units.We also extend this result to a variant of the problem where, instead of a fixed processing timep
ij
, there is a range of possible processing times for each machine—job pair, and the cost linearly increases as the processing time decreases. We show that these results imply a polynomial-time 2-approximation algorithm to minimize a weighted sum of the cost and the makespan, i.e., the maximum job completion time. We also consider the objective of minimizing the mean job completion time. We show that there is a polynomial-time algorithm that, given valuesM andT, either proves that no schedule of mean job completion timeM and makespanT exists, or else finds a schedule of mean job completion time at mostM and makespan at most 2T.
Research partially supported by an NSF PYI award CCR-89-96272 with matching support from UPS, and Sun Microsystems, and by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550.Research supported in part by a Packard Fellowship, a Sloan Fellowship, an NSF PYI award, and by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550. 相似文献