Operations Research

1952 - 2025

From INFORMS
Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 21, issue 6, 1973

Strategic Management in General Electric pp. 1177-1182

C. H. Springer

The Behavior of Stock-Price Relatives—A Markovian Analysis pp. 1183-1199

Bruce D. Fielitz and T. N. Bhargava

The Maximum-Entropy Distribution of the Future Market Price of a Stock pp. 1200-1211

John M. Cozzolino and Michael J. Zahner

Approximate Queuing Models for Multiprogramming Computer Systems pp. 1212-1230

B. Avi-Itzhak and D. P. Heyman

Optimal Replacement Rules when Changes of State are Semi-Markovian pp. 1231-1249

Edward P. C. Kao

Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem pp. 1250-1259

Wlodzimierz Szwarc

Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms pp. 1260-1266

Philip B. Zwart

A Heuristic Search Procedure for Estimating a Global Solution of Nonconvex Programming Problems pp. 1267-1280

Rick Hesse

Optimal Operation of an M / G /1 Priority Queue with Removable Server pp. 1281-1290

Colin E. Bell

Optimal Weapon Allocation with Overlapping Area Defenses pp. 1291-1308

Gershon G. Furman and Harvey J. Greenberg

Technical Note—Stopping Rules for Sequencing Problems pp. 1309-1315

Paul H. Randolph, Gary Swinson and Carl Ellingsen

Technical Note—On an Algorithm of Ghare and Taylor pp. 1315-1318

Dennis W. McLeavey

Technical Note—On a Paper by Simon pp. 1318-1322

W. Karl Kruse and Alan J. Kaplan

Corrections to a Paper by Hershaft on Decoy Effectiveness pp. 1322-1322

Stephen L. Robinson

Errata pp. 1323-1323

Basil A. Kalymon

Volume 21, issue 5, 1973

Systems, Purposes, and the Watergate pp. 1019-1023

Harlan Cleveland

The Quality and Maturity of Operations Research pp. 1024-1029

Leslie C. Edie

A Systems Analysis of a University-Health-Service Outpatient Clinic pp. 1030-1047

Edward J. Rising, Robert Baron and Barry Averill

Some Programming Problems in Population Projection pp. 1048-1062

Masao Nakamura

Labor Displacement and Air-Pollution Control pp. 1063-1070

Robert E. Kohn

The Optimal Control of Partially Observable Markov Processes over a Finite Horizon pp. 1071-1088

Richard D. Smallwood and Edward J. Sondik

Planning the 41st ORSA Meeting: The Visiting-Fireman Problem, I pp. 1089-1094

Richard E. Beckwith

Scheduling the 41st-ORSA-Meeting Sessions: The Visiting-Fireman Problem, II pp. 1095-1103

Larry R. Arnold, Richard E. Beckwith and Carl M. Jones

Economic Models and Planning Outdoor Recreation pp. 1104-1113

Charles J. Cicchetti, Anthony C. Fisher and V. Smith

Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I pp. 1114-1127

Marshall L. Fisher

Asymptotic Linear Programming pp. 1128-1141

Robert G. Jeroslow

The Group-Theoretic Structure in the Fixed-Charge Transportation Problem pp. 1142-1153

J. L. Kennington and V. E. Unger

Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming pp. 1154-1157

A. L. Soyster

Technical Note—Decomposition Techniques for the Chebyshev Problem pp. 1157-1163

Roger A. Blau

Technical Note—Maximum and Minimum Service Times for Batches of Jobs with an Unknown Number of Servers pp. 1163-1167

Ernest M. Scheuer

Volume 21, issue 4, 1973

Theory of Measures of Effectiveness for General-Purpose Military Forces: Part I. A Zero-Sum Payoff Appropriate for Evaluating Combat Strategies pp. 867-885

George E. Pugh and John P. Mayberry

Theory of Measures of Effectiveness for General-Purpose Military Forces: Part II. Lagrange Dynamic Programming in Time-Sequential Combat Games pp. 886-906

George E. Pugh

Some Search Problems with False Contacts pp. 907-925

James M. Dobbie

A New Formulation of Lanchester Combat Theory pp. 926-941

