全文获取类型
收费全文 | 1020篇 |
免费 | 64篇 |
国内免费 | 27篇 |
专业分类
化学 | 113篇 |
力学 | 49篇 |
综合类 | 35篇 |
数学 | 804篇 |
物理学 | 110篇 |
出版年
2024年 | 14篇 |
2023年 | 15篇 |
2022年 | 24篇 |
2021年 | 13篇 |
2020年 | 15篇 |
2019年 | 18篇 |
2018年 | 25篇 |
2017年 | 26篇 |
2016年 | 33篇 |
2015年 | 27篇 |
2014年 | 81篇 |
2013年 | 69篇 |
2012年 | 66篇 |
2011年 | 54篇 |
2010年 | 55篇 |
2009年 | 74篇 |
2008年 | 69篇 |
2007年 | 73篇 |
2006年 | 37篇 |
2005年 | 32篇 |
2004年 | 22篇 |
2003年 | 18篇 |
2002年 | 20篇 |
2001年 | 20篇 |
2000年 | 23篇 |
1999年 | 19篇 |
1998年 | 15篇 |
1997年 | 10篇 |
1996年 | 11篇 |
1995年 | 20篇 |
1994年 | 7篇 |
1993年 | 5篇 |
1992年 | 10篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 5篇 |
1988年 | 13篇 |
1987年 | 4篇 |
1986年 | 7篇 |
1985年 | 19篇 |
1984年 | 8篇 |
1983年 | 4篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1970年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1111条查询结果,搜索用时 15 毫秒
101.
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. 相似文献
102.
In a sustained development scenario, it is often the case that an investment is to be made over time in facilities that generate benefits. The benefits result from joint synergies between the facilities expressed as positive utilities specific to some subsets of facilities. As incremental budgets to finance fixed facility costs become available over time, additional facilities can be opened. The question is which facilities should be opened in order to guarantee that the overall benefit return over time is on the highest possible trajectory. This problem is common in situations such as ramping up a communication or transportation network where the facilities are hubs or service stations, or when introducing new technologies such as alternative fuels for cars and the facilities are fueling stations, or when expanding the production capacity with new machines, or when facilities are functions in a developing organization that is forced to make choices of where to invest limited funding. 相似文献
103.
在电商海量订单背景下,在线订单拣选作业难度加大,因此设计了基于订单完全拆分的拣选分批与拣选路径综合优化模型解决此问题.模型共分两阶段.第一阶段,基于种子算法,设计考虑订单完成度、等待时间与拣选路径的拣选分批模型;第二阶段以拣选单流为单队列,设计多拣选员并行服务的拣选系统.行走策略为基于返回型和遍历型的综合策略,拣选路径优化模型采用模拟退火算法求解.算例分析表明,与传统的不拆分拣选分批模型相比,构建的综合优化模型能够显著提高拣选系统效率.拣选员为4人时,模型能够使总服务时间减少58.79%,订单完成率提高10.09%. 相似文献
104.
105.
In this paper, we propose a modification of Benson’s algorithm for solving multiobjective linear programmes in objective space
in order to approximate the true nondominated set. We first summarize Benson’s original algorithm and propose some small changes
to improve computational performance. We then introduce our approximation version of the algorithm, which computes an inner
and an outer approximation of the nondominated set. We prove that the inner approximation provides a set of -nondominated points. This work is motivated by an application, the beam intensity optimization problem of radiotherapy treatment
planning. This problem can be formulated as a multiobjective linear programme with three objectives. The constraint matrix
of the problem relies on the calculation of dose deposited in tissue. Since this calculation is always imprecise solving the
MOLP exactly is not necessary in practice. With our algorithm we solve the problem approximately within a specified accuracy
in objective space. We present results on four clinical cancer cases that clearly illustrate the advantages of our method. 相似文献
106.
Özgür Kabak Füsun Ülengin Emel Aktaş Şule Önsel Y. Ilker Topcu 《European Journal of Operational Research》2008
Efficient workforce scheduling has an important impact on store profit and customer service. Standard scheduling problems do not recognize the effect of staff availability on customer sales, however, even though the latter is an important factor in the retail sector. In this paper a two-stage model is proposed for this purpose. In the first stage a sales response model is used to specify hourly staff requirements. The output of the sales response model is then used as the input of a mixed integer optimization model, which finds an optimum assignment of the staff to daily shifts. Simulations are used to validate the sales response function, and to revise the model for more accurate results. In the simulations, customer arrivals and sales response error values are generated using appropriate distribution functions. As a case study the proposed model is applied to a Turkish retailer in the apparel sector. 相似文献
107.
Esther M. Arkin 《Computational Geometry》2011,44(8):370-384
We introduce the snowblower problem (SBP), a new optimization problem that is closely related to milling problems and to some material-handling problems. The objective in the SBP is to compute a short tour for the snowblower to follow to remove all the snow from a domain (driveway, sidewalk, etc.). When a snowblower passes over each region along the tour, it displaces snow into a nearby region. The constraint is that if the snow is piled too high, then the snowblower cannot clear the pile.We give an algorithmic study of the SBP. We show that in general, the problem is NP-complete, and we present polynomial-time approximation algorithms for removing snow under various assumptions about the operation of the snowblower. Most commercially available snowblowers allow the user to control the direction in which the snow is thrown. We differentiate between the cases in which the snow can be thrown in any direction, in any direction except backwards, and only to the right. For all cases, we give constant-factor approximation algorithms; the constants increase as the throw direction becomes more restricted. Our results are also applicable to robotic vacuuming (or lawnmowing) with bounded-capacity dust bin. 相似文献
108.
以国家重大区域规划中的长三角为实证研究对象,利用加权灰色关联度筛选出与政策效果评价关联性高度相关的政策指标:中央财政专项拨款、中央补助收入、中央固定资产投资额,进而建立政策指标与规划目标的第三产业增加值的对数回归函数,通过过去的数据预测某一特定年份第三产业增加值,并与该年份的实际值进行对比、评价国家重大区域规划的政策效果。本文的特色与创新一是通过灰色关联度剔除与政策效果评价关联度小的指标,筛选出对重大区域规划政策效果有显著影响的关键因素。二是通过时间权向量对政策指标的关联度进行加权,体现时间越近的年份、加权灰色关联度越大,指标越应该保留的思路,保证年份越近的指标数据、对评价结果影响越显著。三是通过历史数据的预测,得到在没有规划政策下、区域自然发展的目标效果,并把其与同一时点、政策实施后的实际效果进行对比,得到政策实施后的政策绩效。实证结果表明应该增大对上海和浙江影响显著的中央财政专项拨款的政策投入,减少对上海和浙江影响不显著的中央固定资产投资额的投入。 相似文献
109.
Helene Gunnarsson Mikael Rönnqvist Dick Carlsson 《Journal of Mathematical Modelling and Algorithms》2007,6(1):25-45
In this paper we consider integrated planning of transportation of raw material, production and distribution of products of the supply chain at Södra Cell AB, a major European pulp mill company. The strategic planning period is one year. Decisions included in the planning are transportation of raw materials from harvest areas to pulp mills, production mix and contents at pulp mills, distribution of pulp products from mills to customer via terminals or directly and selection of potential orders and their levels at customers. Distribution is carried out by three different transportation modes; vessels, trains and trucks. We propose a mathematical model for the entire supply chain which includes a large number of continuous variables and a set of binary variables to reflect decisions about product mix and order selection at customers. Five different alternatives regarding production mix in a case study carried out at Södra Cell are analyzed and evaluated. Each alternative describes which products will be produced at which pulp mills. 相似文献
110.
Javid Jouzdani Seyed Jafar Sadjadi Mohammad Fathian 《Applied Mathematical Modelling》2013,37(18-19):8467-8483
In this paper, dynamic dairy facility location and supply chain planning are studied through minimizing the costs of facility location, traffic congestion and transportation of raw/processed milk and dairy products under demand uncertainty. The proposed model dynamically incorporates possible changes in transportation network, facility investment costs, monetary value of time and changes in production process. In addition, the time variation and the demand uncertainty for dairy products in each period of the planning horizon is taken into account to determine the optimal facility location and the optimal production volumes. Computational results are presented for the model on a number of test problems. Also, an empirical case study is conducted in order to investigate the dynamic effects of traffic congestion and demand uncertainty on facility location design and total system costs. 相似文献