## Content

### August 1985, Volume 33, Issue 4

**862-881 Bounding the Project Completion Time Distribution in PERT Networks***by*Bajis Dodin**882-910 The Optimality of Unbalancing Both Workloads and Machine Group Sizes in Closed Queueing Networks of Multiserver Queues***by*Kathryn E. Stecke & James J. Solberg**911-927 Explicit Solutions of M / G / C / / N -type Queueing Loops with Generalizations***by*Lester Lipsky**928-933 Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions***by*Hanif D. Sherali & Suvrajeet Sen

### June 1985, Volume 33, Issue 3

**469-490 Distribution Strategies that Minimize Transportation and Inventory Costs***by*Lawrence D. Burns & Randolph W. Hall & Dennis E. Blumenfeld & Carlos F. Daganzo**491-504 A Time-dependent Stopping Problem with Application to Live Organ Transplants***by*Israel David & Uri Yechiali**505-526 Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming***by*R. Kipp Martin & Linus Schrage**527-536 Signature Methods for the Assignment Problem***by*M. L. Balinski**537-547 An Algorithm for the Maximal Multicommodity Funnel-Node Flow in an Undirected Network***by*Ernesto Q. V. Martins & Mario S. Rosa**548-561 On the Expected Relative Performance of List Scheduling***by*E. G. Coffman & E. N. Gilbert**562-574 Minimizing Weighted Completion Times with Deadlines***by*Marc E. Posner**575-588 Optimal Inventory Policies When Ordering Prices are Random***by*Kamal Golabi**589-605 Iterative Aggregation-Disaggregation Procedures for Discounted Semi-Markov Reward Processes***by*Paul J. Schweitzer & Martin L. Puterman & Kyle W. Kindle**606-624 A Concept of Monotonicity and Its Characterization for Closed Queueing Networks***by*Rajan Suri**625-643 The Optimal Look-Ahead Policy for Admission to a Single Server System***by*W. M. Nawijn**644-660 Optimal Control of an M / M / S Queueing System***by*Donald S. Szarkowicz & Thomas W. Knowles**661-677 Efficiency of Multivariate Control Variates in Monte Carlo Simulation***by*Reuven Y. Rubinstein & Ruth Marcus**678-684 Technical Note—On the Optimal Choice of Sizes***by*Peter Tryfos**684-689 Technical Note—The Stochastic Discrete Dynamic Lot Size Problem: An Open-Loop Solution***by*J. B. Lasserre & C. Bes & F. Roubellat**690-695 Technical Note—Optimal Scheduling of Periodic Activities***by*Kyung S. Park & Doek K. Yun**696-698 Technical Note—A Note on the Stochastic Shortest Route Problem***by*Jerzy Kamburowski**699-703 OR Forum—Careers in OR/MS; or, Life after the Ph.D.: A Student/Practitioner/Faculty Discussion***by*R. Jean Ruth & Kathryn E. Stecke & Morris A. Cohen

### April 1985, Volume 33, Issue 2