Frank E. Grubbs and John H. Shuford

An Allocation Problem of Support Fire in Combat as a Differential Game pp. 942-951

Yasushi Kawara

An Improved Stochastic Model for Occupancy-Related Random Variables in General-Acute Hospitals pp. 952-965

William Shonick and James R. Jackson

Serial Correlation in a Simple Dam Processs pp. 966-973

Nils Blomqvist

State Probabilities of M / M /1 Priority Queues pp. 974-987

Barry I. Marks

Variance Reduction by Antithetic Variates in GI / G /1 Queuing Simulations pp. 988-997

Bill Mitchell

Optimal Control of the Vidale-Wolfe Advertising Model pp. 998-1013

Suresh Sethi

Volume 21, issue 3, 1973

Science in the Systems Age: Beyond IE, OR, and MS pp. 661-671

Russell L. Ackoff

On the Optimal Size for Exploited Natural Animal Populations pp. 672-676

Stuart H. Mann

An Optimization Model for Corporate Financial Planning pp. 677-692

William F. Hamilton and Michael A. Moses

A Three-Stage Manpower Planning and Scheduling Model—A Service-Sector Example pp. 693-711

William J. Abernathy, Nicholas Baloff, John C. Hershey and Sten Wandel

An Artificial-Variable Elimination Method for Solving Block-Diagonal Programming Problems pp. 712-727

Thomas W. Knowles

Markovian Decision Processes with Uncertain Transition Probabilities pp. 728-740

Jay K. Satia and Roy E. Lave

Optimal Stopping in a Discrete Search Problem pp. 741-747

Milton C. Chew

Probabilistic Analysis of a Two-Unit System with a Warm Standby and a Single Repair Facility pp. 748-754

S. K. Srinivasan and M. N. Gopalan

Bayesian Estimation of Life Parameters in the Weibull Distribution pp. 755-763

George C. Canavos and Chris P. Taokas

Priority Queuing Systems with and without Feedback pp. 764-776

Thomas K. Wignall

Efficient Operation of Optional-Priority Queuing Systems pp. 777-786

Colin E. Bell

Loss Systems with Mixed Renewal and Poisson Inputs pp. 787-795

A. Kuczura

Operations Research Education: Some Requirements and Deficiencies pp. 796-809

Seth Bonder

A Comparison of Two Personnel Prediction Models pp. 810-822

Kneale T. Marshall

Variable-Work Models for Predicting Course Enrollments pp. 823-834

K. R. Balachandran and Donald Gerwin

A Procedure for Selecting Educational Goal Areas for Emphasis pp. 835-845

James S. Dyer

Technical Note—Minimizing Average Flow Time with Parallel Machines pp. 846-847

W. A. Horn

Technical Note—Elimination of Suboptimal Actions in Markov Decision Problems pp. 848-851

Richard C. Grinold

Letter to the Editor—Validating Claims for Algorithms Proposed for Publication pp. 852-854

James P. Ignizio

Letter to the Editor—Comments on a Blood-Bank Inventory Model of Pegels and Jelmert pp. 855-858

John B. Jennings and Peter Kolesar

Letter to the Editor—Comments on a Letter by Woolsey pp. 858-861

Stafford Beer, A. Charnes, W. W. Cooper, B. Mellon and R. E. D. Woolsey

Letter to the Editor—An Example of Ignall and Schrage pp. 862-862

Sumer C. Aggarwal

Volume 21, issue 2, 1973

An Applicable Model of Optimal Marketing Policy pp. 401-412

Meir Kohn and Yakir Plessner

Computed School Assignments in a Large District pp. 413-426

Allen D. Franklin and Ernest Koenigsberg

The Progress of Management-Science Activities in Large US Industrial Corporations pp. 427-450

Michael Radnor and Rodney D. Neal

The Relation between Formal Procedures for Pursuing OR/MS Activities and OR/MS Group Success pp. 451-474

Rodney D. Neal and Michael Radnor

An Empirical Investigation of Optimum-Seeking in the Computer Simulation Situation pp. 475-497

Dennis E. Smith

An Effective Heuristic Algorithm for the Traveling-Salesman Problem pp. 498-516

