Content
February 1972, Volume 20, Issue 1
- 143-153 Extensions of the Evans-Gould Stability Theorems for Mathematical Programs
by Harvey J. Greenberg & William P. Pierskalla - 154-164 An Algorithm for the Minimum-Risk Problem of Stochastic Programming
by Mihai Dragomirescu - 165-167 Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming
by E. Blum & W. Oettli - 167-173 Technical Note—Finite Algorithms for Solving Quasiconvex Quadratic Programs
by W. Charles Mylander - 173-178 Technical Note—A Branch-and-Bound Algorithm for Seeking the P -Median
by Pertti Järvinen & Jaakko Rajala & Heikki Sinervo - 178-182 Technical Note—Strengthened Dantzig Cuts for Integer Programming
by David S. Rubin & Robert L. Graves - 182-183 Technical Note—A Note on Zero-One Integer and Concave Programming
by V. Joseph Bowman & Fred Glover
December 1971, Volume 19, Issue 7
- 1553-1570 A Review of Quasi-Convex Functions
by Harvey J. Greenberg & William P. Pierskalla - 1571-1585 Classification Schemes for the Strong Duality of Linear Programming Over Cones
by K. O. Kortanek & W. O. Rom - 1586-1601 Bounding Distributions for a Stochastic Acyclic Network
by George B. Kleindorfer - 1602-1612 An Algorithm for Universal Maximal Dynamic Flows in a Network
by W. L. Wilkinson - 1613-1618 A Generalized Approach to the Method of Steepest Ascent
by H. Eldor & L. B. Koppel - 1619-1631 Decentralized Transshipment Networks
by Timothy W. Ruefli - 1632-1646 Parameterizing an Activity Vector in Linear Programming
by Chaiho Kim - 1647-1663 On an Allocation Problem with Multistage Constraints
by Lalitha Sanathanan - 1664-1674 Sequential Control of Homogeneous Activities—Linear Programming of Semi-Markovian Decisions
by Hirohide Hinomoto - 1675-1690 Nonlinear Assignment Problems Treated by Geometric Programming
by Ury Passy - 1691-1697 Group-Theoretic Results in Mixed Integer Programming
by Laurence A. Wolsey - 1698-1707 Scheduling Bioproduction Harvest
by Tung Liang & Wen-yuan Huang & Jaw-Kai Wang - 1708-1716 The Near-Myopic Nature of the Lagged-Proportional-Cost Inventory Problem with Lost Sales
by Thomas E. Morton - 1717-1729 Production-Planning Algorithms for the Inventory-Overtime Tradeoff
by Howard Kunreuther - 1730-1741 Two Casualty-Estimation Problems Associated with Area Targets and the Circular Coverage Function
by Campbell B. Read - 1742-1747 Technical Note—Parametric Solution of a Class of Nonconvex Programs
by R. R. Hocking & R. L. Shepard - 1747-1751 Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
by Robert S. Garfinkel - 1751-1753 Technical Note—System Simulation and Maximum Entropy
by Maynard M. W. Chan - 1753-1758 Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem
by Jatinder N. D. Gupta - 1759-1760 Technical Note—On a Formula Dual to Erlang's Loss Formula
by J. W. Cohen - 1760-1764 Technical Note—A Particular Two-Priority Queue
by Alan Washburn - 1764-1765 Technical Note—A Comment on a Paper by Goodwin and Giese
by George F. Brown & Timothy M. Corcoran - 1766-1766 Erratum
by Mandell Bellmore & John C. Malone
October 1971, Volume 19, Issue 6
- 1259-1281 The ABC's of OR
by Harvey M. Wagner - 1282-1299 A Motivational Profile of Management Scientists
by Herbert L. Lyon & John M. Ivancevich & James H. Donnelly - 1300-1322 Toward an Integrated Methodology for the Analysis of Health-Care Systems
by Richard D. Smallwood & Edward J. Sondik & Fred L. Offensend - 1323-1330 The Theorem of the Alternative in Social Choice Theory
by Peter C. Fishburn - 1331-1349 A Search Model for Evaluating Combinatorially Explosive Problems
by Keith L. McRoberts - 1350-1362 An Ordering Algorithm for Analysis of Data Arrays
by Stephen B. Deutsch & John J. Martin - 1363-1373 The Location of Emergency Service Facilities
by Constantine Toregas & Ralph Swain & Charles ReVelle & Lawrence Bergman - 1374-1392 Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions
by Ferydoon Kianfar - 1393-1405 Hypercylindrically Deduced Cuts in Zero-One Integer Programs
by R. D. Young - 1406-1418 An all Zero-One Algorithm for a Certain Class of Transportation Problems
by Adriano De Maio & Claudio Roveda - 1419-1433 The Solution of an Optimal Control Problem in Financial Modeling
by Blaine E. Davis & D. Jack Elzinga - 1434-1458 Stochastic Prices in a Single-Item Inventory Purchasing Model
by Basil A. Kalymon - 1459-1466 Solution Method for a Class of Stochastic Scheduling Problems for the Production of a Single Commodity
by Gifford H. Symonds - 1467-1476 A Multi-Item Inventory Model with Joint Backorder Criterion
by Bruce L. Miller - 1477-1493 An Algorithm to Solve Finite Separable Single-Constrained Optimization Problems
by Edward P. Loane - 1494-1501 The Distribution of the Occupation Time for Single-Server Queues
by Lajos Takács - 1502-1517 A Model of the ABM-vs.-RV Engagement with Imperfect RV Discrimination
by Salvador B. Layno - 1518-1522 Technical Note—A Counterexample to the Rudimentary Primal Integer Programming Algorithm
by S. J. Mathis - 1523-1529 Technical Note—Complementary Programming
by Toshihide Ibaraki - 1529-1538 Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
by Paul Gray - 1538-1541 Technical Note—A Note on Gomory Fractional Cuts
by Harvey M. Salkin - 1542-1542 Errata
by J. S. Rustagi & T. W. Doub - 1543-1543 Errata
by C. P. Saksena & A. J. Cole
August 1971, Volume 19, Issue 4
- 845-861 Common-Stock Transaction Sequences and the Random-Walk Model
by Donald M. Simmons - 862-874 Accommodating Student Demand for Courses by Varying the Classroom-Size Mix
by R. Longworth Smith - 875-893 Utility Independence and Preferences for Multiattributed Consequences
by Ralph L. Keeney - 894-904 Optimal Whereabouts Search
by Joseph B. Kadane - 905-915 Capacity of a Network with Increasing Demands and Arcs Subject to Failure
by P. J. Doulliez & M. R. Rao - 916-932 Optimum Network Partitioning
by Paul A. Jensen - 933-945 A Generalized Lagrange-Multiplier Method for Constrained Matrix Games
by Alan I. Penn - 946-969 An Efficient Algorithm for Multi-Item Scheduling
by L. S. Lasdon & R. C. Terjung - 970-976 A Sequential Stopping Rule for Fixed-Sample Acceptance Tests
by Gerald G. Brown & Herbert C. Rutemiller - 977-982 Technical Note—The Allocation of Power that Minimizes Tension
by Henri Theil - 983-985 Technical Note—On Hu's Decomposition Algorithm for Shortest Paths in a Network
by Jin Y. Yen - 986-988 Technical Note—Comments on a Paper by S. G. Allen and D. A. D'Esopo: “An Ordering Policy for Repairable Stock Items”
by Richard M. Simon & D. A. D'Esopo - 989-990 Letter to the Editor—Implementation of New Ideas in Bureaucracies
by S. J. Deitchman - 991-991 Letter to the Editor—Application of Kuhn's Hungarian Assignment Algorithm to Posting Servicemen
by T. A. Ewashko & R. C. Dudding - 992-997 Letter to the Editor—The Language of Lot Size
by Walter R. Crowe - 998-1022 Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
by C. E. Lemke & H. M. Salkin & K. Spielberg - 1023-1025 A Note on Extreme-Point Solutions and A Paper by Lemke, Salkin, and Spielberg
by Fred Glover - 1026-1035 Nonlinear Pricing: Applications to Concave Programming
by F. J. Gould - 1036-1044 A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming Problems
by Ronald E. Davis & David A. Kendrick & Martin Weitzman - 1045-1050 Classical Derivation of the Necessary and Sufficient Conditions for Optimal Linear Programs
by Hamdy A. Taha & Guy L. Curry - 1051-1060 A Modified Linear Program for Columnar Methods in Mathematical Programming
by G. L. Nemhauser & W. B. Widhelm - 1061-1069 Comments on Integer Hulls of Two Linear Constraints
by R. G. Jeroslow - 1070-1075 Technical Note—An Improved Branch-and-Bound Method for Integer Programming
by J. A. Tomlin - 1075-1078 Technical Note—On Converse Duality in Nonlinear Programming
by B. D. Craven & B. Mond - 1079-1080 Technical Note—A Note on Extended GLM
by J. P. Evans & F. J. Gould & S. M. Howe - 1081-1089 Technical Note—Undiscounted Markov Renewal Programming Via Modified Successive Approximations
by Thomas E. Morton - 1090-1096 Technical Note—Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks
by C. R. Baugh & T. Ibaraki & S. Muroga - 1097-1100 Technical Note—A Unified Nonlinear Duality Formulation
by M. S. Bazaraa & J. J. Goode & C. M. Shetty - 1101-1110 Technical Note—Cyclic Dynamic Programming: A Procedure for Problems with Fixed Delay
by David G. Luenberger
June 1971, Volume 19, Issue 3
- 559-586 Search Detection and Subsequent Action: Some Problems on the Interfaces
by Stephen M. Pollock - 587-604 A Method for Evaluating the Combat Effectiveness of a Tactical Information System in a Field Army
by Roland V. Tiede & Lewis A. Leake - 605-617 Optimal Allocation of Missiles Against Area and Point Defenses
by Frederic A. Miercort & Richard M. Soland - 618-635 An Evaluator for the Number of Operationally Ready Aircraft in a Multilevel Supply System
by Craig C. Sherbrooke - 636-644 A Computational Procedure for a Class of Coverage Problems for Multiple Shots
by Harold J. Breaux & Lynn S. Mohler - 645-654 Approximation Procedures and Some Key Results for Estimating Expected Target Damage
by Frank E. Grubbs & Harold J. Breaux & Helen J. Coon - 655-667 Expected Target Damage for Pattern Firing
by Charles N. Bressel - 668-684 On the Computation of Hit Probability
by Hermann Josef Helgert - 685-697 Optimal Sequential Aim Corrections for Attacking a Stationary Point Target
by Jack Nadler & Joan Eilbott - 698-706 Attrition Rates for Weapons with Markov-Dependent Fire
by Stephen R. Kimbleton - 707-709 Technical Note—Threshold Probabilities when Searching for a Moving Target
by Paul J. Schweitzer - 709-712 Technical Note—A Note on the Solution to Lanchester-Type Equations with Variable Coefficients
by James G. Taylor - 713-721 Letter to the Editor—Military Intelligence Analysis in Lilliput
by Robert L. Bovey - 722-734 Queuing Problems with Heterogeneous Arrivals and Service
by U. Yechiali & P. Naor - 735-760 On One-For-One-Ordering Inventory Policies with State-Dependent Leadtimes
by Donald Gross & Carl M. Harris - 761-773 Stationary Properties of a Two-Echelon Inventory Model for Low Demand Items
by R. M. Simon - 774-783 Stability in Noncooperative Games
by J. B. Williams - 784-793 Multiple Policy Improvements in Undiscounted Markov Renewal Programming
by Paul J. Schweitzer - 794-821 Cost Minimization in Networks with Discrete Stochastic Requirements
by Michael M. Connors & Willard I. Zangwill - 822-831 Optimal Advertising-Expenditure Implications of a Simultaneous-Equation Regression Analysis
by Leonard J. Parsons & Frank M. Bass
April 1971, Volume 19, Issue 2
- 257-269 Robbery and Assault of Bus Drivers
by Paul Gray - 270-277 A Class of Sequential Games
by David A. Kohler & R. Chandrasekaran - 278-307 Pathology of Traveling-Salesman Subtour-Elimination Algorithms
by Mandell Bellmore & John C. Malone - 308-322 Chebyshev Optimal Waste Discharges
by Matthew J. Sobel - 323-348 Divisible and Movable Activities in Critical-Path Analysis
by William S. Jewell - 349-370 On Optimal Balking Rules and Toll Charges in the GI / M /1 Queuing Process
by Uri Yechiali - 371-385 An Analysis of the M / G /1 Queue Under Round-Robin Scheduling
by M. Sakata & S. Noguchi & J. Oizumi - 386-401 Two Queues with Changeover Times
by Martin Eisenberg - 402-413 Some Inequalities for Parallel-Server Queues
by Shelby L. Brumelle - 414-423 An Exact Comparison of the Waiting Times Under Three Priority Rules
by S. Sreekantan Nair & Marcel F. Neuts - 424-435 On a Single-Server Finite Queuing Model with State-Dependent Arrival and Service Processes
by P. J. Courtois & J. Georges - 436-446 A Stochastic System with Scheduled Secondary Inputs
by İzzet Şahin & U. Narayan Bhat - 447-452 On the Growth of the Maximum Queue Length in a Stable Queue
by C. C. Heyde - 453-460 Priority Queues with Random Order of Service
by L. Durr - 461-468 Bounds for a Dynamic-Priority Queue
by J. M. Holtzman - 469-483 Some Multi-Contract Decision-Theoretic Competitive Bidding Models
by Robert M. Stark & Robert H. Mayer - 484-490 Competitive Bidding: A Comprehensive Bibliography
by Robert M. Stark - 491-509 Design Commonality to Reduce Multi-Item Inventory: Optimal Depth of a Product Line
by David P. Rutenberg - 510-523 On a Two-Unit Standby Redundant System with Standby Failure
by Shunji Osaki & Toshio Nakagawa - 524-540 Computing the Expected End-Product Service Time Using Stochastic Item Delays
by Marshall Rose - 541-544 Technical Note—Operations Research on Football
by Virgil Carter & Robert E. Machol - 544-548 Technical Note—Optimization of the Capacity in a Storage System
by S. G. Loo & A. Ghosal - 548-550 Technical Note—An Integer Maximization Problem
by Richard E. Schwartz & Clive L. Dym - 550-550 Errata
by L. G. Mitten
February 1971, Volume 19, Issue 1
- 1-18 The Bounding Hyperplane Method of Linear Programming
by C. P. Saksena & A. J. Cole - 19-39 Intersection Cuts—A New Type of Cutting Planes for Integer Programming
by Egon Balas - 40-44 An Intersection Cut from the Dual of the Unit Hypercube
by Egon Balas & V. Joseph Bowman & Fred Glover & David Sommer - 45-56 Dynamic Linear Programs for Production Scheduling
by C. Roger Glassey - 57-67 A Class of Fractional Programming Problems
by Y. Almogy & O. Levin - 68-76 Generalized Lagrange Multipliers in Integer Programming
by Jeremy F. Shapiro - 77-86 Optimality Criteria in Nonlinear Programming Without Differentiability
by M. S. Bazaraa & J. J. Goode & C. M. Shetty - 87-97 Quadratic Programming with a Quasiconvex Objective Function
by Béla Martos - 98-104 Vector-Valued Criteria in Geometric Programming
by Luis D. Pascual & Adi Ben-Israel - 105-114 On the Objective Function for the Sequential P-Model of Chance-Constrained Programming
by Robert S. Kaplan & John V. Soden - 115-119 Technical Note—A Flexible Tree-Search Method for Integer Programming Problems
by Nghiem Ph. Tuan - 120-124 Technical Note—“Linear” Programming with Absolute-Value Functionals
by David F. Shanno & Roman L. Weil - 124-130 Technical Note—The Optimal Location of New Facilities Using Rectangular Distances
by G. O. Wesolowsky & R. F. Love - 130-134 Technical Note—An Integer Approach to Modular Design
by Tim Shaftel - 135-155 A Computer-Based System for Forming Efficient Election Districts
by E. S. Savas - 156-169 The One-Terminal TELPAK Problem
by B. Rothfarb & M. Goldstein - 170-181 A Single-Shot Noisy Duel with Detection Uncertainty
by Calvin W. Sweat - 182-193 A Model for Allocating Interceptors from Overlapping Batteries: A Method of Dynamic Programming
by G. E. Swinson & P. H. Randolph & B. J. Dunn & M. E. Walker & R. D. Williams - 194-207 An Optimal Rejection Time for an M / G /1 Queuing System
by Hisashi Mine & Katsuhisa Ohno - 208-218 Characterization and Computation of Optimal Policies for Operating an M / G /1 Queuing System with Removable Server
by Colin E. Bell - 219-223 The Remaining Busy Period of a Finite Queue
by Terrell J. Harris - 224-234 Technical Note—A Taxonomy for Operations Research
by Russell W. Fenske - 234-237 Technical Note—An Algorithm to Find Elementary Negative-Cost Circuits with a Given Number of Arcs—The Traveling-Salesman Problem
by J. P. Netter - 237-240 Technical Note—Minimizing a Function of Permutations of n Integers
by John G. Rau - 240-244 Technical Note—Bounds on the Gain of a Markov Decision Process
by N. A. J. Hastings - 244-248 Technical Note—On the Asymptotic Convergence Rate of Cost Differences for Markovian Decision Processes
by Thomas E. Morton - 249-249 Technical Note—A Further Note on One-Dimensional Space Allocation
by Donald M. Simmons - 255-255 The 1970 Lanchester Prize---Call for Nominations
by Joseph H. Engel
December 1970, Volume 18, Issue 6
- 967-991 Implementation in Operations Research and R&D in Government and Business Organization
by Michael Radnor & Albert H. Rubenstein & David A. Tansik - 992-1020 Optimal Design of Offshore Natural-Gas Pipeline Systems
by B. Rothfarb & H. Frank & D. M. Rosenbaum & K. Steiglitz & D. J. Kleitman - 1021-1066 A Health-Status Index and its Application to Health-Services Outcomes
by S. Fanshel & J. W. Bush - 1067-1070 Measures of Health-System Effectiveness
by Arnold H. Packer & Gordon D. Shellard - 1071-1086 A Model of Health-Service Utilization and Resource Allocation
by Rita Zemach - 1087-1098 An Evaluation of Blood-Inventory Policies: A Markov Chain Application
by C. Carl Pegels & Andrew E. Jelmert - 1099-1111 The Role of Operations Research in Population Planning
by William A. Reinke - 1112-1124 Social and Rehabilitation Services: A Challenge to Operations Research
by Arthur Spindler - 1125-1137 Work Measurement and the Radiologist
by Albert B. Drui - 1138-1162 The Traveling-Salesman Problem and Minimum Spanning Trees
by Michael Held & Richard M. Karp - 1163-1167 A Theorem on Symmetric Traveling Salesman Problems
by Helmut Steckhan - 1168-1181 A Matrix Approach to Nonstationary Chains
by Frank Harary & Benjamin Lipstein & George P. H. Styan - 1182-1192 Simplified Analysis of an Alternating-Priority Queuing Model with Setup Times
by Jack S. Sykes - 1193-1206 Some Theorems on a Single-Server Queue with Balking
by Ronald Stewart Dick - 1207-1213 Letter to the Editor—A Guide to the Application of Limit Theorems for Sequences of Stochastic Processes
by Ward Whitt - 1213-1216 Letter to the Editor—A Note on a Distribution Problem
by A. Charnes & Fred Glover & D. Klingman - 1216-1220 Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
by Donald M. Topkis - 1220-1224 Letter to the Editor—Selecting Price Quotations for an Industrial Firm's Sale of Individual Contract Projects
by Purnell H. Benson - 1225-1228 Letter to the Editor—A Monte Carlo Method for the Approximate Solution of Certain Types of Constrained Optimization Problems
by Martin Pincus - 1228-1233 Letter to the Editor—A Comment on the Morse-Elston Model of Probabilistic Obsolescence
by Donald H. Kraft
October 1970, Volume 18, Issue 5
- 761-771 A Black Ghetto's Research on a University
by Russell L. Ackoff - 772-784 Measuring the Effectiveness of Nondefense Public Programs
by Harry P. Hatry - 785-804 Cost-Effectiveness Analysis of Civil Engineering Systems: New York City's Primary Water Supply
by Richard de Neufville - 805-854 Sprinter Mod III: A Model for the Analysis of New Frequently Purchased Consumer Products
by Glen L. Urban - 855-882 A Study of the Logical Basis of Combat Simulation
by Bernard O. Koopman - 883-903 A Simple Model of Search for a Moving Target
by Stephen M. Pollock - 904-917 A Statistical Analysis of Aircraft Maintenance Costs
by Herman L. Gilster - 918-923 Moment Estimation in a Markov-Dependent Firing Distribution
by J. S. Rustagi & Richard Laitinen - 924-939 Surrogate Mathematical Programming
by Harvey J. Greenberg & William P. Pierskalla - 940-946 On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint
by David S. Rubin - 947-954 The Value of Information and Stochastic Programming
by M. Avriel & A. C. Williams
August 1970, Volume 18, Issue 4
- 569-576 How Can We Improve Operations Research?
by Thomas E. Caywood - 577-591 Science, Government, and Citizen Feedback
by Chandler Harrison Stevens - 592-592 Space Applications—Foreword
by Thomas O. Paine - 593-611 A Methodology to Compare Policies for Exploring the Solar System
by Robert G. Chamberlain & Louis Kingsland - 612-634 A Program of Astronomy Research on the Moon and its Logistics Implications
by Raoul J. Freeman & Roger C. Moore & Gerhard F. Schilling - 635-653 Linear-Programming Solutions for Orbital-Transfer Trajectories
by Charles M. Waespy - 654-664 Queuing Analysis of Satellite Networks
by M. T. El-Bardai - 665-688 A Statistical Method for Setting Stops in Stock Trading
by Robert M. Barnes - 689-707 A Method of Solution for General Machine-Scheduling Problems
by John M. Charlton & Carl C. Death - 708-732 On the Optimality of Single-Server Queuing Systems
by Shaler Stidham - 733-738 A Continuation of Delay-Dependent Queue Disciplines
by Jiunn Hsu
June 1970, Volume 18, Issue 3
- 375-403 Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
by Arthur M. Geoffrion - 404-413 Cutting-Plane Methods without Nested Constraint Sets
by Donald M. Topkis