**237-248 OR Forum—OR and the Airline Overbooking Problem***by*Marvin Rothstein**249-262 Comparing Draws for Single Elimination Tournaments***by*Jeff Horen & Raymond Riezman**263-276 Optimal Unemployment Insurance Policy***by*Dror Zuckerman**277-292 Optimal Supply of a Depletable Resource with a Backstop Technology: Heal's Theorem Revisited***by*Shmuel S. Oren & Stephen G. Powell**293-311 Equilibrium Analysis of Disaggregate Facility Choice Systems Subject to Congestion-Elastic Demand***by*Hau Leung Lee & Morris A. Cohen**312-325 Optimal Ordering Strategies for Announced Price Increases***by*Sam G. Taylor & Charles E. Bradley**326-345 The Deterministic Dynamic Product Cycling Problem***by*Uday S. Karmarkar & Linus Schrage**346-362 A Generalized Uniform Processor System***by*Hiroaki Ishii & Charles Martel & Teruo Masuda & Toshio Nishida**363-377 A Branch and Bound Algorithm for the Total Weighted Tardiness Problem***by*Chris N. Potts & Luk N. Van Wassenhove**378-396 The Transient Behavior of the M / M / s Queue, with Implications for Steady-State Simulation***by*W. David Kelton & Averill M. Law**397-403 The Push-Out-Priority Queue Discipline***by*Daniel P. Heyman**404-411 Replacement of Systems and Components in Renewal Decision Problems***by*L. C. Thomas**412-426 The Sequential Design of Bernoulli Experiments Including Switching Costs***by*Michael Kolonko & Harald Benzing**427-442 Limits for the Precision and Value of Information from Dependent Sources***by*Robert T. Clemen & Robert L. Winkler**443-454 Assessment of Preferences by Conditions on Pricing-Out Amounts***by*Charles M. Harvey**455-458 Technical Note—The Effect of Risk Aversion on the Expected Value of Perfect Information***by*Abraham Mehrez**459-464 Technical Note—Forest Outturn Optimization by Dantzig-Wolfe Decomposition and Dynamic Programming Column Generation***by*G. Eng & H. G. Daellenbach**464-468 Technical Note—On Normalizing Constants in Queueing Networks***by*P. G. Harrison

### February 1985, Volume 33, Issue 1

**1-27 Disappointment in Decision Making Under Uncertainty***by*David E. Bell**28-37 Simultaneous Bidding with a Fixed Charge if Any Bid is Successful***by*Stephen A. Smith & Michael H. Rothkopf**38-48 Ranking with Partial Information: A Method and an Application***by*Craig W. Kirkwood & Rakesh K. Sarin**49-64 An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure***by*J. E. Beasley**65-73 A New Polynomially Bounded Shortest Path Algorithm***by*F. Glover & D. Klingman & N. Phillips**74-84 Parametric Solution of Bicriterion Linear Fractional Programs***by*A. R. Warburton**85-93 Geometric Programming: Estimation of Lagrange Multipliers***by*M. J. Rijckaert & E. J. C. Walraven**94-103 Accuracy and Tactical Implications of Bearings-Only Ranging Algorithms***by*Bernard J. McCabe**104-106 Comments on “Accuracy and Tactical Implications of Bearings-Only Ranging Algorithms”***by*Alan R. Washburn & Peter H. Daly**107-108 Author's Rejoinder***by*Bernard J. McCabe**109-125 A Stochastic Model of Personnel Mobility: Application of Reliability Theory in Manpower System Analysis***by*Robert E. Stanford**126-133 The Comparison of Life Table and Markov Chain Techniques for Follow-up Studies***by*John R. Schoenfelder & Richard H. Shachtman & Gordon J. Johnston**134-152 Numerical Comparisons of Inventory Policies for Periodic Review Systems***by*Evan L. Porteus**153-160 Reliability Bounds for Multistate Systems with Multistate Components***by*Joseph C. Hudson & Kailash C. Kapur**161-167 Tests for the Nonergodicity of Multidimensional Markov Chains***by*Linn I. Sennott**168-182 A Queueing System with General-Use and Limited-Use Servers***by*Linda Green**183-202 Explicit and Iterative Numerical Approaches to Solving Queueing Models***by*Patricia M. Snyder & William J. Stewart**203-209 Further Results on Queues with Partial Correlation***by*Nasser Hadidi**210-217 Technical Note—Measuring Equity in Public Risk***by*Rakesh Kumar Sarin**218-221 Technical Note—Alternative Model Formulations in Nonlinear Programming—Some Disastrous Results***by*Arne Drud**222-227 Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems***by*Bahman Kalantari**228-235 Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities***by*Theodore J. Sheskin

### December 1984, Volume 32, Issue 6