S. Lin and B. W. Kernighan

Maximal, Lexicographic, and Dynamic Network Flows pp. 517-527

Edward Minieka

Calculating Maximal Flows in a Network with Positive Gains pp. 528-541

Richard C. Grinold

Sequencing Expansion Projects pp. 542-553

Donald Erlenkotter

Response-Variance Tradeoffs in Adaptive Forecasting pp. 554-568

John O. McClain and L. Joseph Thomas

Processor Utilization in Multiprogramming Systems via Diffusion Approximations pp. 569-576

Donald P. Gaver and Gerald S. Shedler

The Rearrangement of Items in a Warehouse pp. 577-589

Nicos Christofides and I. Colloff

Optimal Defensive Missile Allocation: A Discrete Min-Max Problem pp. 590-596

Richard M. Soland

On Two-Server Poisson Queues with Two Types of Customers pp. 597-603

T. C. T. Kotiah and N. B. Slater

A Queuing-Type Birth-and-Death Process Defined on a Continuous-Time Markov Chain pp. 604-609

Uri Yechiali

Single-Server Queues with Service Time Dependent on Waiting Time pp. 610-616

M. Posner

On the Ergodic Theory of Markov Chains pp. 617-622

Paul G. Marlin

A k -Server Queue with Phase Input and Service Distribution pp. 623-628

Asha Seth Kapadia

Distribution-Free Analysis of M / G /1 and G / M /1 Queues pp. 629-635

Irwin Greenberg

Technical Note—Distribution of the Mean Queue Size for the Time-Dependent Queue pp. 636-638

H. Ali

Technical Note—How to Win by Losing pp. 639-643

David Silverman and Benjamin L. Schwartz

Technical Note—Economic Packaging Frequency for Items Jointly Replenished pp. 644-647

S. K. Goyal

Technical Note—Comment on an Integer Maximization Problem pp. 648-650

Iram J. Weinstein and Oliver S. Yu

Technical Note—A Note on Lipstein's Model of Consumer Behavior pp. 650-652

Warren Dent

Errata pp. 653-653

Joel D. Barkan and James E. Bruno

Volume 21, issue 1, 1973

On Symmetric Duality in Nonlinear Programming pp. 1-9

M. S. Bazaraa and J. J. Goode

On Multi-Commodity Maximal Dynamic Flows pp. 10-21

Mandell Bellmore and Ramakrishna R. Vemuganti

Linear Programming with a Fractional Objective Function pp. 22-29

G. R. Bitran and A. G. Novaes

A Convex Programming Model for Optimizing SLBM Attack of Bomber Bases pp. 30-36

Jerome Bracken and James T. McGill

Mathematical Programs with Optimization Problems in the Constraints pp. 37-44

Jerome Bracken and James T. McGill

An Algorithm for Integer Linear Programming: A Combined Algebraic and Enumeration Approach pp. 45-60

Gordon H. Bradley and Pran N. Wahi

Enumerative Cuts: I pp. 61-89

Claude-Alain Burdet

Heuristic Selection of Advanced Bases for a Class of Linear Programming Models pp. 90-100

Martin Dillon

A Minimax Facility-Configuration Problem Involving Lattice Points pp. 101-111

Richard L. Francis

Computation in Discrete Stochastic Programs with Recourse pp. 112-122

Stanley J. Garstka and David P. Rutenberg

Convexity Cuts and Cut Search pp. 123-134

Fred Glover

Concave Programming Applied to a Special Class of 0-1 Integer Programs pp. 135-140

Fred Glover and D. Klingman

The Generalized Lattice-Point Problem pp. 141-155

Fred Glover and D. Klingman

Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems pp. 156-161

Fred Glover and Eugene Woolsey

The Generalized Penalty-Function/Surrogate Model pp. 162-178

Harvey J. Greenberg

Computing Optimal Solutions for Infinite-Horizon Mathematical Programs with a Transient Stage pp. 179-187

Richard C. Grinold and David S. P. Hopkins

Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case pp. 188-209

William Hogan

A Generalized Approach to Dantzig-Wolfe Decomposition for Concave Programs pp. 210-220

Charles A. Holloway

