首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   11篇
  免费   0篇
  2018年   2篇
  2013年   2篇
  2010年   1篇
  2007年   2篇
  2000年   2篇
  1999年   1篇
  1983年   1篇
排序方式: 共有11条查询结果,搜索用时 31 毫秒
1.
2.
3.
This paper systematically analyzes the causes of the escalation of violence during the initial stages of the Jeju Island Rebellion and the failure of South Korean counterinsurgency operations. It is argued that four interrelated factors provided the conditions for armed insurgency in the small island of Jeju: inter-agency tension between the Korean National Police (KNP) and the Korean Constabulary; the mainlanders' misinterpretation of the insurgency; the effect of systematic police brutality; and the role of youth groups. Consequently, two counterinsurgency lessons will be drawn from this study: that inter-agency cooperation and coordination at the tactical level between security branches and the incorporation of local population at the micro-level is essential in conducting efficient and effective counterinsurgency operations.  相似文献   
4.
One of the most important decisions that a firm faces in managing its supply chain is a procurement decision: selecting suitable suppliers among many potential competing sellers and reducing the purchase cost. While both auctions and bargaining have been extensively studied in the literature, the research that combines auctions and bargaining is limited. In this article, we consider a combined auction‐bargaining model in a setting where a single buyer procures an indivisible good from one of many competing sellers. The procurement model that we analyze is a sequential model consisting of the auction phase followed by the bargaining phase. In the auction phase, the sellers submit bids, and the seller with the lowest bid is selected as the winning bidder. In the bargaining phase, the buyer audits the cost of the winning seller and then negotiates with him to determine the final price. For this auction‐bargaining model, we find a symmetric equilibrium bidding strategy for the sellers in a closed form, which is simple to understand and closely related to the classical results in the auction and bargaining literature. We also show that the auction‐bargaining model generates at least as much profit to the buyer as the standard auction or sequential bargaining model. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
5.
In this paper, we consider a new weapon–target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model. We applied Lagrangian relaxation and a branch‐and‐bound method to the problem after transforming the nonlinear constraints into linear ones. An efficient primal heuristic is developed to find a feasible solution to the problem to facilitate the procedure. In the branch‐and‐bound method, three different branching rules are considered and the performances are evaluated. Computational results using randomly generated data are presented. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 640–653, 1999  相似文献   
6.
This article presents another inventory model for situations in which, during the stockout period, a fraction b of the demand is backordered and the remaining fraction 1 ? b is lost. By defining a time-proportional backorder cost and a fixed penalty cost per unit lost, a unimodal objective function representing the average annual cost of operating the inventory system is obtained. The optimal operating policy variables are calculated directly.  相似文献   
7.
In this paper, we consider a new weapon‐target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model, but it can be transformed into a linear integer programming model. We present a branch‐and‐price algorithm for the problem employing the disaggregated formulation, which has exponentially many columns denoting the feasible allocations of weapon systems to each target. A greedy‐style heuristic is used to get some initial columns to start the column generation. A branching strategy compatible with the pricing problem is also proposed. Computational results using randomly generated data show this approach is promising for the targeting problem. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
8.
Transfer pricing refers to the pricing of an intermediate product or service within a firm. This product or service is transferred between two divisions of the firm. Thus, transfer pricing is closely related to the allocation of profits in a supply chain. Motivated by the significant impact of transfer pricing methods for tax purposes on operational decisions and the corresponding profits of a supply chain, in this article, we study a decentralized supply chain of a multinational firm consisting of two divisions: a manufacturing division and a retail division. These two divisions are located in different countries under demand uncertainty. The retail division orders an intermediate product from the upstream manufacturing division and sets the retail price under random customer demand. The manufacturing division accepts or rejects the retail division's order. We specifically consider two commonly used transfer pricing methods for tax purposes: the cost‐plus method and the resale‐price method. We compare the supply chain profits under these two methods. Based on the newsvendor framework, our analysis shows that the cost‐plus method tends to allocate a higher percentage of profit to the retail division, whereas the resale‐price method tends to achieve a higher firm‐wide profit. However, as the variability of demand increases, our numerical study suggests that the firm‐wide and divisional profits tend to be higher under the cost‐plus method than they are under the resale‐price method. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013  相似文献   
9.
This paper examines the discrete equal‐capacity p‐median problem that seeks to locate p new facilities (medians) on a network, each having a given uniform capacity, in order to minimize the sum of distribution costs while satisfying the demand on the network. Such problems arise, for example, in local access and transport area telecommunication network design problems where any number of a set of p facility units can be constructed at the specified candidate sites (hence, the net capacity is an integer multiple of a given unit capacity). We develop various valid inequalities, a separation routine for generating cutting planes that are specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for this class of problems. © 2000 John & Sons, Inc. Naval Research Logistics 47: 166–183, 2000.  相似文献   
10.
There is relatively little formal modeling of the economic effects of armed conflicts even though they have substantial economic effects. We set forth a new model, namely the armed conflict economic impact model – ACEI-Model. The model looks at the economic effects of war in three different stages: (i) pre-conflict stage; (ii) armed conflict stage; and (iii) post-conflict stage. The model is based on economic desgrowth (-δ) and other new conceptual indicators. We evaluate an imaginary armed conflict between China and Japan by applying the ACEI-Model.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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