**1195-1220 A Cutting Plane Algorithm for the Linear Ordering Problem***by*Martin Grötschel & Michael Jünger & Gerhard Reinelt**1221-1239 Confidence Intervals for Steady-State Simulations: I. A Survey of Fixed Sample Size Procedures***by*Averill M. Law & W. David Kelton**1240-1267 The Economic Foundation of Generalized Equilibrium Modeling***by*Dale M. Nesbitt**1268-1285 An Efficient Algorithm for Computing Optimal ( s , S ) Policies***by*Awi Federgruen & Paul Zipkin**1286-1295 Production-Inventory with Equipment Replacement—PIER***by*M. Venkatesan**1296-1308 Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions***by*Robert L. Smith**1309-1327 Some Properties of Location Problems with Block and Round Norms***by*J.-F. Thisse & J. E. Ward & R. E. Wendell**1328-1344 A Separating Choice Hyperplane Algorithm for Evaluating Multiattribute Decisions***by*Ted Dintersmith**1345-1357 Nested Renewal Processes with Special Erlangian Densities***by*A. Bendell & N. H. Scott**1358-1367 Realizable Performance Vectors of a Finite-Source Queue***by*Hisao Kameda**1368-1373 Technical Note—A Note on the M / G /1 Queue with Server Vacations***by*S. W. Fuhrmann**1374-1380 Technical Note—Financial Market Approaches to Facility Location under Uncertainty***by*James E. Hodder**1381-1384 Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming***by*Thomas H. Byers & Michael S. Waterman

### October 1984, Volume 32, Issue 5

**983-998 Probabilistic Analysis of Bin Packing Heuristics***by*Hoon Liong Ong & M. J. Magazine & T. S. Wee**999-1018 Deterministic Approximations to Stochastic Production Problems***by*Gabriel R. Bitran & Horacio H. Yanasse**1019-1037 A Combined Vehicle Routing and Inventory Allocation Problem***by*Awi Federgruen & Paul Zipkin**1038-1051 The Monopolistic Firm, Random Demand, and Bayesian Learning***by*Dung Nguyen**1052-1068 A State-of-the-World Decomposition Approach to Dynamics and Uncertainty in Electric Utility Generation Expansion Planning***by*Adam B. Borison & Peter A. Morris & Shmuel S. Oren**1069-1086 Sensitivity Analysis for the General Spatial Economic Equilibrium Problem***by*Stella Dafermos & Anna Nagurney**1087-1106 The Linear Sharing Problem***by*J. Randall Brown**1107-1115 The Optimal Search for a Moving Target When the Search Path Is Constrained***by*James N. Eagle**1116-1132 M / M /1 Queueing Decision Processes with Monotone Hysteretic Optimal Policies***by*F. V. Lu & R. F. Serfozo**1133-1162 Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues***by*Susan L. Albin**1163-1180 Dynamic Routing in a Queueing System with a Multiple Service Facility***by*Janusz Filipiak**1181-1184 Technical Note—On Waiting Times for a Queue in Which Customers Require Simultaneous Service from a Random Number of Servers***by*Andrew F. Seila**1185-1193 Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program***by*James C. Bean

### August 1984, Volume 32, Issue 4

**753-773 A Tandem Network of Queues with Deterministic Service and Intermediate Arrivals***by*Michael Shalmon & Michael A. Kaplan**774-784 M / G /1/ N Queue with Vacation Time and Exhaustive Service Discipline***by*Tony T. Lee**785-795 Inequalities between Arrival Averages and Time Averages in Stochastic Processes Arising from Queueing Theory***by*Shun-Chen Niu**796-808 The Output of the M/M/s Queue***by*D. E. Everitt & T. Downs**809-817 Optimal Prediction of Queue Lengths and Delays in GI / M / m Multiserver Queues***by*C. Murray Woodside & David A. Stanford & Bernard Pagurek**818-836 Computational Issues in an Infinite-Horizon, Multiechelon Inventory Model***by*Awi Federgruen & Paul Zipkin**837-846 Nonoptimal Edges for the Symmetric Traveling Salesman Problem***by*Roy Jonker & Ton Volgenant**847-858 The Secretary Problem with Optimal Assignment***by*Mitsushi Tamaki**859-877 Determining the K Most Critical Paths in PERT Networks***by*Bajis Dodin**878-900 A Decomposition Algorithm for a Discrete Location-Allocation Problem***by*Hanif D. Sherali & Warren P. Adams**901-908 Equity Axioms for Public Risks***by*Peter C. Fishburn**909-916 Conditions for Finite Ladder Height and Delay Moments***by*Ronald W. Wolff**917-925 Extensions of the Freund Distribution with Applications in Reliability Theory***by*Moshe Shaked**926-944 Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes***by*Benjamin Melamed & Micha Yadin**945-951 Technical Note—A Class of Stochastic Mathematical Programs with Correlated Scale Parameters in the Objective and Right-Hand Side***by*A. L. Soyster & R. D. Foley & F. H. Murphy**952-957 Technical Note—A Note on Linearly Decreasing, Delay-Dependent Non-Preemptive Queue Disciplines***by*Uttarayan Bagchi**958-967 OR Forum—Of Radar and Operations Research: An Appreciation of A. P. Rowe (1898–1976)***by*W. Peyton Cunningham & Denys Freeman & Joseph F. McCloskey**968-969 Letter to the Editor—Decision-Aiding Models vs. Decision Support Systems***by*Andrew Vazsonyi**969-970 Letter to the Editor—In Remembrance of Richard Clasen***by*Gerald G. Brown

