全文获取类型
收费全文 | 32755篇 |
免费 | 3895篇 |
国内免费 | 2889篇 |
专业分类
电工技术 | 3523篇 |
技术理论 | 1篇 |
综合类 | 4345篇 |
化学工业 | 1705篇 |
金属工艺 | 789篇 |
机械仪表 | 2741篇 |
建筑科学 | 1008篇 |
矿业工程 | 572篇 |
能源动力 | 892篇 |
轻工业 | 1263篇 |
水利工程 | 758篇 |
石油天然气 | 689篇 |
武器工业 | 445篇 |
无线电 | 2643篇 |
一般工业技术 | 2644篇 |
冶金工业 | 606篇 |
原子能技术 | 115篇 |
自动化技术 | 14800篇 |
出版年
2024年 | 126篇 |
2023年 | 349篇 |
2022年 | 738篇 |
2021年 | 820篇 |
2020年 | 870篇 |
2019年 | 882篇 |
2018年 | 762篇 |
2017年 | 992篇 |
2016年 | 1143篇 |
2015年 | 1331篇 |
2014年 | 1815篇 |
2013年 | 2362篇 |
2012年 | 2170篇 |
2011年 | 2357篇 |
2010年 | 1916篇 |
2009年 | 2111篇 |
2008年 | 2318篇 |
2007年 | 2559篇 |
2006年 | 2280篇 |
2005年 | 1906篇 |
2004年 | 1642篇 |
2003年 | 1340篇 |
2002年 | 1166篇 |
2001年 | 939篇 |
2000年 | 841篇 |
1999年 | 628篇 |
1998年 | 493篇 |
1997年 | 452篇 |
1996年 | 363篇 |
1995年 | 290篇 |
1994年 | 273篇 |
1993年 | 201篇 |
1992年 | 190篇 |
1991年 | 156篇 |
1990年 | 117篇 |
1989年 | 103篇 |
1988年 | 104篇 |
1987年 | 59篇 |
1986年 | 55篇 |
1985年 | 38篇 |
1984年 | 52篇 |
1983年 | 30篇 |
1982年 | 36篇 |
1981年 | 23篇 |
1980年 | 24篇 |
1979年 | 29篇 |
1978年 | 11篇 |
1977年 | 21篇 |
1976年 | 14篇 |
1975年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
941.
Persistent calls come from within the graduate medical education community and from external sources for regulating the resident duty hours in order to meet the obligations about the quality of resident education, the well-being of residents themselves, and the quality of patient care services. The report of the Accreditation Council for Graduate Medical Education (ACGME) proposes common program requirements for resident hours. In this paper, we first develop a mixed-integer programming model for scheduling residents’ duty hours considering the on-call night, day-off, rest period, and total work-hour ACGME regulations as well as the demand coverage requirements of the residency program. Subsequently, we propose a column generation model that consists of a master problem and an auxiliary problem. The master problem finds a configuration of individual schedules that minimizes the sum of deviations from the desired service levels for the day and night periods. The formulation of this problem is possible by representing the feasible schedules using column variables, whereas the auxiliary problem finds the whole set of feasible schedules using constraint programming. The proposed approach has been tested on a series of problems using real data obtained from a hospital. The results indicate that high-quality schedules can be obtained within a few seconds. 相似文献
942.
This paper proposes a two-stage stochastic programming model for the parallel machine scheduling problem where the objective is to determine the machines' capacities that maximize the expected net profit of on-time jobs when the due dates are uncertain. The stochastic model decomposes the problem into two stages: The first (FS) determines the optimal capacities of the machines whereas the second (SS) computes an estimate of the expected profit of the on-time jobs for given machines' capacities. For a given sample of due dates, SS reduces to the deterministic parallel weighted number of on-time jobs problem which can be solved using the efficient branch and bound of M’Hallah and Bulfin [16]. FS is tackled using a sample average approximation (SAA) sampling approach which iteratively solves the problem for a number of random samples of due dates. SAA converges to the optimum in the expected sense as the sample size increases. In this implementation, SAA applies a ranking and selection procedure to obtain a good estimate of the expected profit with a reduced number of random samples. Extensive computational experiments show the efficacy of the stochastic model. 相似文献
943.
This paper considers an economic lot sizing model with constant capacity, non-increasing setup cost, and convex inventory cost function. Algorithms with computational time of O(N×TDN)have been developed for solving the model, where N is the number of planning periods and TDN is the total demand. This study partially characterizes the optimal planning structure of the model. A new efficient algorithm with computational time of O(N log N) has also been developed based on the partial optimal structure. Moreover, computational study demonstrates that the new algorithm is efficient. 相似文献
944.
The problem of a multi-period supplier selection and order allocation in make-to-order environment in the presence of supply chain disruption and delay risks is considered. Given a set of customer orders for finished products, the decision maker needs to decide from which supplier and when to purchase product-specific parts required for each customer order to meet customer requested due date at a low cost and to mitigate the impact of supply chain risks. The selection of suppliers and the allocation of orders over time is based on price and quality of purchased parts and reliability of supplies. For selection of dynamic supply portfolio a mixed integer programming approach is proposed to incorporate risk that uses conditional value-at-risk via scenario analysis. In the scenario analysis, the low-probability and high-impact supply disruptions are combined with the high probability and low impact supply delays. The proposed approach is capable of optimizing the dynamic supply portfolio by calculating value-at-risk of cost per part and minimizing expected worst-case cost per part simultaneously. Numerical examples are presented and some computational results are reported. 相似文献
945.
We present a computational study of parametric tabu search for solving 0–1 mixed integer programming (MIP) problems, a generic heuristic for general MIP problems proposed by Glover [Glover F. Parametric tabu-search for mixed integer programs. Computers and Operations Research 2006; 33: 2449–94.]. This approach solves a series of linear programming problems by incorporating branching inequalities as weighted terms in the objective function. New strategies are proposed for uncovering feasible and high-quality solutions and extensive computational tests are performed on instances from the literature. 相似文献
946.
This paper studies a generalization of the order acceptance and scheduling problem in a single-machine environment where a pool consisting of firm planned orders as well as potential orders is available from which an over-demanded company can select. The capacity available for processing the accepted orders is limited and each order is characterized by a known processing time, delivery date, revenue and a weight representing a penalty per unit-time delay beyond the delivery date. We prove that the existence of a constant-factor approximation algorithm for this problem is unlikely. We propose two linear formulations that are solved using an IP solver and we devise two exact branch-and-bound procedures able to solve instances with up to 50 jobs within reasonable CPU times. We compare the efficiency and quality of the results obtained using the different solution approaches. 相似文献
947.
In this paper, a new algorithm for solving constrained nonlinear programming problems is presented. The basis of our proposed algorithm is none other than the necessary and sufficient conditions that one deals within a discrete constrained local optimum in the context of the discrete Lagrange multipliers theory. We adopt a revised particle swarm optimization algorithm and extend it toward solving nonlinear programming problems with continuous decision variables. To measure the merits of our algorithm, we provide numerical experiments for several renowned benchmark problems and compare the outcome against the best results reported in the literature. The empirical assessments demonstrate that our algorithm is efficient and robust. 相似文献
948.
Jonathan Gaudreault Jean-Marc Frayret Alain Rousseau Sophie D’Amours 《Computers & Operations Research》2011
Many research initiatives carried out in production management consider process planning and operations scheduling as two separate and sequential functions. However, in certain contexts, the two functions must be better integrated. This is the case in divergent production systems with co-production (i.e. production of different products at the same time from a single product input) when alternative production processes are available. This paper studies such a context and focuses on the case of drying and finishing operations in a softwood lumber facility. The situation is addressed using a single model that simultaneously performs process planning and scheduling. We evaluate two alternative formulations. The first one is based on mixed integer programming (MIP) and the second on constraint programming (CP). We also propose a search procedure to improve the performance of the CP approach. Both approaches are compared with respect to their capacity to generate good solutions in short computation time. 相似文献
949.
Víctor Blanco 《Journal of Symbolic Computation》2011,46(5):511-533
Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the past few years. However, the polynomial case has not been studied in detail due to its theoretical and computational difficulties. This paper presents an algebraic approach for solving these problems. We propose a methodology based on transforming the polynomial optimization problem to the problem of solving one or more systems of polynomial equations and we use certain Gröbner bases to solve these systems. Different transformations give different methodologies that are theoretically stated and compared by some computational tests via the algorithms that they induce. 相似文献
950.
Shortest path problem with uncertain arc lengths 总被引:2,自引:0,他引:2
Yuan Gao 《Computers & Mathematics with Applications》2011,62(6):2591-2600
Uncertainty theory provides a new tool to deal with the shortest path problem with nondeterministic arc lengths. With help from the operational law of uncertainty theory, this paper gives the uncertainty distribution of the shortest path length. Also, it investigates solutions to the α-shortest path and the most shortest path in an uncertain network. It points out that there exists an equivalence relation between the α-shortest path in an uncertain network and the shortest path in a corresponding deterministic network, which leads to an effective algorithm to find the α-shortest path and the most shortest path. Roughly speaking, this algorithm can be broken down into two parts: constructing a deterministic network and then invoking the Dijkstra algorithm. 相似文献