全文获取类型
| 收费全文 | 858篇 |
| 免费 | 13篇 |
| 国内免费 | 4篇 |
专业分类
| 875篇 |
出版年
| 2025年 | 2篇 |
| 2024年 | 2篇 |
| 2023年 | 6篇 |
| 2022年 | 2篇 |
| 2021年 | 6篇 |
| 2020年 | 16篇 |
| 2019年 | 15篇 |
| 2018年 | 7篇 |
| 2017年 | 42篇 |
| 2016年 | 37篇 |
| 2015年 | 34篇 |
| 2014年 | 45篇 |
| 2013年 | 90篇 |
| 2012年 | 40篇 |
| 2011年 | 37篇 |
| 2010年 | 38篇 |
| 2009年 | 48篇 |
| 2008年 | 47篇 |
| 2007年 | 56篇 |
| 2006年 | 48篇 |
| 2005年 | 37篇 |
| 2004年 | 38篇 |
| 2003年 | 27篇 |
| 2002年 | 22篇 |
| 2001年 | 26篇 |
| 2000年 | 22篇 |
| 1999年 | 10篇 |
| 1998年 | 11篇 |
| 1997年 | 10篇 |
| 1996年 | 7篇 |
| 1995年 | 4篇 |
| 1994年 | 3篇 |
| 1993年 | 7篇 |
| 1992年 | 10篇 |
| 1991年 | 6篇 |
| 1990年 | 10篇 |
| 1989年 | 4篇 |
| 1988年 | 3篇 |
排序方式： 共有875条查询结果，搜索用时 15 毫秒
541.
This note studies the optimal inspection policies in a supply chain in which a manufacturer purchases components from a supplier but has no direct control of component quality. The manufacturer uses an inspection policy and a damage cost sharing contract to encourage the supplier to improve the component quality. We find that all‐or‐none inspection policies are optimal for the manufacturer if the supplier's share of the damage cost is larger than a threshold; otherwise, the manufacturer should inspect a fraction of a batch. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
542.
Data envelopment analysis (DEA) is a method for measuring the efficiency of peer decision making units (DMUs). This tool has been utilized by a number of authors to examine two‐stage processes, where all the outputs from the first stage are the only inputs to the second stage. The current article examines and extends these models using game theory concepts. The resulting models are linear, and imply an efficiency decomposition where the overall efficiency of the two‐stage process is a product of the efficiencies of the two individual stages. When there is only one intermediate measure connecting the two stages, both the noncooperative and centralized models yield the same results as applying the standard DEA model to the two stages separately. As a result, the efficiency decomposition is unique. While the noncooperative approach yields a unique efficiency decomposition under multiple intermediate measures, the centralized approach is likely to yield multiple decompositions. Models are developed to test whether the efficiency decomposition arising from the centralized approach is unique. The relations among the noncooperative, centralized, and standard DEA approaches are investigated. Two real world data sets and a randomly generated data set are used to demonstrate the models and verify our findings. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
543.
利用Mann迭代技巧,讨论了不具有紧性条件的随机非单调二元算子方程随机不动点的存在唯一性,并给出了迭代序列收敛于解的误差估计,所得结果是某些已知结果的本质改进和推广。 相似文献
544.
545.
Leah Epstein 《海军后勤学研究》2009,56(8):780-786
In many applications of packing, the location of small items below large items, inside the packed boxes, is forbidden. We consider a variant of the classic online one‐dimensional bin packing, in which items allocated to each bin are packed there in the order of arrival, satisfying the condition above. This variant is called online bin packing problem with LIB (larger item in the bottom) constraints. We give an improved analysis of First Fit showing that its competitive ratio is at most , and design a lower bound of 2 on the competitive ratio of any online algorithm. In addition, we study the competitive ratio of First Fit as a function of an upper bound (where d is a positive integer) on the item sizes. Our upper bound on the competitive ratio of First Fit tends to 2 as d grows, whereas the lower bound of two holds for any value of d. Finally, we consider several natural and well known algorithms, namely, Best Fit, Worst Fit, Almost Worst Fit, and Harmonic, and show that none of them has a finite competitive ratio for the problem. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
546.
In this paper we consider a transportation problem where several products have to be shipped from an origin to a destination by means of vehicles with given capacity. Each product is made available at the origin and consumed at the destination at the same constant rate. The time between consecutive shipments must be greater than a given minimum time. All demand needs to be satisfied on time and backlogging is not allowed. The problem is to decide when to make the shipments and how to load the vehicles with the objective of minimizing the long run average of the transportation and the inventory costs at the origin and at the destination over an infinite horizon. We consider two classes of practical shipping policies, the zero inventory ordering (ZIO) policies and the frequency‐based periodic shipping (FBPS) policies. We show that, in the worst‐case, the Best ZIO policy has a performance ratio of . A better performance guarantee of is shown for the best possible FBPS policy. The performance guarantees are tight. Finally, combining the Best ZIO and the Best FBPS policies, a policy that guarantees a performance is obtained. Computational results show that this policy gives an average percent optimality gap on all the tested instances of <1%. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
547.
548.
Machine learning algorithms that incorporate misclassification costs have recently received considerable attention. In this paper, we use the principles of evolution to develop and test an evolutionary/genetic algorithm (GA)‐based neural approach that incorporates asymmetric Type I and Type II error costs. Using simulated, real‐world medical and financial data sets, we compare the results of the proposed approach with other statistical, mathematical, and machine learning approaches, which include statistical linear discriminant analysis, back‐propagation artificial neural network, integrated cost preference‐based linear mathematical programming‐based minimize squared deviations, linear integrated cost preference‐based GA, decision trees (C 5.0, and CART), and inexpensive classification with expensive tests algorithm. Our results indicate that the proposed approach incorporating asymmetric error costs results in equal or lower holdout sample misclassification cost when compared with the other statistical, mathematical, and machine learning misclassification cost‐minimizing approaches. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006. 相似文献
549.
550.
In this work, we examine port crane scheduling with spatial and separation constraints. Although common to most port operations, these constraints have not been previously studied. We assume that cranes cannot cross, there is a minimum distance between cranes and jobs cannot be done simultaneously. The objective is to find a crane‐to‐job matching which maximizes throughput under these constraints. We provide dynamic programming algorithms, a probabilistic tabu search, and a squeaky wheel optimization heuristic for solution. Experiments show the heuristics perform well compared with optimal solutions obtained by CPLEX for small scale instances where a squeaky wheel optimization with local search approach gives good results within short times. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献