## Content

### August 1966, Volume 14, Issue 4

**723-727 Letter to the Editor—Some Confidence Intervals for Queues***by*Hubert W. Lilliefors**728-731 Letter to the Editor—A Queuing System with Bulk Service***by*I. M. Stuart & G. B. McMahon**731-732 Letter to the Editor—Failure Probability Formulas for Systems with Spares***by*D. R. Wilken & E. S. Langford**733-733 In Memoriam—Dr. Glen Darwin Camp***by*W. W. Abendroth

### June 1966, Volume 14, Issue 3

**361-368 A Branch-Bound Algorithm for Plant Location***by*M. A. Efroymson & T. L. Ray**369-376 Labor Assignment as a Dynamic Control Problem***by*Rosser T. Nelson**377-387 On Two Commodity Network Flows***by*B. Rothschild & A. Whinston**388-397 Comparison of Two Scheduling Systems***by*A. Soriano**398-408 On the Problem of Batch Arrivals and its Application to a Scheduling System***by*A. Soriano**409-421 Optimum Locations on a Graph with Probabilistic Demands***by*H. Frank**422-441 A Comparison of Two Methods for Quadratic Programming***by*C. van de Panne & Andrew Whinston**442-443 Note on “A Comparison of Two Methods of Quadratic Programming”***by*E. M. L. Beale**444-459 Observing Stochastic Processes, and Approximate Transform Inversion***by*D. P. Gaver**460-465 An Interval Estimate of System Availability***by*Harold I. Jacobson**466-477 Some Queuing Problems with Phase-Type Service***by*M. L. Chaudhry**478-485 Expected Production of a Single Repairman Machine-Maintenance System with Overnight Repairs***by*Ivan Elce & Hans Liebeck**486-507 A Deterministic Multiproduct, Multi-Facility Production and Inventory Model***by*Willard I. Zangwill**508-514 Dimensions in Operations Research***by*Eliezer Naddor**515-527 Cost/Effectiveness Analysis: Its Tasks and Their Interrelation***by*David S. Fields**528-531 Letter to the Editor—A Cost Effectiveness Comparison Involving a Tradeoff of Performance, Cost, and Obtainability***by*Karl Seiler**532-533 Letter to the Editor—The Traveling Salesman Problem: On the Reduction of Certain Large Problems to Smaller Ones***by*Michael Rothkopf**533-537 Letter to the Editor—Age Replacement with Discounting***by*Bennett Fox**537-538 Letter to the Editor—On Multistage Replacement Strategies***by*V. P. Marathe & K. P. K. Nair

### April 1966, Volume 14, Issue 2

**189-209 Exploration for Natural Resources***by*John C. Griffiths**210-232 The Optimal Assignment of Facilities to Locations by Branch and Bound***by*J. W. Gavett & Norman V. Plyter**233-241 Reliability Considerations for a Two Element Redundant System with Generalized Repair Times***by*Burt H. Liebowitz**242-266 Observations on the Theoretical Basis of Cost-Effectiveness***by*M. C. Heuston & G. Ogawa**267-278 A Class of Variational Problems in Search Theory and the Maximum Principle***by*E. J. Beltrami & R. McGill**279-291 A Decomposition Algorithm for the Shortest-Route Problem***by*G. Mills**292-312 Choosing a Good Appointment System—A Study of Queues of the Type ( D , M , 1)***by*Birger Jansson**313-316 An Alternative Proof of a Theorem of Takács on the GI / M /1 Queue***by*Marcel F. Neuts**317-328 Queuing Systems with Bounded Waiting-Line Length***by*D. F. Votaw & A. M. Stover**329-333 Letter to the Editor—Queuing with Balking—A Simple Method to Study the Transient Behavior***by*P. R. Satyamurty**334-340 Letter to the Editor—The Distribution of Stock Price Differences: Gaussian After All?***by*Josef Brada & Harry Ernst & John Van Tassel**341-341 Letter to the Editor—Comments on a Paper by M. L. Wolfson: “Selecting the Best Lengths to Stock”***by*Gerald D. Cohen**342-350 Letter to the Editor—Signal Flow Graphs and Analog Computation in the Analysis of Finite Queues***by*Ronald L. Gue

### February 1966, Volume 14, Issue 1