### June 1984, Volume 32, Issue 3

**477-477 Preface—Reliability and Maintainability***by*Daniel P. Heyman & Nozer D. Singpurwalla**478-492 A Survey of Network Reliability and Domination Theory***by*Avinash Agrawal & Richard E. Barlow**493-515 An O (| E |) Time Algorithm for Computing the Reliability of a Class of Directed Networks***by*Avinash Agrawal & A. Satyanarayana**516-526 Computing Network Reliability in Time Polynomial in the Number of Cuts***by*J. Scott Provan & Michael O. Ball**527-536 Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable***by*J. L. Gastwirth & P. K. Bhattacharya**537-546 Decreasing Failure Rates and Related Issues in the Social Sciences***by*Yigal Gerchak**547-558 A General Framework for Learning Curve Reliability Growth Models***by*William S. Jewell**559-565 Some Reliability Models for Safety Assessment***by*W. A. Thompson**566-574 Inspection Policies for Fault Location***by*David A. Butler & Gerald J. Lieberman**575-583 Effects of False and Incomplete Identification of Defective Items on the Reliability of Acceptance Sampling***by*Samuel Kotz & Norman L. Johnson**584-595 A Preventive Replacement Policy for Units Subject to Intermittent Demand***by*Menachem Berg**596-606 The Total Time on Test Concept and Its Use in Reliability Theory***by*Bo Bergman & Bengt Klefsjö**607-615 On the Reliability of Repairable Systems***by*Mark Brown**616-627 On the Use of Replacements to Extend System Life***by*C. Derman & G. J. Lieberman & S. M. Ross**628-640 The Interval Estimation of System Reliability from Component Test Data***by*Alan Winterbottom**641-648 Series Systems and Reliability Demonstration Tests***by*Saul Blumenthal & J. Arthur Greenwood & Leon H. Herbach**649-659 Models for Fiber-Matrix Composites with Local Load Sharing***by*Richard L. Smith & Howard M. Taylor**660-667 Inequalities for NBUE and NWUE Life Distributions***by*Robert L. Launer**668-678 Percentile Residual Life Functions***by*Harry Joe & Frank Proschan**679-687 Some Reliability Applications of the Variability Ordering***by*Sheldon M. Ross & Zvi Schechner**688-702 Multivariate Phase-Type Distributions***by*David Assaf & Naftali A. Langberg & Thomas H. Savits & Moshe Shaked**703-714 Continuous Multistate Structure Functions***by*H. W. Block & T. H. Savits**715-725 Selecting an Extreme-Value Distribution and the Transforming to a Specified Distribution***by*Fabián Hernández & Richard A. Johnson**726-731 Interval Estimation After Sequential Testing Based on the Total Time on Test***by*W. J. Padgett & L. J. Wei**732-740 Estimating a Survival Curve when New Is Better Than Used***by*Russell A. Boyles & Francisco J. Samaniego**741-749 Estimating the Shift to Wear-Out of Systems Having Exponential-Weibull Life Distributions***by*S. Zacks

