全文获取类型
收费全文 | 373篇 |
免费 | 80篇 |
国内免费 | 14篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 4篇 |
2021年 | 7篇 |
2020年 | 10篇 |
2019年 | 7篇 |
2018年 | 6篇 |
2017年 | 13篇 |
2016年 | 13篇 |
2015年 | 24篇 |
2014年 | 17篇 |
2013年 | 70篇 |
2012年 | 19篇 |
2011年 | 24篇 |
2010年 | 21篇 |
2009年 | 27篇 |
2008年 | 27篇 |
2007年 | 27篇 |
2006年 | 17篇 |
2005年 | 20篇 |
2004年 | 16篇 |
2003年 | 12篇 |
2002年 | 11篇 |
2001年 | 13篇 |
2000年 | 10篇 |
1999年 | 11篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 4篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有467条查询结果,搜索用时 31 毫秒
81.
82.
火灾风险评估是降低火灾损失的有效方法。利用模糊层次分析法,建立了高层建筑火灾风险评估体系,并应用于具体高层建筑的火灾风险评估中。评估结果与实际情况取得了较好的一致性,从而为高层建筑火灾风险评估提供了一种简便可行的方法。 相似文献
83.
This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
84.
Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it. 相似文献
85.
We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable. 相似文献
86.
商务印书馆函授学校英文科在中国近现代成人教育史、职业教育史上都占据着非常重要的位置.1921年至1922年期间的《英语周刊》对英文科学员来源地等信息均有着较为详细的记载,弥补了已发现的相关史料的不足,从而可以对其办学效果做出一个客观、精确的评价.通过《英语周刊》的相关记载,可以发现英文科学员来源地范围覆盖区域非常广泛,其学员来源地构成状况呈现出了多元化、多样化的特点.仅仅从学员来源地状况的角度去审视、考察,商务函授学校英文科取得了显著的办学效果,它在一定程度上弥补了普通学校教育资源的不足,有力促进了中国教育近代化事业的发展. 相似文献
87.
We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
88.
In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
89.
In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
90.
Estimating failure time distribution and its parameters based on intermediate data from a Wiener degradation model 总被引:1,自引:0,他引:1
Instead of measuring a Wiener degradation or performance process at predetermined time points to track degradation or performance of a product for estimating its lifetime, we propose to obtain the first‐passage times of the process over certain nonfailure thresholds. Based on only these intermediate data, we obtain the uniformly minimum variance unbiased estimator and uniformly most accurate confidence interval for the mean lifetime. For estimating the lifetime distribution function, we propose a modified maximum likelihood estimator and a new estimator and prove that, by increasing the sample size of the intermediate data, these estimators and the above‐mentioned estimator of the mean lifetime can achieve the same levels of accuracy as the estimators assuming one has failure times. Thus, our method of using only intermediate data is useful for highly reliable products when their failure times are difficult to obtain. Furthermore, we show that the proposed new estimator of the lifetime distribution function is more accurate than the standard and modified maximum likelihood estimators. We also obtain approximate confidence intervals for the lifetime distribution function and its percentiles. Finally, we use light‐emitting diodes as an example to illustrate our method and demonstrate how to validate the Wiener assumption during the testing. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献