**1-15 A Mathematical Model of Supply Support for Space Operations***by*Raoul J. Freeman & David C. Gogerty & Glenn W. Graves & Robin B. S. Brooks**16-24 Two-Link Material Handling Systems***by*John T. Morgan**25-44 Mean Value Estimation from Digital Computer Simulation***by*A. V. Gafarian & C. J. Ancker**45-51 Minimum-Cost Multicommodity Network Flows***by*J. A. Tomlin**52-58 Scheduling to Minimize Interaction Cost***by*R. C. Carlson & G. L. Nemhauser**59-70 A Second Look at Hanssmann's Inventory Control Model with Special Reference to the Central Store/Sub Store Problem***by*W. Lampkin**71-78 Redundancy in Decision-Making Systems***by*John G. Rau**79-83 Interpolation of the Renewal Function***by*Sylvain Ehrenfeld**84-99 Establishing Objectives, Measures, and Criteria for Multiphase Complementary Activities***by*Sidney I. Firstman & David S. Stoller**100-132 A Queuing Model for Unitized Cargo Generation***by*A. Novaes & E. Frankel**133-136 Waiting-Time Distribution of a Multi-Server, Priority Queuing System***by*Richard H. Davis**137-144 The Number Served in a Queue***by*Harold Greenberg & Irwin Greenberg**145-156 Administrative Control of Multiple-Channel Queuing Systems with Parallel Input Streams***by*John P. Young**157-163 A Gradient Inequality for a Class of Nondifferentiable Functions***by*Edmund Eisenberg**164-172 General Symmetric Dual Programs***by*S. L. Mehndiratta**173-174 Letter to the Editor—Super-Critical Arcs of a PERT Network***by*D. J. A. Welsh**174-177 Letter to the Editor—A Model for Transit Delays***by*B. D. Craven

### December 1965, Volume 13, Issue 6

**879-919 A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem***by*Fred Glover**920-929 Discounted Markov Programming in a Periodic Process***by*Jens Ove Riis**930-945 Chance Constrained Programming with Joint Constraints***by*Bruce L. Miller & Harvey M. Wagner**946-959 A Computer Code for Integer Solutions to Linear Programs***by*John Haldi & Leonard M. Isaacson**960-988 A Resource Allocation Problem***by*Socrates Litsios**989-997 Bayesian Determination of the Reorder Point of a Slow Moving Item***by*Edward A. Silver**998-1006 Nonpartisan Political Redistricting by Computer***by*S. W. Hess & J. B. Weaver & H. J. Siegfeldt & J. N. Whelan & P. A. Zitlau**1007-1019 Optimization of Maintenance Resources***by*Jeremy A. Lifsey**1020-1022 Queuing with Nonpreemptive and Preemptive-Resume Priorities***by*Wei Chang**1023-1027 Letter to the Editor—A Sample Survey of Industrial Operations-Research Activities II***by*Charles C. Schumacher & Barnard E. Smith**1027-1029 Letter to the Editor—Note on a Coverage Problem***by*D. G. Kabe**1029-1036 Letter to the Editor—Linear Fractional Functionals Programming***by*Kanti Swarup**1036-1044 Letter to the Editor—Timing of Check Out Before a Critical Event***by*A. J. Truelove**1045-1051 Letter to the Editor—Third International Symposium on the Theory of Traffic Flow***by*L. C. Edie & D. C. Gazis & W. Helly & R. Herman & R. Rothery

### October 1965, Volume 13, Issue 5

**689-711 The Simulation of Hospital Systems***by*R. B. Fetter & J. D. Thompson**712-733 Dynamic Inference***by*Ronald A. Howard**734-746 The Remaining Busy Period for a Single Server Queue with Poisson Input***by*Sven Erlander**747-760 Divisible Activities in Critical Path Analysis***by*William S. Jewell**761-778 Optimal Policy in a Dynamic, Single Product, Nonstationary Inventory Model with Several Demand Classes***by*Arthur F. Veinott**779-799 A Class of One-Period Inventory Models***by*Stan Fromovitz**800-814 Optimum Redundancy Under Multiple Constraints***by*Frank Proschan & T. A. Bray**815-819 The Busy Period of a Queue with Batch Service***by*M. F. Neuts**820-827 Preemptive Priority Queues***by*Wei Chang**828-835 Multistage Replacement Strategies with Finite Duration of Transfer***by*M. D. Naik & K. P. K. Nair**836-847 Modular Design, Generalized Inverses, and Convex Programming***by*A. Charnes & M. Kirby**848-856 Jacobians in Constrained Nonlinear Optimization***by*Douglass J. Wilde**857-859 Letter to the Editor—A Modification of Lanchester's Equations***by*Robert L. Helmbold**859-862 Letter to the Editor—An Experiment in Teaching Operations Research***by*Ulf Grenander