### April 1984, Volume 32, Issue 2

**229-249 OR Practice—A Queueing Model for Telephone Operator Staffing***by*David Y. Sze**250-269 Hospital Profit Planning under Medicare Reimbursement***by*Richard C. Morey & David A. Dittman**270-289 Development Planning and Management of Petroleum Reservoirs Using Tank Models and Nonlinear Programming***by*James W. McFarland & Leon Lasdon & Verne Loose**290-313 Long-Range Generation Planning Using Generalized Benders' Decomposition: Implementation and Experience***by*Jeremy A. Bloom & Michael Caramanis & Leonid Charny**314-342 A Geometric Programming Model for the Optimal Design of Wastewater Treatment Plants***by*Yves Smeers & Daniel Tyteca**343-361 The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes***by*Donald Gross & Douglas R. Miller**362-379 Dynamic Lot-Sizing When Demand Timing Is Uncertain***by*Michael C. Burstein & Christopher H. Nevison & Robert C. Carlson**380-389 An Algorithm for the Bottleneck Traveling Salesman Problem***by*Giorgio Carpaneto & Silvano Martello & Paolo Toth**390-404 A Multiple Leader Stackelberg Model and Analysis***by*Hanif D. Sherali**405-422 A Weighted Selection Algorithm for Certain Tree-Structured Linear Programs***by*Bruce Faaland**423-439 A Dichotomous Search for a Geometric Random Variable***by*Refael Hassin**440-448 Minimizing Flow Time on Parallel Identical Processors with Variable Unit Processing Time***by*I. Meilijson & A. Tamir**449-450 Technical Note—On Min-Max Integer Allocation Problems***by*Tetsuo Ichimori**451-456 Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs***by*Michael H. Rothkopf & Stephen A. Smith**457-464 Technical Note—Assessment of Risk Attitude by a Utility Dependence Condition***by*Charles M. Harvey**465-476 OR Forum—The Origin of Operational Research***by*Harold Larnder

### February 1984, Volume 32, Issue 1

**1-4 Editorial***by*Thomas L. Magnanti**5-6 OR Practice—Area Editor Statement***by*Michael H. Rothkopf**7-22 A System Point Approach to Nonuniform Advertising Insertions***by*Percy H. Brill & Jacob Hornik**23-40 A Mathematical Programming Model for the Location of Access Controls in a Distributed Data Base Environment***by*Yair M. Babad & Jeffrey A. Hoffer**41-51 Minimizing Delays in the GI / G /1 Queue***by*Ward Whitt**52-69 Surrogate Dual Multiplier Search Procedures in Integer Programming***by*Mark H. Karwan & Ronald L. Rardin**70-79 The Solution of the Chemical Equilibrium Programming Problem with Generalized Benders Decomposition***by*Richard J. Clasen**80-88 On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals***by*Barbara Simons & Michael Sipser**89-120 Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time***by*Rolf H. Möhring**121-132 ( s , S ) Policies for a Dynamic Inventory Model with Stochastic Lead Times***by*Richard Ehrhardt**133-147 Capacity Expansion/Contraction of a Facility with Demand Augmentation Dynamics***by*Sol M. Rocklin & Arik Kashper & George C. Varvaloucas**148-168 Sequential Decision Making under Uncertain Future Preferences***by*Chelsea C. White**169-184 An Analytical Evaluation of Alternative Strategies in Steady-State Simulation***by*W. David Kelton & Averill M. Law**185-209 Quantile Estimation in Dependent Sequences***by*P. Heidelberger & P. A. W. Lewis**210-215 Technical Note—An Algorithm for a Class of Discrete Maximum Entropy Problems***by*Dwight Freund & Umesh Saxena**216-220 Technical Note—Proper Efficiency and the Linear Fractional Vector Maximum Problem***by*Eng Ung Choo**221-228 Technical Note—On Reconciling Conflicting Goals: Applications of Multiobjective Programming***by*Robert W. Hahn

### December 1983, Volume 31, Issue 6

