Even if it were but betwixt memory and reputation,in retrospect serves neither

Robert S. McNamara [and Brian Van De Mark,] In Retrospect: The Tragedy and Lessons of Vietnam, NewYork:NewYork Times Books, Random House, 1995. Pp.xviii + 414. $27.50. ISBN 08129–2523–8.     

It's all the rage: why mechanization doesn't explain COIN outcomes

A recent article, ‘Rage Against the Machines’, does a disservice to the debate over what explains counterinsurgency (COIN) success. While it establishes a negative correlation between the diffusion of military mechanization in the state system and COIN success, its theoretical argument does not hold up under close scrutiny and its micro-case comparison of two units in Iraq during 2003–2004 ignores obvious counter-examples and factors that influence COIN success, such as leadership. A deeper inquiry would have revealed that there is much more to COIN success than simply not having access to vehicles.     

Exact expected values of variance estimators for simulation

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     

Single-period inventory models with demand uncertainty and quantity discounts: Behavioral implications and a new solution procedure

Quantity discounts are considered in the context of the single-period inventory model known as “the newsboy problem.” It is argued that the behavioral implications of the all-units discount schedule are more complex and interesting than the literature has suggested. Consideration of this behavior and the use of marginal analysis lead to a new method for solving this problem that is both conceptually simpler and more efficient than the traditional approach. This marginal-cost solution procedure is described graphically, an algorithm is presented, and an example is used to demonstrate that this solution procedure can be extended easily to handle complex discount schedules, such as some combined (simultaneously applied) purchasing and transportation cost discount schedules.     

Hu's precedence tree scheduling algorithm: A simple proof

This article presents a simple proof of Hu's algorithm for scheduling in minimum time a set of tasks constrained by precedence tree constraints, each task requiring a unit time to complete, and where m processors are available.     

On the isbell and marlow fire programming problem

A complete solution is derived to the Isbell and Marlow fire programming problem. The original work of Isbell and Marlow has been extended by determining the regions of the initial state space from which optimal paths lead to each of the terminal states of combat. The solution process has involved determining the domain of controllability for each of the terminal states of combat and the determination of dispersal surfaces. This solution process suggests a solution procedure applicable to a wider class of tactical allocation problems, terminal control attrition differential games. The structure of optimal target engagement policies in “fights to the finish” is discussed.