Learn More
In a military conflict, the defense tries to save as many of its assets as possible. In this paper we will assume that the defense can fire its weapons in stages and that the outcomes of the engagements of a stage are observed before assignments for the next stage are made. We will outline a method for deciding on the number of weapons to be used in each(More)
We consider the standard single commodity network flow problem with both linear and strictly convex possibly nondifferentiable arc costs. For the case where all arc costs are strictly convex we study the convergence of a dual Gauss-Seide! type relaxation method that is well suited for parallel computation. We then extend this method to the case where some(More)
In traditional CDMA wireless networks, real-time services, such as circuit-switched voice, are transported over the air via synchronous channels because of their stringent delay requirements. In the third generation networks (3G), IxEV-DV [A.Soong et al., 2003] and HSDPA [E. Dahlman et al., 1998], an additional time shared channel was introduced on the(More)
We consider a multi-stage version of the Weapon-Target Allocation problem. This problem models the following battle scenario. The offense launches a number of weapons (the targets) which are aimed at assets of the defense. These targets are assigned values by the defense. The defense has a number of (non-reusable) defensive weapons each of which can engage(More)