**981-982 Preface***by*Richard E. Nance & Nabil R. Adam & Robert G. Sargent**983-1029 Feature Article—Statistical Analysis of Simulation Output Data***by*Averill M. Law**1030-1052 A Unifying View of Hybrid Simulation/Analytic Models and Modeling***by*J. G. Shanthikumar & R. G. Sargent**1053-1073 The Integrated Simulation Environment (Simulation Software of the 1990s)***by*James O. Henriksen**1074-1089 Accelerated Convergence in the Simulation of Countably Infinite State Markov Chains***by*George S. Fishman**1090-1108 Confidence Interval Estimation Using Standardized Time Series***by*Lee Schruben**1109-1144 Simulation Run Length Control in the Presence of an Initial Transient***by*Philip Heidelberger & Peter D. Welch**1145-1166 Regenerative Simulation for Estimating Extreme Values***by*Donald L. Iglehart & Mark L. Stone**1167-1178 Optimal Tests for Initialization Bias in Simulation Output***by*L. Schruben & H. Singh & L. Tierney**1179-1197 Simple Dependent Pairs of Exponential and Uniform Random Variables***by*A. J. Lawrance & P. A. W. Lewis

### October 1983, Volume 31, Issue 5

**803-834 Solving Large-Scale Zero-One Linear Programming Problems***by*Harlan Crowder & Ellis L. Johnson & Manfred Padberg**835-851 Bargaining under Incomplete Information***by*Kalyan Chatterjee & William Samuelson**852-865 A Selection Artifact in Delinquency Data Revisited***by*Luke Tierney**866-880 Reconciliation of Probability Distributions***by*Dennis Lindley**881-890 Resource Allocation with Tree Constraints***by*K. M. Mjelde**891-914 Time Step vs. Dynamic Optimization of Generation-Capacity-Expansion Programs of Power Systems***by*Nissan Levin & Asher Tishler & Jacob Zahavi**915-937 Sensitivity Theory and Its Application to a Large Energy-Economics Model***by*R. G. Alsmiller & J. Barish & J. D. Drischler & J. E. Horwedel & J. L. Lucius & J. W. McAdoo**938-945 Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem***by*Edward K. Baker**946-947 Technical Note—Linearization in 0-1 Variables: A Clarification***by*A. J. Goldman**948-950 Technical Note—A Convexity Result for a Class of GI / G /1 Queueing Systems***by*Hung-Yuan Tu & Hillel Kumin**950-951 Technical Note—A Note on Waiting Times in Single Server Queues***by*Richard R. Weber**952-956 Technical Note—A Note on the One Against Many Battle***by*Kensaku Kikuta**957-965 Technical Note—Cost Formulas for Continuous Review Inventory Models with Fixed Delivery Lags***by*Awi Federgruen & Zvi Schechner**966-971 Technical Note—Simulating the GI / G /1 Queue in Heavy Traffic***by*Do Le Minh & Ronald M. Sorli

### August 1983, Volume 31, Issue 4

**603-631 Feature Article—Decision-Aiding Models: Validation, Assessment, and Related Issues for Policy Analysis***by*Saul I. Gass**632-651 Oil Stockpiles and Import Reductions: A Dynamic Programming Approach***by*Hung-Po Chao & Alan S. Manne**652-669 Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel***by*Richard C. Larson & Ghazala Sadiq**670-684 An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem***by*Jonathan F. Bard**685-696 Mean-Variance Approximations to Expected Logarithmic Utility***by*Lawrence B. Pulley**697-704 Optimum Replacement of a System Subject to Shocks***by*Philip J. Boland & Frank Proschan**705-719 On the M / G /1 Queue with Rest Periods and Certain Service-Independent Queueing Disciplines***by*Michel Scholl & Leonard Kleinrock**720-738 Surveillance Search for a Moving Target***by*Luke Tierney & Joseph B. Kadane**739-751 Search for a Moving Target: The FAB Algorithm***by*Alan R. Washburn**752-771 Annihilation Prediction for Lanchester-Type Models of Modern Warfare***by*James G. Taylor & Gerald G. Brown