### August 1965, Volume 13, Issue 4

**517-546 An Additive Algorithm for Solving Linear Programs with Zero-One Variables***by*Egon Balas**546-549 A Note on the Additive Algorithm of Balas***by*Fred Glover & Stanley Zionts**550-569 Scoring and Profitability Models for Evaluating and Selecting Engineering Projects***by*Burton V. Dean & Meir J. Nishry**570-585 Selecting the Best Lengths to Stock***by*M. L. Wolfson**586-595 Time-Dependent Solution of a Priority Queue with Bulk Arrival***by*A. G. Hawkes**596-608 Queuing Models with Balking, Reneging, and Interruptions***by*S. Subba Rao**609-618 On Serial Files with Relocatable Records***by*John McCabe**619-631 Towards a Coordinated Approach to the Structuring of Cost and Design Models: A Case Example***by*L. S. Hill**632-646 Minimax Detection Station Placement***by*Richard D. Smallwood**647-673 Optimal Design of Optimization Experiments***by*Burton V. Dean & Eli S. Marks**674-677 Letter to the Editor—A Note on the “Fail-Safe” Properties of the “Generalized Lagrange Multiplier Method”***by*A. Charnes & W. W. Cooper**677-678 Letter to the Editor—Comments on Preceding Note***by*Hugh Everett**679-679 Letter to the Editor—The Burdens of Queuing Charges—Comments on a Letter by Leeman***by*Thomas L. Saaty**680-681 Letter to the Editor—Comments on Preceding Note***by*Wayne A. Leeman

### June 1965, Volume 13, Issue 3

**343-357 Problems of Statistical Inference for Birth and Death Queuing Models***by*Ronald W. Wolff**358-364 Single Facility Sequencing with Random Execution Times***by*B. P. Banerjee**365-374 On the Concept of FIFOV in Queues***by*B. Krishnamoorthi**375-381 A Queue with Simultaneous Arrivals and Erlang Service Distribution***by*Rodrigo A. Restrepo**382-385 The Estimation of the Mean and Variance of a “PERT” Activity Time***by*William A. Donaldson**386-387 Note on William A. Donaldson's “The Estimation of the Mean and Variance of a ‘PERT’ Activity Time”***by*Helen Coon**388-399 Some Network Flow Problems Solved with Pseudo-Boolean Programming***by*Peter L. Ivănescu**400-412 Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems***by*Edward Ignall & Linus Schrage**413-423 Reliability of Spare Part Support for a Complex System with Repair***by*James M. Goodwin & Erich W. Giese**424-432 The Optimal Inventory Policy for Batch Ordering***by*Arthur F. Veinott**433-443 A Relation Between Decision Making Penalty and Simulation Sample Size for Inventory Systems***by*Michael E. Brenner**444-452 Linear and Nonlinear Separation of Patterns by Linear Programming***by*O. L. Mangasarian**453-461 On the Parts Requirements Problem***by*Gerald L. Thompson**462-475 Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems***by*S. L. Hakimi**476-477 Letter to the Editor—A Theorem on a Ratio of Random Variables***by*Satya O. Dubey**478-482 Letter to the Editor—Kill Probability When the Lethal Effect is Variable***by*Frank McNolty**482-494 Letter to the Editor—On Optimal Extracting from a Multiple File Data Storage System: An Application of Integer Programming***by*Richard H. Day**494-495 Letter to the Editor—Note on Fishburn's “Independence in Utility Theory with Whole Product Sets”***by*F. S. Dyer**495-499 Letter to the Editor—A Reply to Dyer's Note on Fishburn's Article***by*Peter C. Fishburn**499-503 Letter to the Editor—Note on Computing Optimum Discrete Allocations***by*Henry A. Young**504-507 Letter to the Editor—Another Formulation of the Inventory Problem***by*William D. Sudderth

### April 1965, Volume 13, Issue 2

