全文获取类型
收费全文 | 1084篇 |
免费 | 130篇 |
国内免费 | 12篇 |
专业分类
化学 | 9篇 |
力学 | 8篇 |
综合类 | 18篇 |
数学 | 1047篇 |
物理学 | 144篇 |
出版年
2023年 | 17篇 |
2022年 | 38篇 |
2021年 | 30篇 |
2020年 | 25篇 |
2019年 | 29篇 |
2018年 | 29篇 |
2017年 | 53篇 |
2016年 | 36篇 |
2015年 | 29篇 |
2014年 | 95篇 |
2013年 | 90篇 |
2012年 | 67篇 |
2011年 | 61篇 |
2010年 | 68篇 |
2009年 | 78篇 |
2008年 | 67篇 |
2007年 | 81篇 |
2006年 | 55篇 |
2005年 | 40篇 |
2004年 | 23篇 |
2003年 | 17篇 |
2002年 | 27篇 |
2001年 | 23篇 |
2000年 | 20篇 |
1999年 | 7篇 |
1998年 | 14篇 |
1997年 | 10篇 |
1996年 | 7篇 |
1995年 | 12篇 |
1994年 | 8篇 |
1993年 | 6篇 |
1992年 | 6篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 1篇 |
1987年 | 4篇 |
1986年 | 4篇 |
1985年 | 9篇 |
1984年 | 11篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1226条查询结果,搜索用时 375 毫秒
51.
An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP) 总被引:3,自引:0,他引:3
The multi-objective resource allocation problem (MORAP) addresses the important issue which seeks to find the expected objectives by allocating the limited amount of resource to various activates. Resources may be manpower, assets, raw material or anything else in limited supply which can be used to accomplish the goals. The goals may be objectives (i.e., minimizing costs, or maximizing efficiency) usually driven by specific future needs. In this paper, in order to obtain a set of Pareto solution efficiently, we proposed a modified version of ant colony optimization (ACO), in this algorithm we try to increase the efficiency of algorithm by increasing the learning of ants. Effectiveness and efficiency of proposed algorithm was validated by comparing the result of ACO with hybrid genetic algorithm (hGA) which was applied to MORAP later. 相似文献
52.
Typical formulations of thep-median problem on a network assume discrete nodal demands. However, for many problems, demands are better represented by continuous functions along the links, in addition to nodal demands. For such problems, optimal server locations need not occur at nodes, so that algorithms of the kind developed for the discrete demand case can not be used. In this paper we show how the 2-median of a tree network with continuous link demands can be found using an algorithm based on sequential location and allocation. We show that the algorithm will converge to a local minimum and then present a procedure for finding the global minimum solution. 相似文献
53.
Despite a growing interest in channel coordination, no detailed analytical or numerical results measuring its impact on system performance have been reported in the literature. Hence, this paper aims to develop analytical and numerical results documenting the system-wide cost improvement rates that are due to coordination. To this end, we revisit the classical buyer–vendor coordination problem introduced by Goyal [S.K. Goyal, An integrated inventory model for a single-supplier single-customer problem. International Journal of Production Research 15 (1976) 107–111] and extended by Toptal et al. [A. Toptal, S. Çetinkaya, C.-Y. Lee, The buyer–vendor coordination problem: modeling inbound and outbound cargo capacity and costs, IIE Transactions on Logistics and Scheduling 35 (2003) 987–1002] to consider generalized replenishment costs under centralized decision making. We analyze (i) how the counterpart centralized and decentralized solutions differ from each other, (ii) under what circumstances their implications are similar, and (iii) the effect of generalized replenishment costs on the system-wide cost improvement rates that are due to coordination. First, considering Goyal’s basic setting, we show that the improvement rate depends on cost parameters. We characterize this dependency analytically, develop analytical bounds on the improvement rate, and identify the problem instances in which considerable savings can be achieved through coordination. Next, we analyze Toptal et al.’s [A. Toptal, S. Çetinkaya, C.-Y. Lee, The buyer–vendor coordination problem: modeling inbound and outbound cargo capacity and costs, IIE Transactions on Logistics and Scheduling 35 (2003) 987–1002] extended setting that considers generalized replenishment costs representing inbound and outbound transportation considerations, and we present detailed numerical results quantifying the value of coordination. We report significant improvement rates with and without explicit transportation considerations, and we present numerical evidence which suggests that larger rates are more likely in the former case. 相似文献
54.
In this paper, we address the problem of allocating the work elements, belonging to the products of a lot, to the stations of an assembly line so as to minimize the makespan. The lots that are processed on the assembly line are characterized by a low overall demand for each product. There is no buffer permitted in between the stations, and the line operates under learning. In particular, the stations’ learning slopes are assumed to be different. We present a procedure to determine the optimal assignments of the workload to the stations under learning variability and show that it considerably affects these assignments. 相似文献
55.
A survey of berth allocation and quay crane scheduling problems in container terminals 总被引:2,自引:0,他引:2
Due to the variety of technical equipments and terminal layouts, research has produced a multitude of optimization models for seaside operations planning in container terminals. To provide a support in modeling problem characteristics and in suggesting applicable algorithms this paper reviews the relevant literature. For this purpose new classification schemes for berth allocation problems and quay crane scheduling problems are developed. Particular focus is put on integrated solution approaches which receive increasing importance for the terminal management. 相似文献
56.
根据我国现行的税法,个人所得税纳税采用九级累进税率.年工资和年终奖在速算扣除数个数上存在不同,使得对于相同的税前年收入,如果采用不同的年工资和年终奖分配方案会产生不同的税后实际所得.通过简化变量和缩小有效解区域,以及一系列严格的数学推导,得到了任意年收入下,月工资和年终奖的最优分配方案,使得在现有税制下,纳税额最小,税后收入最大.这个最优方案避免了税金负效应现象,保证了纳税公平性,有利于国家税务监管,企业员工薪金分配和个人纳税筹划;具有广阔的应用前景. 相似文献
57.
We consider a two-level vendor-managed system in which external demand occurs only at a retailer and a supplier replenishes the retailer employing an order-up-to S policy over T periods. We present an O(T3) algorithm to coordinate the system when S is known. We also show that S can be optimized in O(aT3) time for an input parameter a. 相似文献
58.
In this paper, we define a new rule for the resolution of the slack allocation problem in a PERT network. This problem exists of allocating existing extra time in some paths among the activities belonging to those paths. The allocation rule that we propose assigns extra time to the activities proportionally to their durations in such a way that no path duration exceeds the completion time of the whole project. This time allocation enables us to make a schedule for the PERT project under study. We give two characterizations of the rule and we compare it with others that have been previously defined in the literature. 相似文献
59.
M. A. Mosquera I. García-Jurado M. G. Fiestras-Janeiro 《Annals of Operations Research》2008,158(1):183-188
In this note we deal with inventory games as defined in Meca et al. (Math. Methods Oper. Res. 57:483–491, 2003). In that context we introduce the property of immunity to coalitional manipulation, and demonstrate that the SOC-rule (Share the Ordering Cost) is the unique allocation rule for inventory games which satisfies
this property.
The authors acknowledge the financial support of Ministerio de Educación y Ciencia, FEDER and Xunta de Galicia through projects SEJ2005-07637-C02-02 and PGIDIT06PXIC207038PN. 相似文献
60.
In this article we propose to partially integrate the antenna positioning (APP) and frequency allocation problems (FAP). The traditional wireless network design process examines these two major issues sequentially in order to avoid the very high complexity associated with the simultaneous resolution of the two problems. The proposed integration involves the introduction of interference protection guarantees within the APP. It is customary to define such guarantees in an intermediate step and to use them as input to FAP, in order to protect against interference in critical areas. The proposed approach consists of selecting these protections while solving the APP, allowing the optimization procedure to exploit the degrees of freedom that this would offer. Results on two real-life problem instances indicate a significant improvement in interference levels and resource utilization. 相似文献