Printed from https://ideas.repec.org/s/inm/oropre28.html
Content
June 1970, Volume 18, Issue 3
- 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
April 1969, Volume 17, Issue 2
- 199-232 Models of a Total Criminal Justice System
by Alfred Blumstein & Richard Larson - 233-261 Pseudo-Boolean Programming
by Peter L. Hammer & Sergiu Rudeanu - 262-291 Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
by Arthur F. Veinott - 292-310 Optimal Strategies for Divestiture
by R. H. Hayes - 311-336 Maintenance and Operating Characteristics of Communication Networks
by Kenji Onaga - 337-343 Optimum Allocation of Stand-by Systems
by M. N. Bhattacharyya - 344-350 Sensitivity of Bayes Procedures to the Prior Distribution
by Donald A. Pierce & J. Leroy Folks - 351-358 A Single-Server Priority Queuing System with General Holding Times, Poisson Input, and Reverse-Order-of-Arrival Queuing Discipline
by L. Durr - 359-367 Letter to the Editor—Toward a Unifying Theory for Integer Linear Programming
by Stanley Zionts - 368-370 Letter to the Editor—A Method for Obtaining the Optimal Dual Solution to a Linear Program Using the Dantzig-Wolfe Decomposition
by Warren E. Walker
February 1969, Volume 17, Issue 1
- 1-35 A Media Planning Calculus
by John D. C. Little & Leonard M. Lodish - 36-47 A Probabilistic Model for Obsolescence
by Philip M. Morse & Caroline Elston - 48-69 A Class of Discrete-Time Models for the Study of Hospital Admission Systems
by J. F. Bithell - 70-84 Event Classification
by Robert T. Nash - 85-111 Algorithms for the Simple Plant-Location Problem with Some Side Conditions
by Kurt Spielberg - 112-132 Safety-First Rules under Chance-Constrained Linear Programming
by J. K. Sengupta - 133-144 Smoothing Start-Up and Shut-Down Costs in Sequential Production
by Matthew J. Sobel - 145-162 Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs
by Matthew J. Sobel - 163-174 Planning-Horizon Theorems for Knapsack and Renewal Problems with a Denumerable Number of Activities
by Steven A. Lippman - 175-186 An Approximation for the Moments of Waiting Times
by C. R. Heathcote & P. Winer - 187-191 Letters to the Editor---Extension of Dantzig's Algorithm to Finding an Initial Near-Optimal Basis for the Transportation Problem
by Edward J. Russell - 192-192 Errata
by Martin Pincus
December 1968, Volume 16, Issue 6
- 1093-1099 Management Research in State and Local Governments
by Freeman Holmer - 1100-1114 On the Optimal Cutting of Defective Sheets
by Susan G. Hahn - 1115-1125 Reducing the Memory Requirements of Dynamic Programming
by Peter J. Wong & David G. Luenberger - 1126-1137 A Service System with Unfilled Requests Repeated
by J. Keilson & J. Cozzolino & H. Young - 1138-1146 Bounds on the Optimal Operating Policy for a Class of Single-Server Queues
by Daniel P. Heyman & Kneale T. Marshall - 1147-1151 Delays for a LIFO Queue with Constant Service Time
by Paul E. Peters - 1152-1159 Chance-Constrained Equivalents of Some Stochastic Programming Problems
by Gifford H. Symonds - 1160-1165 A Simple Class of Parametric Linear Programming Problems
by S. Barnett - 1166-1175 An Explicit Solution of a Special Class of Linear Programming Problems
by A. Ben-Israel & A. Charnes - 1176-1185 Multipartite Optimization
by Robley E. George - 1186-1193 Models for a Save-Discard Decision
by M. H. Rothkopf & S. Fromovitz - 1194-1205 Optimal Simultaneous Search for the Maximum by the Principle of Statistical Information
by Michael Heymann - 1206-1211 An Approach to Zero-One Integer Programming
by A. Victor Cabot & Arthur P. Hurter - 1212-1216 A Note on Linear Programming and Integer Feasibility
by Fred Glover - 1217-1218 Letter to the Editor—The End
by William H. Bonney - 1218-1221 Letter to the Editor—Fractional Container-Loads and Topological Groups
by A. J. Goldman - 1222-1227 Letter to the Editor—Parameter Estimation in a Markov Dependent Firing Distribution
by J. S. Rustagi & R. C. Srivastava - 1227-1230 Letter to the Editor—Modification of the Primal-Dual Algorithm for Degenerate Problems
by Harold Greenberg - 1230-1232 Letter to the Editor—A Note on the Waiting-Time Distribution for the M / G /1 Queue with Last-Come-First-Served Discipline
by Julian Keilson - 1232-1234 Letter to the Editor—Comments on a Paper By Romesh Saigal: “A Constrained Shortest Route Problem”
by Marc Rosseel - 1234-1238 Letter to the Editor—A Multicommodity Max-Flow Algorithm
by Richard C. Grinold - 1239-1242 Letter to the Editor—A Note on Two Coverage Problems for Multiple Shots
by Harold J. Breaux
October 1968, Volume 16, Issue 5
- 902-914 A Loading Problem in Process Type Production
by Salah E. Elmaghraby - 915-927 Adaptive Diagnosis of Faulty Systems
by Wesley W. Chu - 928-947 Group Theoretic Algorithms for the Integer Programming Problem II: Extension to a General Algorithm
by Jeremy F. Shapiro - 948-954 Use of Geometric Programming to Maximize Reliability Achieved by Redundancy
by A. J. Federowicz & M. Mazumdar - 955-961 Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
by Michael B. Teitz & Polly Bart - 962-976 Closed Finite Queuing Networks with Time Lags
by M. Posner & B. Bernholtz - 977-985 Closed Finite Queuing Networks with Time Lags and with Several Classes of Units
by M. Posner & B. Bernholtz - 986-1001 A Discrete-Time Queuing Analysis of Conveyor-Serviced Production Stations
by Charles S. Beightler & Robert M. Crisp - 1002-1005 Monte Carlo Estimation of the Mean Queue Size in a Stationary GI / M /1 Queue
by D. J. Daley - 1006-1015 The Waiting Time Process for a Certain Correlated Queue
by B. W. Conolly - 1016-1020 Minimum Variance Unbiased Estimate of a Coverage Probability
by D. G. Kabe - 1021-1026 Expected Target Damage for a Salvo of Rounds with Elliptical Normal Delivery and Damage Functions
by Frank E. Grubbs - 1027-1040 Expected Coverage for Targets of Nonuniform Density
by Frank McNolty - 1041-1057 A Reliability Problem with Spares and Multiple Repair Facilities
by R. Natarajan - 1058-1067 Optimum Maintenance with Incomplete Information
by James E. Eckles - 1068-1083 The Reliability of Dependent Parallel or Standby N-Unit Redundancies
by Joseph J. Eiss - 1084-1086 Letter to the Editor—Remarks on Finite Queuing Tables
by D. F. Votaw & L. G. Peck - 1087-1087 Erratum
by George S. Fishman
August 1968, Volume 16, Issue 4
- 709-716 International Operations Research Activities
by John E. Walsh - 717-726 The Role of Research in Underdeveloped Countries
by Russell L. Ackoff - 727-740 A New Foundation for a Simplified Primal Integer Programming Algorithm
by Fred Glover - 741-749 Surrogate Constraints
by Fred Glover - 750-782 A Simplified Primal (All-Integer) Integer Programming Algorithm
by R. D. Young - 783-798 The Use of Order Statistics in Estimation
by H. Leon Harter - 799-818 Stochastic Optimization of Production Planning
by J. H. Beebe & C. S. Beightler & J. P. Stark - 819-829 A Lagrangian Application to Production Models
by Gary D. Eppen & F. J. Gould - 830-840 Blocking and Delays in M ( n ) / M / c Bulk Queuing Systems
by Irwin W. Kabak - 841-848 Bounds for Some Generalizations of the GI / G /1 Queue
by K. T. Marshall - 849-857 Asymptotic Lagrange Regularity for Pseudoconcave Programming with Weak Constraint Qualification
by K. O. Kortanek & J. P. Evans - 858-867 Sufficient Conditions for Positive Recurrence and Recurrence of Specially Structured Markov Chains
by Thomas B. Crabill - 868-871 Letter to the Editor—George Kimball, The Man
by John B. Lathrop - 871-874 Letter to the Editor—George E. Kimball
by Philip M. Morse - 875-879 Letter to the Editor—Bruce's Spider and Renewal Theory
by F. Downton - 880-883 Letter to the Editor—An Ordering Policy for Stock Items when Delivery Can be Expedited
by S. G. Allen & D. A. D'Esopo - 883-885 Letter to the Editor—A Note on Divisible Activities in Critical Path Analysis
by Lawrence D. Bodin - 885-886 Correction to “Queues with State-Dependent Stochastic Service Rates”
by Carl M. Harris - 886-886 Errata
by Egon Balas
June 1968, Volume 16, Issue 3
- 457-488 Lanchester Models of Guerrilla Engagements
by Marvin B. Schaffer - 489-508 Interception Strategy Based on Intermittent Information
by George R. Lindsey - 509-517 A Helicopter Versus Submarine Search Game
by John M. Danskin - 518-524 Solution of a General, Nonadaptive, Many-vs-Many Duel Model
by Robert L. Helmbold - 525-537 A Survey of Search Theory
by James M. Dobbie