Printed from https://ideas.repec.org/s/inm/oropre28.html
Content
April 1971, Volume 19, Issue 2
- 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 - 414-431 Computational Algorithms for Convex Stochastic Programs with Simple Recourse
by William T. Ziemba - 432-440 Turnpike Theorems for Integer Programming Problems
by Jeremy F. Shapiro - 441-453 Modular Design: An Application of Structured Geometric Programming
by U. Passy - 454-461 Quadratic Binary Programming with Application to Capital-Budgeting Problems
by D. J. Laughhunn - 462-470 On the Explicit Solution of a Special Class of Linear Economic Models
by A. Ben-Israel & A. Charnes & A. P. Hurter & P. D. Roberts - 471-482 Optimization of Series-Parallel-Series Networks
by Paul A. Jensen - 483-496 Allocation of Sorties in Air Interdiction
by John V. Armitage - 497-515 Algorithms for Targeting Strikes in a Lines-of-Communication Network
by Richard D. Wollmer - 516-525 Effectiveness Determination of Bombers Penetrating Through an Air-to-Air Defense
by Clifford D. Fawcett & Chester G. Jones - 526-540 Parametric Priority Rules: An Approach to Optimization in Priority Queues
by K. R. Balachandran - 541-549 Letter to the Editor—An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques
by Said Ashour - 549-555 Letter to the Editor—On the Merit of the Generalized Origin and Restarts in Implicit Enumeration
by Harvey M. Salkin - 555-558 Letter to the Editor—On Stochastic Linear Approximation Problems
by A. Ben-Israel & A. Charnes & M. J. L. Kirby - 559-562 Letter to the Editor—Optimum Distribution of Armor
by J. S. Rustagi & T. W. Doub - 562-564 Letter to the Editor—A Note on “Modular Design—A Special Case in Nonlinear Programming”
by David H. Evans - 564-565 Letter to the Editor—Supplement
by M. Raghavachari
April 1970, Volume 18, Issue 2
- 193-206 A Constant-Work Model for Student Attendance and Enrollment
by Kneale T. Marshall & Robert M. Oliver - 207-228 Intransitive Indifference in Preference Theory: A Survey
by Peter C. Fishburn - 229-252 Generalized Penalty-Function Concepts in Mathematical Optimization
by M. Bellmore & H. J. Greenberg & J. J. Jarvis - 253-262 Searching for the Multiplier in One-Constraint Optimization Problems
by B. L. Fox & D. M. Landi - 263-278 Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
by Linus Schrage - 279-289 Computing a Bias-Optimal Policy in a Discrete-Time Markov Decision Problem
by Eric V. Denardo - 290-299 A Note on Quadratic Programming in Activation Analysis
by Lee H. Smith - 300-305 Linear Programming Solutions to Ratio Games
by Roger G. Schroeder - 306-311 An Enumeration Algorithm for Knapsack Problems
by A. Victor Cabot - 312-315 On Some Mixing Sequences in Queuing Theory
by C. C. Heyde - 316-323 A Multiserver System with Preemptive Priorities
by M. Segal - 324-333 Two Problems in Markov Chains: A Topological Approach
by G. Guardabassi & S. Rinaldi - 334-373 A Review of the Literature on the Missile-Allocation Problem
by Samuel Matlin
February 1970, Volume 18, Issue 1
- 1-23 A Case History in Optimum Inventory Scheduling
by George Schussel & Steve Price - 24-34 Branch-and-Bound Methods: General Formulation and Properties
by L. G. Mitten - 35-51 Making Short-Run Changes in Production when the Employment Level is Fixed
by Matthew J. Sobel - 52-65 A Class of General Reliability Growth Prediction Models
by Donald R. Barr - 66-81 Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems
by Francesco Brioschi & Shimon Even - 82-86 Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
by A. Victor Cabot & Richard L. Francis - 87-94 On a Class of Directed Graphs—With an Application to Traffic-Flow Problems
by Loh Hooi-Tong - 95-106 Mathematical Optimization Techniques for the Simultaneous Apportionments of Reliability and Maintainability
by Anthony C. Shershin - 107-118 Stability in Nonlinear Programming
by J. P. Evans & F. J. Gould - 119-131 A New Decomposition Procedure for Dynamic Programming
by Peter J. Wong - 132-144 Simultaneous Success-Run Chains
by Jozef L. Teugels - 145-159 Two-Server Markovian Queues with Balking: Heterogeneous vs. Homogeneous Servers
by Vijendra P. Singh - 160-171 Steady-State Solution of the Queuing System E u / M / s with Batch Service
by R. F. Love - 172-174 Letter to the Editor—On the Generality of the Equation L = λ W
by William L. Maxwell - 174-179 Letter to the Editor—A Note on the Analysis of Peak-Demand Forecasts of an Electrical Utility
by Baruch Lev - 179-181 Letter to the Editor—The Mean Lanchester Attrition Rate
by Seth Bonder - 181-185 Letter to the Editor—An Approach to Reducing the Computing Time for Dynamic Programming
by Peter J. Wong - 185-187 Letter to the Editor—An Alternative Proof of a Conservation Law for the Queue G / G /1
by Linus Schrage - 187-190 Letter to the Editor—A Note on Pattern Separation
by Richard C. Grinold - 191-191 The 1969 Lanchester Prize---Call for Nominations
by John E. Walsh
December 1969, Volume 17, Issue 6
- 927-940 Systems Analysis for Social Decisions
by Joseph L. Bower - 941-957 Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
by Egon Balas - 958-972 Production Allocation with Set-Up Penalties and Concave Material Costs
by Charles H. White - 973-983 A New Method for Constrained Optimization Problems
by J. Kowalik & M. R. Osborne & D. M. Ryan - 984-992 A Problem in Optimal Search and Stop
by Sheldon M. Ross - 993-1004 A Probabilistic Approach to Solving Assignment Problems
by Mehmet I. Celebiler - 1005-1016 Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem
by Graciano Sá - 1017-1033 A Graph-Theoretic Approach to a Class of Integer-Programming Problems
by J. F. Desler & S. L. Hakimi - 1034-1057 A Dynamic Programming Algorithm for Cluster Analysis
by Robert E. Jensen - 1058-1061 Some Conditions for Ergodicity and Recurrence of Markov Chains
by A. G. Pakes - 1062-1076 On a Class of Queuing Problems and Discrete Transforms
by S. Subba Rao & N. K. Jaiswal - 1077-1089 A Time-Sharing Model with Many Queues
by I. Adiri & B. Avi-Itzhak
October 1969, Volume 17, Issue 5
- 761-769 Brains and Personality
by Joseph H. Engel - 770-784 Macro-Analysis of the American Educational System
by Alex M. Mood - 785-799 Experimental Design and Simulation in Unloading Ships by Helicopter
by Robert McQuie - 800-811 A Model of Adaptive Team Decision
by Charles C. Ying - 812-826 One-Dimensional Space Allocation: An Ordering Algorithm
by Donald M. Simmons - 827-837 System Availability and Some Design Implications
by Irwin W. Kabak - 838-847 Optimal Redundancy for Reliability in Series Systems
by P. M. Ghare & R. E. Taylor - 848-856 The Set-Partitioning Problem: Set Covering with Equality Constraints
by R. S. Garfinkel & G. L. Nemhauser - 857-860 On Finding the Maximal Gain for Markov Decision Processes
by Amedeo R. Odoni - 861-871 Probability Density of a Moving Particle
by Alan Washburn - 872-882 Constrained Nonlinear Optimization by Heuristic Programming
by D. A. Paviani & D. M. Himmelblau - 883-887 Closure of the Right-Hand-Side Set for Systems of Nonlinear Inequalities
by F. J. Gould & H. Pashner - 888-894 The Lanchester Attrition-Rate Coefficient: Some Comments on Seth Bonder's Paper and a Suggested Alternate Method
by C. B. Barfoot - 895-906 A Force Effectiveness Model with Area Defense of Targets
by A. Kooharian & N. Saber & H. Young - 907-910 GI / M /1 Priority Queue
by W. Henderson - 911-915 Letter to the Editor—Educational Planning in Developing Countries—A Possible Role for Operations Research
by Richard M. Durstine & Russell G. Davis - 915-917 Letter to the Editor—A Simpler Proof of L = λ W
by Samuel Eilon - 917-920 Letter to the Editor—Computational Experience with a Zero-One Programming Problem
by Horst Steinmann & Rolf Schwinn - 920-922 Letter to the Editor—Criterion Equivalence in Discrete Dynamic Programming
by Steven A. Lippman - 923-925 Letter to the Editor—A Comparison of Estimates of Nuclear Bomb Casualties from Two Different Urban Models
by C. A. Wilkins & J. A. Shaw & A. Keane
August 1969, Volume 17, Issue 4
- 565-582 Medium-Range Scheduling for a Freighter Fleet
by C. A. Olson & E. E. Sorenson & W. J. Sullivan - 583-599 Shortest Paths in Probabilistic Graphs
by H. Frank - 600-637 Efficient Heuristic Procedures for Integer Linear Programming with an Interior
by Frederick S. Hillier - 638-679 A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables
by Frederick S. Hillier - 680-684 On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
by M. Raghavachari - 685-700 On Assembly-Line Balancing Problems
by Raymond Reiter - 701-715 One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
by Hamilton Emmons - 716-727 Perturbation Theory and Undiscounted Markov Renewal Programming
by Paul J. Schweitzer - 728-742 A Mixed-Priority Queue with Applications to the Analysis of Real-Time Systems
by Linus Schrage - 743-749 Letter to the Editor—Computational Results of an Integer Programming Algorithm
by Patrick D. Krolak - 749-750 Letter to the Editor—An Approach to Some Structured Linear Programming Problems
by John M. Bennett & David R. Green - 751-753 Letter to the Editor—A Critique of the Norman-White Dynamic Programming Approximation
by Thomas E. Morton - 754-755 Letter to the Editor—The Dependence of Sojourn Times in Tandem M/M/S Queues
by P. J. Burke - 755-755 Letter to the Editor—A Note on Multicommodity Max-Flow
by Richard C. Grinold - 756-756 Errata
by R. D. Smith & R. A. Dudek
June 1969, Volume 17, Issue 3
- 373-394 Cost-Effectiveness in Urban Transportation
by Edward N. Dodson - 395-412 An Appraisal of Some Shortest-Path Algorithms
by Stuart E. Dreyfus - 413-424 Information Analysis Without States of the World
by Peter C. Fishburn - 425-436 A Computationally Compact Sufficient Condition for Constrained Minima
by G. Reklaitis & D. J. Wilde - 437-454 An Improved Implicit Enumeration Approach for Integer Programming
by A. M. Geoffrion - 455-465 Computer Solutions to Minimum-Cover Problems
by R. Roth - 466-477 A Priority Rule Based on the Ranking of the Service Times for the M / G /1 Queue
by S. Sreekantan Nair & Marcel F. Neuts - 478-488 A Duel Involving False Targets
by Calvin W. Sweat - 489-505 Minimization of Fatalities in a Nuclear Attack Model
by Guillermo Owen - 506-518 A Multiserver Queue with Enforced Idle Times
by L. E. N. Delbrouck - 519-525 Some Waiting-Time Distributions for Queues with Multiple Feedback and Priorities
by E. G. Enns - 526-535 Preemptive Priority Assignment in Multichannel Systems
by Israel Brosh - 536-543 Letter to the Editor—Availability of Renewal Functions for Gamma and Weibull Distributions with Increasing Hazard Rate
by Richard M. Soland - 543-546 Letter to the Editor—Some Comments on the Traveling Salesman Problem
by Akkanad M. Isaac & Efraim Turban - 546-551 Letter to the Editor—Finding Minimal Cost-Time Ratio Circuits
by Bennett Fox - 551-553 Letter to the Editor—Binomial Distribution Sample-Size Nomogram
by S. Matlin