There Cannot be any Algorithm for Integer Programming with Quadratic Constraints pp. 221-224

R. C. Jeroslow

An Algorithm for Globally-Optimal Nonlinear-Cost Multidimensional Flows in Networks and Some Special Applications pp. 225-239

Andrew Korsak

Solution Sets of Convex Programs Related to Chemical Equilibrium Problems pp. 240-246

K. O. Kortanek, W. O. Rom and A. L. Soyster

An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities pp. 247-260

T. H. Mattheiss

A Graph-Theoretic Equivalence for Integer Programs pp. 261-269

Jean-Claude Picard and H. Donald Ratliff

Optimal Design of Multiactivity Multifacility Systems by Branch and Bound pp. 270-283

Charles E. Pinkus, Donald Gross and Richard M. Soland

An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems pp. 284-295

V. Srinivasan and G. L. Thompson

An Example of the Application of Nonlinear Programming to Chemical-Process Optimization pp. 296-304

M. Sriram and William F. Stevens

Some Properties of Generalized Concave Functions pp. 305-313

W. A. Thompson and Darrel W. Parke

Location Theory, Dominance, and Convexity pp. 314-320

Richard E. Wendell and Arthur P. Hurter

Technical Note—A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case pp. 321-322

Egon Balas

Technical Note—Equivalent Mixed Integer Programming Problems pp. 323-326

Gordon H. Bradley

Technical Note—An Application of Witzgall’s Algorithm to a Problem in Radar Signal Design pp. 326-328

C. W. Chapoton

Technical Note—Theorems of Convergence for Improved Nonlinear Programming Algorithms pp. 328-332

Jacques Dubois

Technical Note—Solution of the Value-Independent Knapsack Problem by Partitioning pp. 332-337

Bruce Faaland

Technical Note—Conditions for Global Optimality in Nonlinear Programming pp. 337-340

James E. Falk

Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem pp. 340-343

Robert S. Garfinkel

Technical Note—Rationalizing Discrete Programs pp. 343-345

F. J. Gould and D. S. Rubin

Technical Note—Bounding Nonconvex Programs by Conjugates pp. 346-348

Harvey J. Greenberg

Technical Note—The Set-Covering Problem with Equality Constraints pp. 348-351

D. K. Guha

Technical Note—The Continuity of the Perturbation Function of a Convex Program pp. 351-352

William W. Hogan

Technical Note—The Use of Cuts in Complementary Programming pp. 353-359

Toshihide Ibaraki

Technical Note—A Class of Nonlinear Chance-Constrained Programming Models with Joint Constraints pp. 360-364

R. Jagannathan and M. R. Rao

Technical Note—Maximal Funnel-Node Flow in an Undirected Network pp. 365-369

John J. Jarvis and Duane D. Miller

Technical Note—On a Duality Theorem for a Nonlinear Programming Problem pp. 369-370

Bertram Mond

Technical Note—Comments on the “Classical” Derivation by Taha and Curry of Optimality Conditions in Linear Programming pp. 371-372

William M. Raike and James G. Taylor

Technical Note—Rejoinder pp. 372-372

Hamdy A. Taha and Guy L. Curry

Technical Note—Some Comments on “Linear” Programming with Absolute-Value Functionals pp. 373-374

M. R. Rao

Technical Note—A Note on Reinverting the Dantzig-Wolfe Type Decomposed LP Basis pp. 374-376

William J. Reich

Technical Note—Risk Aversion in Stochastic Programming with Recourse pp. 377-380

David P. Rutenberg

Technical Note—Further Necessary Conditions for the Existence of a Solution to the Multi-Index Problem pp. 380-386

Graham Smith

Technical Note—Solutions of a Special Class of Linear Programming Problems pp. 386-388

V. A. Sposito

Technical Note—Parameterizing an Activity Vector in Linear Programming pp. 389-390

C. van de Panne

Technical Note—Explicit Solutions of Interval Linear Programs pp. 390-393

S. Zlobec and A. Ben-Israel

The 1972 Lanchester Prize---Call for Nominations pp. 399-399

Leslie C. Edie, Robert E. Machol and W. Edward Cushen