首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   282篇
  免费   13篇
  国内免费   1篇
  2021年   3篇
  2019年   13篇
  2018年   8篇
  2017年   5篇
  2016年   7篇
  2015年   2篇
  2014年   8篇
  2013年   45篇
  2012年   3篇
  2010年   7篇
  2007年   9篇
  2006年   3篇
  2005年   7篇
  2004年   7篇
  2003年   5篇
  2002年   7篇
  2000年   2篇
  1999年   5篇
  1998年   7篇
  1997年   7篇
  1996年   3篇
  1995年   4篇
  1994年   9篇
  1993年   10篇
  1992年   5篇
  1991年   8篇
  1990年   9篇
  1989年   4篇
  1988年   7篇
  1987年   4篇
  1986年   4篇
  1985年   6篇
  1983年   2篇
  1982年   5篇
  1981年   6篇
  1980年   3篇
  1979年   4篇
  1978年   4篇
  1977年   3篇
  1976年   3篇
  1975年   3篇
  1974年   3篇
  1973年   4篇
  1972年   3篇
  1969年   2篇
  1968年   5篇
  1967年   2篇
  1966年   3篇
  1949年   1篇
  1948年   2篇
排序方式: 共有296条查询结果,搜索用时 15 毫秒
291.
292.
In this article, we study a biobjective economic lot‐sizing problem with applications, among others, in green logistics. The first objective aims to minimize the total lot‐sizing costs including production and inventory holding costs, whereas the second one minimizes the maximum production and inventory block expenditure. We derive (almost) tight complexity results for the Pareto efficient outcome problem under nonspeculative lot‐sizing costs. First, we identify nontrivial problem classes for which this problem is polynomially solvable. Second, if we relax any of the parameter assumptions, we show that (except for one case) finding a single Pareto efficient outcome is an ‐hard task in general. Finally, we shed some light on the task of describing the Pareto frontier. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 386–402, 2014  相似文献   
293.
We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
294.
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  相似文献   
295.
ABSTRACT

Since 9/11, the United States has achieved notable gains against al Qaeda, and also Islamic State (IS), all while avoiding another mass-casualty attack at home. Yet, institutionally, culturally, and in its capabilities, the US government remains seriously ill-equipped for the task of countering irregular threats. Partly as a result, Islamist extremism shows no sign of being defeated, having instead metastasized since 9/11 and spread. Why, given the importance accorded to counterterrorism, has the US approach remained inadequate? What is impeding more fundamental reforms? The article evaluates the United States’ way of irregular warfare: its troubled engagement with counterinsurgency and its problematic search for lower cost and lower risk ways of combating terrorism. It suggests needed reforms but acknowledges also the unlikelihood of change.  相似文献   
296.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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