首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   107篇
  免费   1篇
  2020年   1篇
  2019年   5篇
  2018年   2篇
  2017年   6篇
  2016年   1篇
  2015年   1篇
  2014年   5篇
  2013年   46篇
  2012年   1篇
  2010年   2篇
  2009年   1篇
  2007年   1篇
  2002年   1篇
  2001年   1篇
  2000年   2篇
  1999年   1篇
  1998年   3篇
  1997年   1篇
  1996年   2篇
  1995年   2篇
  1994年   1篇
  1993年   2篇
  1992年   3篇
  1990年   1篇
  1987年   1篇
  1986年   2篇
  1985年   2篇
  1982年   1篇
  1978年   1篇
  1977年   1篇
  1976年   1篇
  1971年   1篇
  1970年   1篇
  1969年   1篇
  1968年   1篇
  1967年   3篇
排序方式: 共有108条查询结果,搜索用时 54 毫秒
71.
In this paper, we explore trade‐offs between operational flexibility and operational complexity in periodic distribution problems. We consider the gains from operational flexibility in terms of vehicle routing costs and customer service benefits, as well as the costs of operational complexity in terms of modeling, solution methods, and implementation challenges for drivers and customers. The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time; the PVRP with service choice (PVRP‐SC) extends the PVRP to allow service (visit) frequency to become a decision of the model. For the periodic distribution problems represented by PVRP and PVRP‐SC, we introduce operational flexibility levers and a set of quantitative measures to evaluate the trade‐offs between flexibility and complexity. We develop a Tabu Search heuristic to incorporate a range of operational flexibility options. We analyze the potential value and the increased operational complexity of the flexibility levers. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
72.
Let Xi be independent IFR random variables and let Yi be independent exponential random variables such that E[Xi]=E[Yi] for all i=1, 2, ? n. Then it is well known that E[min (Xi)] ≥E[min (Xi)]. Nevertheless, for 1≤i≤n exponentially distributed Xi's and for a decreasing convex function ?(.). it is shown that .  相似文献   
73.
74.
An algorithm, based upon dynamic programming, is developed for a class of fixed-cost cargo loading problems. The problems can be formulated as integer programming problems, but cannot be efficiently solved as such because of computational difficulties. The algorithm developed has proved to be very efficient in an actual operations research study involving over 500 different cargo items, more than 40 possible stops and several types of transportation vehicles. A numerical illustration is provided.  相似文献   
75.
76.
NATO burden sharing has become an especially timely issue in the past several years as a result of a number of factors, including Russian annexation of Crimea and destabilization of eastern Ukraine in 2014. This article argues that alliance unity among the great democracies of Europe and North America is indispensable to peace and stability on the Eurasian continent. A fractured NATO, and especially, a large divide in purposes or commitments as between the United States and its European security partners, invites aggression and the possibility of inadvertent escalation. Past successes and failures in US-involved multinational peace and stability operations, within and outside of Europe, show that mission accomplishment requires give and take, including the occasional acceptance of unequal costs and benefits among the members, in order to achieve peace and security objectives.  相似文献   
77.
This article considers a special class of cost allocation problems, where the communication possibilities among the agents are restricted. Integral formulas are derived for two allocation rules: The Myerson value and the position value. © 1993 John Wiley & Sons, Inc.  相似文献   
78.
79.
80.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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