Printed from https://ideas.repec.org/s/inm/oropre26.html
Content
August 1973, Volume 21, Issue 4
- 952-965 An Improved Stochastic Model for Occupancy-Related Random Variables in General-Acute Hospitals
by William Shonick & James R. Jackson - 966-973 Serial Correlation in a Simple Dam Processs
by Nils Blomqvist - 974-987 State Probabilities of M / M /1 Priority Queues
by Barry I. Marks - 988-997 Variance Reduction by Antithetic Variates in GI / G /1 Queuing Simulations
by Bill Mitchell - 998-1013 Optimal Control of the Vidale-Wolfe Advertising Model
by Suresh P. Sethi
June 1973, Volume 21, Issue 3
- 661-671 Science in the Systems Age: Beyond IE, OR, and MS
by Russell L. Ackoff - 672-676 On the Optimal Size for Exploited Natural Animal Populations
by Stuart H. Mann - 677-692 An Optimization Model for Corporate Financial Planning
by William F. Hamilton & Michael A. Moses - 693-711 A Three-Stage Manpower Planning and Scheduling Model—A Service-Sector Example
by William J. Abernathy & Nicholas Baloff & John C. Hershey & Sten Wandel - 712-727 An Artificial-Variable Elimination Method for Solving Block-Diagonal Programming Problems
by Thomas W. Knowles - 728-740 Markovian Decision Processes with Uncertain Transition Probabilities
by Jay K. Satia & Roy E. Lave - 741-747 Optimal Stopping in a Discrete Search Problem
by Milton C. Chew - 748-754 Probabilistic Analysis of a Two-Unit System with a Warm Standby and a Single Repair Facility
by S. K. Srinivasan & M. N. Gopalan - 755-763 Bayesian Estimation of Life Parameters in the Weibull Distribution
by George C. Canavos & Chris P. Taokas - 764-776 Priority Queuing Systems with and without Feedback
by Thomas K. Wignall - 777-786 Efficient Operation of Optional-Priority Queuing Systems
by Colin E. Bell - 787-795 Loss Systems with Mixed Renewal and Poisson Inputs
by A. Kuczura - 796-809 Operations Research Education: Some Requirements and Deficiencies
by Seth Bonder - 810-822 A Comparison of Two Personnel Prediction Models
by Kneale T. Marshall - 823-834 Variable-Work Models for Predicting Course Enrollments
by K. R. Balachandran & Donald Gerwin - 835-845 A Procedure for Selecting Educational Goal Areas for Emphasis
by James S. Dyer - 846-847 Technical Note—Minimizing Average Flow Time with Parallel Machines
by W. A. Horn - 848-851 Technical Note—Elimination of Suboptimal Actions in Markov Decision Problems
by Richard C. Grinold - 852-854 Letter to the Editor—Validating Claims for Algorithms Proposed for Publication
by James P. Ignizio - 855-858 Letter to the Editor—Comments on a Blood-Bank Inventory Model of Pegels and Jelmert
by John B. Jennings & Peter Kolesar - 858-861 Letter to the Editor—Comments on a Letter by Woolsey
by Stafford Beer & A. Charnes & W. W. Cooper & B. Mellon & R. E. D. Woolsey - 862-862 Letter to the Editor—An Example of Ignall and Schrage
by Sumer C. Aggarwal
April 1973, Volume 21, Issue 2
- 401-412 An Applicable Model of Optimal Marketing Policy
by Meir G. Kohn & Yakir Plessner - 413-426 Computed School Assignments in a Large District
by Allen D. Franklin & Ernest Koenigsberg - 427-450 The Progress of Management-Science Activities in Large US Industrial Corporations
by Michael Radnor & Rodney D. Neal - 451-474 The Relation between Formal Procedures for Pursuing OR/MS Activities and OR/MS Group Success
by Rodney D. Neal & Michael Radnor - 475-497 An Empirical Investigation of Optimum-Seeking in the Computer Simulation Situation
by Dennis E. Smith - 498-516 An Effective Heuristic Algorithm for the Traveling-Salesman Problem
by S. Lin & B. W. Kernighan - 517-527 Maximal, Lexicographic, and Dynamic Network Flows
by Edward Minieka - 528-541 Calculating Maximal Flows in a Network with Positive Gains
by Richard C. Grinold - 542-553 Sequencing Expansion Projects
by Donald Erlenkotter - 554-568 Response-Variance Tradeoffs in Adaptive Forecasting
by John O. McClain & L. Joseph Thomas - 569-576 Processor Utilization in Multiprogramming Systems via Diffusion Approximations
by Donald P. Gaver & Gerald S. Shedler - 577-589 The Rearrangement of Items in a Warehouse
by Nicos Christofides & I. Colloff - 590-596 Optimal Defensive Missile Allocation: A Discrete Min-Max Problem
by Richard M. Soland - 597-603 On Two-Server Poisson Queues with Two Types of Customers
by T. C. T. Kotiah & N. B. Slater - 604-609 A Queuing-Type Birth-and-Death Process Defined on a Continuous-Time Markov Chain
by Uri Yechiali - 610-616 Single-Server Queues with Service Time Dependent on Waiting Time
by M. Posner - 617-622 On the Ergodic Theory of Markov Chains
by Paul G. Marlin - 623-628 A k -Server Queue with Phase Input and Service Distribution
by Asha Seth Kapadia - 629-635 Distribution-Free Analysis of M / G /1 and G / M /1 Queues
by Irwin Greenberg - 636-638 Technical Note—Distribution of the Mean Queue Size for the Time-Dependent Queue
by H. Ali - 639-643 Technical Note—How to Win by Losing
by David Silverman & Benjamin L. Schwartz - 644-647 Technical Note—Economic Packaging Frequency for Items Jointly Replenished
by S. K. Goyal - 648-650 Technical Note—Comment on an Integer Maximization Problem
by Iram J. Weinstein & Oliver S. Yu - 650-652 Technical Note—A Note on Lipstein's Model of Consumer Behavior
by Warren Dent - 653-653 Errata
by Joel D. Barkan & James E. Bruno
February 1973, Volume 21, Issue 1
- 1-9 On Symmetric Duality in Nonlinear Programming
by M. S. Bazaraa & J. J. Goode - 10-21 On Multi-Commodity Maximal Dynamic Flows
by Mandell Bellmore & Ramakrishna R. Vemuganti - 22-29 Linear Programming with a Fractional Objective Function
by G. R. Bitran & A. G. Novaes - 30-36 A Convex Programming Model for Optimizing SLBM Attack of Bomber Bases
by Jerome Bracken & James T. McGill - 37-44 Mathematical Programs with Optimization Problems in the Constraints
by Jerome Bracken & James T. McGill - 45-60 An Algorithm for Integer Linear Programming: A Combined Algebraic and Enumeration Approach
by Gordon H. Bradley & Pran N. Wahi - 61-89 Enumerative Cuts: I
by Claude-Alain Burdet - 90-100 Heuristic Selection of Advanced Bases for a Class of Linear Programming Models
by Martin Dillon - 101-111 A Minimax Facility-Configuration Problem Involving Lattice Points
by Richard L. Francis - 112-122 Computation in Discrete Stochastic Programs with Recourse
by Stanley J. Garstka & David P. Rutenberg - 123-134 Convexity Cuts and Cut Search
by Fred Glover - 135-140 Concave Programming Applied to a Special Class of 0-1 Integer Programs
by Fred Glover & D. Klingman - 141-155 The Generalized Lattice-Point Problem
by Fred Glover & D. Klingman - 156-161 Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
by Fred Glover & Eugene Woolsey - 162-178 The Generalized Penalty-Function/Surrogate Model
by Harvey J. Greenberg - 179-187 Computing Optimal Solutions for Infinite-Horizon Mathematical Programs with a Transient Stage
by Richard C. Grinold & David S. P. Hopkins - 188-209 Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
by William Hogan - 210-220 A Generalized Approach to Dantzig-Wolfe Decomposition for Concave Programs
by Charles A. Holloway - 221-224 There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
by R. C. Jeroslow - 225-239 An Algorithm for Globally-Optimal Nonlinear-Cost Multidimensional Flows in Networks and Some Special Applications
by Andrew Korsak - 240-246 Solution Sets of Convex Programs Related to Chemical Equilibrium Problems
by K. O. Kortanek & W. O. Rom & A. L. Soyster - 247-260 An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
by T. H. Mattheiss - 261-269 A Graph-Theoretic Equivalence for Integer Programs
by Jean-Claude Picard & H. Donald Ratliff - 270-283 Optimal Design of Multiactivity Multifacility Systems by Branch and Bound
by Charles E. Pinkus & Donald Gross & Richard M. Soland - 284-295 An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems
by V. Srinivasan & G. L. Thompson - 296-304 An Example of the Application of Nonlinear Programming to Chemical-Process Optimization
by M. Sriram & William F. Stevens - 305-313 Some Properties of Generalized Concave Functions
by W. A. Thompson & Darrel W. Parke - 314-320 Location Theory, Dominance, and Convexity
by Richard E. Wendell & Arthur P. Hurter - 321-322 Technical Note—A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case
by Egon Balas - 323-326 Technical Note—Equivalent Mixed Integer Programming Problems
by Gordon H. Bradley - 326-328 Technical Note—An Application of Witzgall’s Algorithm to a Problem in Radar Signal Design
by C. W. Chapoton - 328-332 Technical Note—Theorems of Convergence for Improved Nonlinear Programming Algorithms
by Jacques Dubois - 332-337 Technical Note—Solution of the Value-Independent Knapsack Problem by Partitioning
by Bruce Faaland - 337-340 Technical Note—Conditions for Global Optimality in Nonlinear Programming
by James E. Falk - 340-343 Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem
by Robert S. Garfinkel - 343-345 Technical Note—Rationalizing Discrete Programs
by F. J. Gould & D. S. Rubin - 346-348 Technical Note—Bounding Nonconvex Programs by Conjugates
by Harvey J. Greenberg - 348-351 Technical Note—The Set-Covering Problem with Equality Constraints
by D. K. Guha - 351-352 Technical Note—The Continuity of the Perturbation Function of a Convex Program
by William W. Hogan - 353-359 Technical Note—The Use of Cuts in Complementary Programming
by Toshihide Ibaraki - 360-364 Technical Note—A Class of Nonlinear Chance-Constrained Programming Models with Joint Constraints
by R. Jagannathan & M. R. Rao - 365-369 Technical Note—Maximal Funnel-Node Flow in an Undirected Network
by John J. Jarvis & Duane D. Miller - 369-370 Technical Note—On a Duality Theorem for a Nonlinear Programming Problem
by Bertram Mond - 371-372 Technical Note—Comments on the “Classical” Derivation by Taha and Curry of Optimality Conditions in Linear Programming
by William M. Raike & James G. Taylor - 372-372 Technical Note—Rejoinder
by Hamdy A. Taha & Guy L. Curry - 373-374 Technical Note—Some Comments on “Linear” Programming with Absolute-Value Functionals
by M. R. Rao - 374-376 Technical Note—A Note on Reinverting the Dantzig-Wolfe Type Decomposed LP Basis
by William J. Reich - 377-380 Technical Note—Risk Aversion in Stochastic Programming with Recourse
by David P. Rutenberg - 380-386 Technical Note—Further Necessary Conditions for the Existence of a Solution to the Multi-Index Problem
by Graham Smith - 386-388 Technical Note—Solutions of a Special Class of Linear Programming Problems
by V. A. Sposito - 389-390 Technical Note—Parameterizing an Activity Vector in Linear Programming
by C. van de Panne - 390-393 Technical Note—Explicit Solutions of Interval Linear Programs
by S. Zlobec & A. Ben-Israel - 399-399 The 1972 Lanchester Prize---Call for Nominations
by Leslie C. Edie & Robert E. Machol & W. Edward Cushen
December 1972, Volume 20, Issue 6
- 1077-1088 Operating Characteristics of a Simple Shuttle under Local Dispatching Rules
by Edward Ignall & Peter Kolesar - 1089-1114 Air-Terminal Queues under Time-Dependent Conditions
by Bernard O. Koopman - 1115-1126 L = λ W : A Discounted Analogue and a New Proof
by Shaler Stidham - 1127-1136 A Generalization of L = λ W to Moments of Queue Length and Waiting Times
by Shelby L. Brumelle - 1137-1141 System States for a Series of Finite Queues
by Brian J. Haydon - 1142-1151 Mathematical Models for Controlling Growing Biological Populations: A Survey
by David L. Jaquette - 1152-1161 On the Set-Covering Problem
by Egon Balas & Manfred W. Padberg - 1162-1170 Parametric Network Flows
by Edward Minieka - 1171-1180 Monte Carlo Simulation of Operating-Room and Recovery-Room Usage
by Homer H. Schmitz & N. K. Kwak - 1181-1189 An Optimal Policy for Operating a Multipurpose Reservoir
by C. Bradley Russell - 1190-1192 Technical Note—Equivalent Payload Nomogram
by S. Matlin - 1193-1194 Letter to the Editor—Operations Research as a Basis for Getting Engineering and Liberal-Arts Students to Work Together
by Robert J. Brungraber - 1194-1195 Letter to the Editor—Comments on “A Note on the Solution to Lanchester-type Equations with Variable Coefficients”
by James G. Taylor
October 1972, Volume 20, Issue 5
- 925-941 Operations Research in Planning Political Campaign Strategies
by Joel D. Barkan & James E. Bruno - 942-954 Financing Mental-Health Services in the State of New York
by Lawrence D. Bodin & T. Owen Carroll & Allen Lee & Sally Stout - 955-966 A Statistical Technique for the Control of Traffic Intensity in the Queuing Systems M / G /1 and GI / M /1
by U. Narayan Bhat & S. Subba Rao - 967-973 Optimum Locations of Centers in Networks
by S. L. Hakimi & S. N. Maheshwari - 974-983 Ratios in Planning-Budgeting and Bounds on Resource Requirements
by Jonathan Halpern - 984-992 Vicinal Sequencing Problems
by Gerhard Jaeschke - 993-1009 Problem Decomposition and Data Reorganization by a Clustering Technique
by William T. McCormick & Paul J. Schweitzer & Thomas W. White - 1010-1019 A Partitioning Problem with Applications in Regional Design
by H. W. Corley & S. D. Roberts - 1020-1032 The ( S − 1, S ) Inventory Model with Arbitrary Back-Ordered Demand and Constant Delivery Times
by Marshall Rose - 1033-1043 A Model for Analyzing Artillery Registration Procedures
by Donald R. Barr & Larry D. Piper - 1044-1056 Technical Note—Bounds for the Travelling-Salesman Problem
by Nicos Christofides - 1057-1064 Letter to the Editor—The Synergy of Operations Research and Computers
by Arne Mjosund - 1065-1065 Acknowledgment
by Robert M. Oliver & David S. P. Hopkins
August 1972, Volume 20, Issue 4
- 741-751 Optimal Linear Ordering of Information Items
by Philip M. Morse - 752-763 Optional Specification of Air-Pollution-Emission Regulations Including Reliability Requirements
by Alfred Blumstein & R. Gordon Cassidy & Wilpen L. Gorr & Anthony S. Walters - 764-784 Optimal Search with Uncertain Sweep Width
by Henry R. Richardson & Barry Belkin - 785-790 Bias Considerations in Simulation Experiments
by George S. Fishman - 791-799 A Model of a Traffic Jam Behind a Bottleneck
by Edward A. Brill - 800-812 An Estimate of Expected Critical-Path Length in PERT Networks
by J. H. Lindsey - 813-819 A Problem in Bulk Service Scheduling
by G. L. Nemhauser & P. L. Yu - 820-834 Scheduling to Minimize the Variance of Holding Costs in Joint Production
by J. H. Fairhurst - 835-850 An Algorithm for Project (Job) Sequencing with Resource Constraints
by Samuel Corenstein - 851-859 Distribution of the Number of Tasks by a Repairable Machine
by Meckinley Scott - 860-874 A Decomposition Algorithm for Arborescence Inventory Systems
by Basil A. Kalymon - 875-887 Optimal Control Systems with Stochastic Boundary Conditions and State Equations
by Richard F. Baum - 888-894 Reliability Estimation in Life Testing in the Presence of an Outlier Observation
by S. K. Sinha - 895-902 Technical Note—A Scheduling Problem Involving Sequence Dependent Changeover Times
by A. G. Lockett & A. P. Muhlemann - 903-904 Technical Note—Fixed-Stockout-Probability Order Quantities with Lost Sales and Time Lag
by Arthur Yaspan - 904-907 Technical Note—Markov Decision Processes with State-Information Lag
by D. M. Brooks & C. T. Leondes - 907-912 Technical Note—The Infinitely-Many-Server Queue with Semi-Markovian Arrivals and Customer-Dependent Exponential Service Times
by Woollcott Smith - 913-914 Technical Note—On a Sequential Stopping Rule for Fixed-Sample Acceptance Tests
by R. E. Schafer
June 1972, Volume 20, Issue 3
- 465-473 Systems Problems in the City
by Peter L. Szanton - 558-570 The Application of Multifunction Stochastic Service Systems in Allocating Ambulances to an Urban Area
by William K. Hall - 571-594 Response Areas for Two Emergency Units
by Grace M. Carter & Jan M. Chaiken & Edward Ignall - 595-612 On Insensitivities in Urban Redistricting and Facility Location
by Richard C. Larson & Keith A. Stevenson - 613-618 A Method for Districting Among Facilities
by Ralph L. Keeney - 619-628 A Network-Flow Model for Racially Balancing Schools
by Peter C. Belford & H. Donald Ratliff - 629-642 A Spatial-Allocation Model for Regional Health-Services Planning
by William J. Abernathy & John C. Hershey - 643-667 A Telephone-Access Biomedical Information Center
by J. A. Dei Rossi & G. F. Mills & G. C. Sumner - 668-677 Solving Resource-Constrained Network Problems by Implicit Enumeration—Preemptive Case
by Linus Schrage - 678-688 Maximal Flow with Gains through a Special Network
by John J. Jarvis & Anthony M. Jezior - 689-697 Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
by D. A. Wismer - 698-707 Optimal Operating Policies for the Finite-Source Queuing Process
by N. K. Jaiswal & P. S. Simha - 708-721 Technical Note—A Sample Survey of Operations-Research Activities at the Corporate Level
by Efraim Turban - 722-727 Technical Note—Approximations to the Renewal Function m ( t )
by David L. Jaquette - 728-728 Errata
by Salvador B. Layno - 729-737 Letter to the Editor—Operations Research and Management Science Today, or, Does an Education in Checkers Really Prepare One for a Life of Chess?
by R. E. D. Woolsey
April 1972, Volume 20, Issue 2
- 249-264 An Equilibrium Flow Model of a University Campus
by Robert M. Oliver & David S. P. Hopkins - 265-275 Management of Seasonal Style-Goods Inventories
by Arunachalam Ravindran - 276-292 Pluralization: A Mathematical Model
by Manfred Kochen & Karl W. Deutsch - 293-308 Sequential Search for an Unknown Number of Objects of Nonuniform Size
by John M. Cozzolino - 309-317 A Probabilistic Model for Optimal Project Scheduling
by Michael Rubinovitch - 318-326 Generalization of White's Method of Successive Approximations to Periodic Markovian Decision Processes
by Shiaw Y. Su & Rolf A. Deininger - 327-334 A Stochastic Constrained Optimal Replacement Model: The Case of Ship Replacement
by Peter J. Kalman - 335-343 Some Reliability Fault-Testing Models
by Richard Butterworth - 344-349 Expected Damaged Area for Stick and Triangular Pattern Bombing
by N. K. Jaiswal & P. P. Sangal - 350-356 Stochastic Duels with Damage
by A. Nagabhushanam & G. C. Jain - 357-372 Two Measures for Describing Queue Behavior
by U. Narayan Bhat - 373-380 A Priority Queue with Low-Priority Arrivals General
by John A. Hooke - 381-388 Some Heavy-Traffic Limit Theorems for a Priority Queue with General Arrivals
by John A. Hooke - 389-405 Queues with Service in Random Order
by Grace M. Carter & Robert B. Cooper - 406-420 Multilevel Bulk Service Queues
by Emil Bahary & Peter Kolesar - 421-424 Queuing with Two Servers Working in Shifts
by Meckinley Scott - 425-433 The Infinite-Server Queue with Poisson Arrivals and Semi-Markovian Services
by Marcel F. Neuts & Shun-Zer Chen - 434-439 The Queue M / G /1 with the Semipreemptive-Priority Queuing Discipline
by Thomas M. O'Donovan - 440-451 Queues with Periodic Service and Changeover Time
by Martin Eisenberg - 452-454 Remark on a Service System with Mixed Input Streams
by Teresa Ryba
February 1972, Volume 20, Issue 1
- 1-18 Cost-of-Research Index, 1920–1970
by Helen S. Milton - 19-23 On Scheduling the Delivery of Babies
by Irwin W. Kabak - 24-36 Single-Server, Two-Machine Sequencing with Switching Time
by Vinod K. Sahney - 37-45 Games of Economic Survival with Discrete- and Continuous-Income Processes
by Hans U. Gerber - 46-48 Letter to the Editor—Implementation of an OR Approach for Forming Efficient Election Districts
by E. S. Savas & Harry Lipton & Leonora Burkholz - 49-52 Technical Note—Some Comments on Engel's “A Verification of Lanchester's Law”
by Robert W. Samz - 52-57 Technical Note—Asymptotic Properties of Mean Length Estimators for Finite Markov Queues
by John F. Reynolds - 58-74 Primal Decomposition of Mathematical Programs by Resource Allocation: I—Basic Theory and a Direction-Finding Procedure
by Gary J. Silverman - 75-93 Primal Decomposition of Mathematical Programs by Resource Allocation: II—Computational Algorithm with an Application to the Modular Design Problem
by Gary J. Silverman - 94-108 The Transportation-Location Problem
by Leon Cooper - 109-125 A Noniterative Algorithm for Tridiagonal Transportation Problems and Its Generalization
by Benjamin Lev - 126-136 Basic Dual Feasible Solutions for a Class of Generalized Networks
by Fred Glover & D. Klingman & A. Napier - 137-142 On Refinements of Some Duality Theorems in Linear Programming over Cones
by K. O. Kortanek & A. L. Soyster