首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   773篇
  免费   129篇
  国内免费   33篇
  2024年   1篇
  2023年   2篇
  2022年   10篇
  2021年   17篇
  2020年   14篇
  2019年   10篇
  2018年   4篇
  2017年   24篇
  2016年   18篇
  2015年   38篇
  2014年   30篇
  2013年   100篇
  2012年   50篇
  2011年   59篇
  2010年   63篇
  2009年   59篇
  2008年   75篇
  2007年   48篇
  2006年   48篇
  2005年   48篇
  2004年   38篇
  2003年   23篇
  2002年   26篇
  2001年   29篇
  2000年   19篇
  1999年   26篇
  1998年   8篇
  1997年   13篇
  1996年   6篇
  1995年   8篇
  1994年   5篇
  1993年   4篇
  1992年   3篇
  1991年   3篇
  1990年   3篇
  1989年   2篇
  1986年   1篇
排序方式: 共有935条查询结果,搜索用时 15 毫秒
931.
We consider three network disconnection problems in a centralized network where a source node provides service to the other nodes, called demand nodes. In network disconnection problems, each demand node gets a certain benefit when connected to a source node and a network attacker destroys edges to prevent demand nodes from achieving benefits. As destroying edges incurs expenses, an attacker considers the following three different strategies. The first is to maximize the sum of benefits of the disconnected nodes while keeping the total edge destruction cost no more than a given budget. The second is to minimize the total destruction cost needed to make a certain amount of benefits not accomplished. The last is to minimize the ratio of the total destruction cost to the benefits not accomplished. In this paper, we develop exact algorithms to solve the above three problems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
932.
We consider a dynamic lot‐sizing model with production time windows where each of n demands has earliest and latest production due dates and it must be satisfied during the given time window. For the case of nonspeculative cost structure, an O(nlogn) time procedure is developed and it is shown to run in O(n) when demands come in the order of latest production due dates. When the cost structure is somewhat general fixed plus linear that allows speculative motive, an optimal procedure with O(T4) is proposed where T is the length of a planning horizon. Finally, for the most general concave production cost structure, an optimal procedure with O(T5) is designed. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
933.
We formulate exact expressions for the expected values of selected estimators of the variance parameter (that is, the sum of covariances at all lags) of a steady‐state simulation output process. Given in terms of the autocovariance function of the process, these expressions are derived for variance estimators based on the simulation analysis methods of nonoverlapping batch means, overlapping batch means, and standardized time series. Comparing estimator performance in a first‐order autoregressive process and the M/M/1 queue‐waiting‐time process, we find that certain standardized time series estimators outperform their competitors as the sample size becomes large. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
934.
We consider a manufacturer (i.e., a capacitated supplier) that produces to stock and has two classes of customers. The primary customer places orders at regular intervals of time for a random quantity, while the secondary customers request a single item at random times. At a predetermined time the manufacturer receives advance demand information regarding the order size of the primary customer. If the manufacturer is not able to fill the primary customer's demand, there is a penalty. On the other hand, serving the secondary customers results in additional profit; however, the manufacturer can refuse to serve the secondary customers in order to reserve inventory for the primary customer. We characterize the manufacturer's optimal production and stock reservation policies that maximize the manufacturer's discounted profit and the average profit per unit time. We show that these policies are threshold‐type policies, and these thresholds are monotone with respect to the primary customer's order size. Using a numerical study we provide insights into how the value of information is affected by the relative demand size of the primary and secondary customers. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
935.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号