**169-178 Diversification of Operations Research***by*Alex M. Mood**179-190 Signals, Ambiguity, and Strategic Force Structure***by*Harvey Averch & Sorrel Wildhorn**191-201 A Theory of Cost-Effectiveness for Military Systems Analysis***by*Peter D. Fox**202-216 Some Discrete Processes in the Theory of Stochastic Duels***by*C. J. Ancker & Trevor Williams**217-237 Analysis of Decisions with Incomplete Knowledge of Probabilities***by*Peter C. Fishburn**238-257 Markovian Dependence in Utility Theory with Whole Product Sets***by*Peter C. Fishburn**258-265 Clustering of Stock Prices***by*Victor Niederhoffer**266-271 A Nonlinear Decomposition Principle***by*J. L. Sanders**272-278 Some Remarks on Finite Horizon Markovian Decision Models***by*Cyrus Derman & Morton Klein**279-290 Multistage Replacement Strategies***by*M. D. Naik & K. P. K. Nair**291-299 On Monte Carlo Methods in Congestion Problems: I. Searching for an Optimum in Discrete Situations***by*E. S. Page**300-305 On Monte Carlo Methods in Congestion Problems: II. Simulation of Queuing Systems***by*E. S. Page**306-318 Queuing with Alternating Priorities***by*B. Avi-Itzhak & W. L. Maxwell & L. W. Miller**319-322 Letter to the Editor—Some Characteristics of a Special Joint-Order Inventory Model***by*Edward A. Silver**323-325 Letter to the Editor—A Counterexample to a Proposed Algorithm for Optimal Sequencing of Jobs***by*William Karush**326-327 Letter to the Editor—On the Estimation of Errors Introduced by Standard Assumptions Concerning the Distribution of Activity Duration in PERT Calculations***by*Józef Łukaszewicz**328-338 The Analyst's Bookshelf***by*Hugh J. Miser

### February 1965, Volume 13, Issue 1

**1-17 The Stochastic Properties of Large Battle Models***by*Franklin C. Brooks**18-27 Some Problems Involving Circular and Spherical Targets***by*George Marsaglia**28-45 Independence in Utility Theory with Whole Product Sets***by*Peter C. Fishburn**46-66 Distribution of the Time Through a Directed, Acyclic Network***by*J. J. Martin**67-81 A Stochastic Personnel-Assignment Model***by*William R. King**82-93 Solution of Large-Scale Transportation Problems Through Aggregation***by*Egon Balas**94-120 Multistage Cutting Stock Problems of Two and More Dimensions***by*P. C. Gilmore & R. E. Gomory**121-131 Reduction Methods for Tandem Queuing Systems***by*Henry D. Friedman**132-139 Planning Transistor Production by Linear Programming***by*Spencer B. Smith**140-141 Letter to the Editor—The Lanchester Prize***by*Georges Brigham**141-143 Letter to the Editor—Errors Introduced by a PERT Assumption***by*D. J. A. Welsh**143-146 Letter to the Editor—Comments on Feasibility Conditions of Simultaneous Flows in a Network***by*D. T. Tang**146-157 Letter to the Editor—Solution of a Combinatorial Problem by Dynamic Programming***by*S. M. Roberts & Benito Flores**157-158 Letter to the Editor—Policy Statement for “PORS”***by*Robert E. Machol & David B. Hertz

### December 1964, Volume 12, Issue 6

**809-814 Discrete Time Queues at a Periodic Traffic Light***by*D. C. Kleinecke**815-831 Optimum Control of a System of Oversaturated Intersections***by*Denos C. Gazis**832-857 The Highway Merging and Queuing Problem***by*David H. Evans & Robert Herman & George H. Weiss**858-869 Forced Merging in Traffic***by*W. S. Jewell**870-881 Algorithm for Traffic Control***by*Michael C. Dunne & Renfrey B. Potts**882-895 Queues for a Vehicle-Actuated Traffic Light***by*J. N. Darroch & G. F. Newell & R. W. J. Morris**896-912 Synchronizing Traffic Signals for Maximal Bandwidth***by*John T. Morgan & John D. C. Little**913-933 Analysis of Experiments on Single-Lane Bus Flow***by*R. Rothery & R. Silver & R. Herman & C. Torner**934-940 Removing Arcs from a Network***by*Richard Wollmer**941-950 Priority Rules for Runway Use***by*Gerold Pestalozzi**951-963 Two Stochastic Traffic Systems Whose Service Times Increase with Occupancy***by*Walter Helly**964-975 Some Probability Distributions Associated with Commuter Travel in a Homogeneous Circular City***by*Frank A. Haight**976-1039 Annotated Bibliography of Scientific Research in Road Traffic and Safety***by*Frank A. Haight

