全文获取类型
收费全文 | 3357篇 |
免费 | 428篇 |
国内免费 | 33篇 |
专业分类
化学 | 337篇 |
力学 | 11篇 |
综合类 | 84篇 |
数学 | 1579篇 |
物理学 | 83篇 |
无线电 | 1724篇 |
出版年
2024年 | 9篇 |
2023年 | 39篇 |
2022年 | 74篇 |
2021年 | 92篇 |
2020年 | 93篇 |
2019年 | 92篇 |
2018年 | 76篇 |
2017年 | 120篇 |
2016年 | 152篇 |
2015年 | 138篇 |
2014年 | 269篇 |
2013年 | 217篇 |
2012年 | 219篇 |
2011年 | 234篇 |
2010年 | 221篇 |
2009年 | 247篇 |
2008年 | 230篇 |
2007年 | 228篇 |
2006年 | 174篇 |
2005年 | 156篇 |
2004年 | 115篇 |
2003年 | 104篇 |
2002年 | 80篇 |
2001年 | 81篇 |
2000年 | 58篇 |
1999年 | 48篇 |
1998年 | 38篇 |
1997年 | 27篇 |
1996年 | 25篇 |
1995年 | 22篇 |
1994年 | 10篇 |
1993年 | 15篇 |
1992年 | 12篇 |
1991年 | 7篇 |
1990年 | 11篇 |
1989年 | 8篇 |
1988年 | 20篇 |
1987年 | 5篇 |
1986年 | 6篇 |
1985年 | 17篇 |
1984年 | 13篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1979年 | 3篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有3818条查询结果,搜索用时 46 毫秒
991.
The traveling tournament problem (ttp) consists of finding a distance-minimal double round-robin tournament where the number of consecutive breaks is bounded. For solving the problem exactly, we propose a new branch-and-price approach. The starting point is a new compact formulation for the ttp. The corresponding extensive formulation resulting from a Dantzig-Wolfe decomposition is identical to one given by Easton, K., Nemhauser, G., Trick, M., 2003. Solving the traveling tournament problem: a combined interger programming and constraint programming approach. In: Burke, E., De Causmaecker, P. (Eds.), Practice and Theory of Automated Timetabling IV, Volume 2740 of Lecture Notes in Computer Science, Springer Verlag Berlin/Heidelberg, pp. 100–109, who suggest to solve the tour-generation subproblem by constraint programming. In contrast to their approach, our method explicitly utilizes the network structure of the compact formulation: First, the column-generation subproblem is a shortest-path problem with additional resource and task-elementarity constraints. We show that this problem can be reformulated as an ordinary shortest-path problem over an expanded network and, thus, be solved much faster. An exact variable elimination procedure then allows the reduction of the expanded networks while still guaranteeing optimality. Second, the compact formulation gives rise to supplemental branching rules, which are needed, since existing rules do not ensure integrality in all cases. Third, non-repeater constraints are added dynamically to the master problem only when violated. The result is a fast exact algorithm, which improves many lower bounds of knowingly hard ttp instances from the literature. For some instances, solutions are proven optimal for the first time. 相似文献
992.
We consider the problem of scheduling activities of a project by a firm that competes with another firm that has to perform the same project. The profit that a firm gets from each activity depends on whether the firm finishes the activity before or after its competitor. It is required to find a Nash equilibrium solution or show that no such solutions exist. We present a structural characterization of Nash equilibrium solutions, and a low order polynomial algorithm for the problem. 相似文献
993.
994.
Flexible working arrangements in context: An empirical investigation through self-organizing maps 总被引:1,自引:0,他引:1
Eleni Stavrou Stelios Spiliotis Chris Charalambous 《European Journal of Operational Research》2010,202(3):893-902
This is one of the first studies to utilize Kohonen’s self-organizing maps on flexible work arrangements (FWAs), employee turnover and absenteeism within different national contexts and an array of organizational factors. While the majority of FWAs did not reduce significantly employee turnover or absenteeism, country and industry were significant contextual variables in FWA use: we deciphered six main country regions, where service and manufacturing organizations were important to FWA preferences. We found a curvilinear relationship between turnover and shift-work among manufacturing firms regardless of country: turnover decreases at low levels and increases at high levels of shift-work. We also found strong positive relationships between weekend work and turnover among manufacturing firms regardless of country and firms in the region comprising of Germany, Austria, Sweden, Finland, Denmark, Czech Republic and Belgium. Finally, we found consistently high concentration of organizations with low absenteeism throughout certain industries and countries: noteworthy are service organizations in the Netherlands and manufacturing organizations in Australia. The results demonstrate the contextuality of FWA use across countries and industries, and the usefulness of SOMs for research within human resource management. 相似文献
995.
Train scheduling is a complex and time consuming task of vital importance in many countries. To create completely new train schedules that are more accurate and efficient than permitted by current techniques, a novel “hybrid” job shop approach is proposed and implemented in this paper. Unique characteristics of train scheduling are firstly incorporated into a disjunctive graph representation of the solution. Dedicated “stand-alone” constructive algorithms that utilise this representation are then developed. The modelling approach and the constructive algorithms are essential as they provide the basis for which meta-heuristics and other iterative refinement algorithms can be applied. A numerical investigation and case study is provided and demonstrates the viability of the modelling approach. Furthermore it is demonstrated that good quality solutions are provided with reasonable computational effort. 相似文献
996.
We address the maximization of a project’s expected net present value when the activity durations and cash flows are described by a discrete set of alternative scenarios with associated occurrence probabilities. In this setting, the choice of scenario-independent activity start times frequently leads to infeasible schedules or severe losses in revenues. We suggest to determine an optimal target processing time policy for the project activities instead. Such a policy prescribes an activity to be started as early as possible in the realized scenario, but never before its (scenario-independent) target processing time. We formulate the resulting model as a global optimization problem and present a branch-and-bound algorithm for its solution. Extensive numerical results illustrate the suitability of the proposed policy class and the runtime behavior of the algorithm. 相似文献
997.
Dirk Briskorn Byung-Cheon Choi Kangbok Lee Joseph Leung Michael Pinedo 《European Journal of Operational Research》2010
This paper focuses on single machine scheduling subject to inventory constraints. Jobs either add items to an inventory or remove items from that inventory. Jobs that have to remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a single machine with the minimization of the total weighted completion time, the maximum lateness, and the number of tardy jobs, respectively, as objective and determine their computational complexity. Since the general versions of our problems turn out to be strongly NP-hard, we consider special cases by assuming that different jobs have certain parameter values in common. We determine the computational complexity for all special cases when the objective is either to minimize total completion time or to minimize maximum lateness and for several special cases when the objective is either to minimize total weighted completion time or to minimize the number of tardy jobs. 相似文献
998.
Abstract Inaccurate specification of model coefficients can lead to false or distorted findings in modeling investigations of natural resource management. Hence, this paper outlines a decision framework for optimization problems in which only the bounded set of outcomes for uncertain parameters is known. These models can be solved with standard mathematical programming software and are no larger than their deterministic equivalent. The robust approach is contrasted against deterministic analysis and is demonstrated for two applications regarding the management of natural resources. Deterministic plans are infeasible in at least 40% of cases when parameters vary from their point estimates. Inclusion of robust constraints immunizes against this infeasibility, thereby removing errors arising from false certainty. Additionally, incorporation of bounded parameters in the objective function yields interval‐valued sets containing potential outcomes. However, this increase in the general relevance of model output introduces some degree of suboptimality as deterministic plans are buffered to proactively account for potential variability. The cost of robustness increases with the simulated spread of uncertain coefficients but may be reduced through accounting for the uncertainty aversion of decision makers. 相似文献
999.
1000.
研究具有禁用区间的单机最小化加权完工时间和排序问题.在该问题中,有一些禁用区间已经固定在机器上,工件将被安排在其余自由区间内进行加工且不能与禁用区间重叠.在文献中已经证明,该问题是强NP-困难的,并且在P不等于NP的假设下,该问题不存在2~(q(n))-近似算法.其中,n是工件个数,而q(n)是n的任一多项式.但是,其精确最优算法尚属未知.给出了该问题的一个动态规划最优算法.当禁用区间的数目是固定常数时,该算法是拟多项式的. 相似文献