### October 1964, Volume 12, Issue 5

**655-679 Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem***by*P. C. Gilmore & R. E. Gomory**680-688 Sensitivity Analysis of Multiterminal Flow Networks***by*Salah E. Elmaghraby**689-692 Optimum Test Procedure Under Stress***by*Harold Greenberg**693-706 Planning by Resource Allocation Methods—Illustrated by Military Applications***by*James L. Taylor & John E. Walsh**707-724 A Queuing Approach to Logistics Systems***by*Noel M. Mirasol**725-735 Time Dependent Solutions to the ( s , S ) Inventory Problem***by*Harold Greenberg**736-752 On a Generalized M / G /1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service***by*Peter D. Welch**753-767 Occupation Time Problems in the Theory of Queues***by*Lajos Takács**768-773 Letter to the Editor—An Ill-Conceived Proposal for Apportionment of the U.S. House of Representatives***by*E. J. Gilbert & J. A. Schatz**773-777 Letter to the Editor—The Incorporation of Step Functions and Ramp Functions into a Linear Programming Model***by*B. Alva Schoomer**778-781 Letter to the Editor—Some Observations on the Use of Lanchester's Theory for Prediction***by*Robert L. Helmbold**781-783 Letter to the Editor—Simultaneous Parametric Programs***by*Richard J. Swersey**783-785 Letter to the Editor—The Reduction of Queues Through the Use of Price***by*Wayne A. Leeman**785-785 Errata***by*T. C. Hu

### August 1964, Volume 12, Issue 4

**519-526 An Application of Symbolic Logic to a Selection Problem***by*James G. Root**527-533 On Single-Server Bulk-Queuing Processes with Binomial Input***by*U. Narayan Bhat**534-542 A Probability Problem Arising in Reliability and Traffic Studies***by*D. P. Gaver**543-567 Lagrange Multipliers and the Optimal Allocation of Defense Resources***by*George E. Pugh**568-581 Scheduling of Vehicles from a Central Depot to a Number of Delivery Points***by*G. Clarke & J. W. Wright**582-585 Random Walks, Fire Damage Amount and Other Paretian Risk Phenomena***by*Benoit Mandelbrot**586-609 A Model for the Control of Arms***by*Thomas L. Saaty**610-619 Composition Principles for Synthesis of Optimal Multistage Processes***by*L. G. Mitten**620-623 Letter to the Editor—Application of the “Excess Distribution” to an Inventory Study***by*Murray A. Geisler**623-629 Letter to the Editor—A Search Problem***by*Scott H. Cameron & S. G. Narayanamurthy**629-632 Letter to the Editor—A Modification of Fulkerson's PERT Algorithm***by*C. T. Clingen**632-633 Letter to the Editor—Algorithms and Analog Computers for the Most Reliable Route Through a Network***by*Galen R. Shorack**634-636 Letter to the Editor—Comments on the Paper “A Mathematical Model for Strategic Movement” by S. D. Stearns***by*W. I. Zangwill

### June 1964, Volume 12, Issue 3

**379-394 Surveillance of a Region by Detection and Tracking Operations***by*James M. Dobbie**395-418 Some Properties of Schedules for Large Projects with Limited Resources***by*Jerome D. Wiest**419-427 Compact Book Storage in Libraries***by*Ferdinand F. Leimkuhler & J. Grady Cox**428-432 A “String Algorithm” for Shortest Path in Directed Networks***by*Victor Klee**433-440 The Optimal Order to Serve in Certain Servicing Problems***by*Ove Frank**441-449 Batched Queuing Processes***by*F. G. Foster**450-459 Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph***by*S. L. Hakimi**460-470 Critical Path Analyses Via Chance Constrained and Stochastic Programming***by*A. Charnes & W. W. Cooper & G. L. Thompson**471-497 Development of M -Stage Decision Rule for Scheduling N Jobs Through M Machines***by*Richard A. Dudek & Ottis Foy Teuton**498-499 Letter to the Editor—The Steady State Probabilities of a Markov Chain as a Function of the Transition Probabilities***by*Arnold Singer**499-502 Letter to the Editor—An Algorithm for the Sequential Solution of Schedule Networks***by*Charles R. Goldberg**503-504 Letter to the Editor—The Distribution of Busy Time for a Simple Queue***by*Irwin Greenberg**504-506 Letter to the Editor—On the Ruin Problem for the Generalized Random Walk***by*J. Keilson