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 19, issue 7, 1971

A Review of Quasi-Convex Functions pp. 1553-1570

Harvey J. Greenberg and William P. Pierskalla

Classification Schemes for the Strong Duality of Linear Programming Over Cones pp. 1571-1585

K. O. Kortanek and W. O. Rom

Bounding Distributions for a Stochastic Acyclic Network pp. 1586-1601

George B. Kleindorfer

An Algorithm for Universal Maximal Dynamic Flows in a Network pp. 1602-1612

W. L. Wilkinson

A Generalized Approach to the Method of Steepest Ascent pp. 1613-1618

H. Eldor and L. B. Koppel

Decentralized Transshipment Networks pp. 1619-1631

Timothy W. Ruefli

Parameterizing an Activity Vector in Linear Programming pp. 1632-1646

Chaiho Kim

On an Allocation Problem with Multistage Constraints pp. 1647-1663

Lalitha Sanathanan

Sequential Control of Homogeneous Activities—Linear Programming of Semi-Markovian Decisions pp. 1664-1674

Hirohide Hinomoto

Nonlinear Assignment Problems Treated by Geometric Programming pp. 1675-1690

Ury Passy

Group-Theoretic Results in Mixed Integer Programming pp. 1691-1697

Laurence A. Wolsey

Scheduling Bioproduction Harvest pp. 1698-1707

Tung Liang, Wen-yuan Huang and Jaw-Kai Wang

The Near-Myopic Nature of the Lagged-Proportional-Cost Inventory Problem with Lost Sales pp. 1708-1716

Thomas E. Morton

Production-Planning Algorithms for the Inventory-Overtime Tradeoff pp. 1717-1729

Howard Kunreuther

Two Casualty-Estimation Problems Associated with Area Targets and the Circular Coverage Function pp. 1730-1741

Campbell B. Read

Technical Note—Parametric Solution of a Class of Nonconvex Programs pp. 1742-1747

R. R. Hocking and R. L. Shepard

Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem pp. 1747-1751

Robert S. Garfinkel

Technical Note—System Simulation and Maximum Entropy pp. 1751-1753

Maynard M. W. Chan

Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem pp. 1753-1758

Jatinder N. D. Gupta

Technical Note—On a Formula Dual to Erlang's Loss Formula pp. 1759-1760

J. W. Cohen

Technical Note—A Particular Two-Priority Queue pp. 1760-1764

Alan Washburn

Technical Note—A Comment on a Paper by Goodwin and Giese pp. 1764-1765

George F. Brown and Timothy M. Corcoran

Erratum pp. 1766-1766

Mandell Bellmore and John C. Malone

Volume 19, issue 6, 1971

The ABC's of OR pp. 1259-1281

Harvey M. Wagner

A Motivational Profile of Management Scientists pp. 1282-1299

Herbert L. Lyon, John M. Ivancevich and James H. Donnelly

Toward an Integrated Methodology for the Analysis of Health-Care Systems pp. 1300-1322

Richard D. Smallwood, Edward J. Sondik and Fred L. Offensend

The Theorem of the Alternative in Social Choice Theory pp. 1323-1330

Peter C. Fishburn

A Search Model for Evaluating Combinatorially Explosive Problems pp. 1331-1349

Keith L. McRoberts

An Ordering Algorithm for Analysis of Data Arrays pp. 1350-1362

Stephen B. Deutsch and John J. Martin

The Location of Emergency Service Facilities pp. 1363-1373

Constantine Toregas, Ralph Swain, Charles ReVelle and Lawrence Bergman

Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions pp. 1374-1392

Ferydoon Kianfar

Hypercylindrically Deduced Cuts in Zero-One Integer Programs pp. 1393-1405

R. D. Young

An all Zero-One Algorithm for a Certain Class of Transportation Problems pp. 1406-1418

Adriano De Maio and Claudio Roveda

The Solution of an Optimal Control Problem in Financial Modeling pp. 1419-1433

Blaine E. Davis and D. Jack Elzinga

Stochastic Prices in a Single-Item Inventory Purchasing Model pp. 1434-1458

Basil A. Kalymon

Solution Method for a Class of Stochastic Scheduling Problems for the Production of a Single Commodity pp. 1459-1466

Gifford H. Symonds

A Multi-Item Inventory Model with Joint Backorder Criterion pp. 1467-1476

Bruce L. Miller

An Algorithm to Solve Finite Separable Single-Constrained Optimization Problems pp. 1477-1493

Edward P. Loane

The Distribution of the Occupation Time for Single-Server Queues pp. 1494-1501

Lajos Takács

A Model of the ABM-vs.-RV Engagement with Imperfect RV Discrimination pp. 1502-1517

Salvador B. Layno

Technical Note—A Counterexample to the Rudimentary Primal Integer Programming Algorithm pp. 1518-1522

S. J. Mathis

Technical Note—Complementary Programming pp. 1523-1529

Toshihide Ibaraki

Technical Note—Exact Solution of the Fixed-Charge Transportation Problem pp. 1529-1538

Paul Gray

Technical Note—A Note on Gomory Fractional Cuts pp. 1538-1541

Harvey M. Salkin

Errata pp. 1542-1542

J. S. Rustagi and T. W. Doub

Errata pp. 1543-1543

C. P. Saksena and A. J. Cole

Volume 19, issue 4, 1971

Common-Stock Transaction Sequences and the Random-Walk Model pp. 845-861

Donald M. Simmons

Accommodating Student Demand for Courses by Varying the Classroom-Size Mix pp. 862-874

R. Longworth Smith

Utility Independence and Preferences for Multiattributed Consequences pp. 875-893

Ralph L. Keeney

Optimal Whereabouts Search pp. 894-904

Joseph B. Kadane

Capacity of a Network with Increasing Demands and Arcs Subject to Failure pp. 905-915

P. J. Doulliez and M. R. Rao

Optimum Network Partitioning pp. 916-932

Paul A. Jensen

A Generalized Lagrange-Multiplier Method for Constrained Matrix Games pp. 933-945

Alan I. Penn

An Efficient Algorithm for Multi-Item Scheduling pp. 946-969

L. S. Lasdon and R. C. Terjung

A Sequential Stopping Rule for Fixed-Sample Acceptance Tests pp. 970-976

Gerald G. Brown and Herbert C. Rutemiller

Technical Note—The Allocation of Power that Minimizes Tension pp. 977-982

Henri Theil

Technical Note—On Hu's Decomposition Algorithm for Shortest Paths in a Network pp. 983-985

Jin Y. Yen

Technical Note—Comments on a Paper by S. G. Allen and D. A. D'Esopo: “An Ordering Policy for Repairable Stock Items” pp. 986-988

Richard M. Simon and D. A. D'Esopo

Letter to the Editor—Implementation of New Ideas in Bureaucracies pp. 989-990

S. J. Deitchman

Letter to the Editor—Application of Kuhn's Hungarian Assignment Algorithm to Posting Servicemen pp. 991-991

T. A. Ewashko and R. C. Dudding

Letter to the Editor—The Language of Lot Size pp. 992-997

Walter R. Crowe

Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems pp. 998-1022

C. E. Lemke, H. M. Salkin and K. Spielberg

A Note on Extreme-Point Solutions and A Paper by Lemke, Salkin, and Spielberg pp. 1023-1025

Fred Glover

Nonlinear Pricing: Applications to Concave Programming pp. 1026-1035

F. J. Gould

A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming Problems pp. 1036-1044

Ronald E. Davis, David Kendrick and Martin Weitzman

Classical Derivation of the Necessary and Sufficient Conditions for Optimal Linear Programs pp. 1045-1050

Hamdy A. Taha and Guy L. Curry

A Modified Linear Program for Columnar Methods in Mathematical Programming pp. 1051-1060

G. L. Nemhauser and W. B. Widhelm

Comments on Integer Hulls of Two Linear Constraints pp. 1061-1069

R. G. Jeroslow

Technical Note—An Improved Branch-and-Bound Method for Integer Programming pp. 1070-1075

J. A. Tomlin

Technical Note—On Converse Duality in Nonlinear Programming pp. 1075-1078

B. D. Craven and B. Mond

Technical Note—A Note on Extended GLM pp. 1079-1080

J. P. Evans, F. J. Gould and S. M. Howe

Technical Note—Undiscounted Markov Renewal Programming Via Modified Successive Approximations pp. 1081-1089

Thomas E. Morton

Technical Note—Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks pp. 1090-1096

C. R. Baugh, T. Ibaraki and S. Muroga

Technical Note—A Unified Nonlinear Duality Formulation pp. 1097-1100

M. S. Bazaraa, J. J. Goode and C. M. Shetty

Technical Note—Cyclic Dynamic Programming: A Procedure for Problems with Fixed Delay pp. 1101-1110

David G. Luenberger

Volume 19, issue 3, 1971

Search Detection and Subsequent Action: Some Problems on the Interfaces pp. 559-586

Stephen M. Pollock

A Method for Evaluating the Combat Effectiveness of a Tactical Information System in a Field Army pp. 587-604

Roland V. Tiede and Lewis A. Leake

Optimal Allocation of Missiles Against Area and Point Defenses pp. 605-617

Frederic A. Miercort and Richard M. Soland

An Evaluator for the Number of Operationally Ready Aircraft in a Multilevel Supply System pp. 618-635

Craig C. Sherbrooke

A Computational Procedure for a Class of Coverage Problems for Multiple Shots pp. 636-644

Harold J. Breaux and Lynn S. Mohler

Approximation Procedures and Some Key Results for Estimating Expected Target Damage pp. 645-654

Frank E. Grubbs, Harold J. Breaux and Helen J. Coon

Expected Target Damage for Pattern Firing pp. 655-667

Charles N. Bressel

On the Computation of Hit Probability pp. 668-684

Hermann Josef Helgert

Optimal Sequential Aim Corrections for Attacking a Stationary Point Target pp. 685-697

Jack Nadler and Joan Eilbott

Attrition Rates for Weapons with Markov-Dependent Fire pp. 698-706

Stephen R. Kimbleton

Technical Note—Threshold Probabilities when Searching for a Moving Target pp. 707-709

Paul J. Schweitzer

Technical Note—A Note on the Solution to Lanchester-Type Equations with Variable Coefficients pp. 709-712

James G. Taylor

Letter to the Editor—Military Intelligence Analysis in Lilliput pp. 713-721

Robert L. Bovey

Queuing Problems with Heterogeneous Arrivals and Service pp. 722-734

U. Yechiali and P. Naor

On One-For-One-Ordering Inventory Policies with State-Dependent Leadtimes pp. 735-760

Donald Gross and Carl M. Harris

Stationary Properties of a Two-Echelon Inventory Model for Low Demand Items pp. 761-773

R. M. Simon

Stability in Noncooperative Games pp. 774-783

J. B. Williams

Multiple Policy Improvements in Undiscounted Markov Renewal Programming pp. 784-793

Paul J. Schweitzer

Cost Minimization in Networks with Discrete Stochastic Requirements pp. 794-821

Michael M. Connors and Willard I. Zangwill

Optimal Advertising-Expenditure Implications of a Simultaneous-Equation Regression Analysis pp. 822-831

Leonard J. Parsons and Frank M. Bass

Volume 19, issue 2, 1971

Robbery and Assault of Bus Drivers pp. 257-269

Paul Gray

A Class of Sequential Games pp. 270-277

David A. Kohler and R. Chandrasekaran

Pathology of Traveling-Salesman Subtour-Elimination Algorithms pp. 278-307

Mandell Bellmore and John C. Malone

Chebyshev Optimal Waste Discharges pp. 308-322

Matthew J. Sobel

Divisible and Movable Activities in Critical-Path Analysis pp. 323-348

William S. Jewell

On Optimal Balking Rules and Toll Charges in the GI / M /1 Queuing Process pp. 349-370

Uri Yechiali

An Analysis of the M / G /1 Queue Under Round-Robin Scheduling pp. 371-385

M. Sakata, S. Noguchi and J. Oizumi

Two Queues with Changeover Times pp. 386-401

Martin Eisenberg

Some Inequalities for Parallel-Server Queues pp. 402-413

Shelby L. Brumelle

An Exact Comparison of the Waiting Times Under Three Priority Rules pp. 414-423

S. Sreekantan Nair and Marcel F. Neuts

On a Single-Server Finite Queuing Model with State-Dependent Arrival and Service Processes pp. 424-435

P. J. Courtois and J. Georges

A Stochastic System with Scheduled Secondary Inputs pp. 436-446

İzzet Şahin and U. Narayan Bhat

On the Growth of the Maximum Queue Length in a Stable Queue pp. 447-452

C. C. Heyde

Priority Queues with Random Order of Service pp. 453-460

L. Durr

Bounds for a Dynamic-Priority Queue pp. 461-468

J. M. Holtzman

Some Multi-Contract Decision-Theoretic Competitive Bidding Models pp. 469-483

Robert M. Stark and Robert H. Mayer

Competitive Bidding: A Comprehensive Bibliography pp. 484-490

Robert M. Stark

Design Commonality to Reduce Multi-Item Inventory: Optimal Depth of a Product Line pp. 491-509

David P. Rutenberg

On a Two-Unit Standby Redundant System with Standby Failure pp. 510-523

Shunji Osaki and Toshio Nakagawa

Computing the Expected End-Product Service Time Using Stochastic Item Delays pp. 524-540

Marshall Rose

Technical Note—Operations Research on Football pp. 541-544

Virgil Carter and Robert E. Machol

Technical Note—Optimization of the Capacity in a Storage System pp. 544-548

S. G. Loo and A. Ghosal

Technical Note—An Integer Maximization Problem pp. 548-550

Richard E. Schwartz and Clive L. Dym

Errata pp. 550-550

L. G. Mitten

Volume 19, issue 1, 1971

The Bounding Hyperplane Method of Linear Programming pp. 1-18

C. P. Saksena and A. J. Cole

Intersection Cuts—A New Type of Cutting Planes for Integer Programming pp. 19-39

Egon Balas

An Intersection Cut from the Dual of the Unit Hypercube pp. 40-44

Egon Balas, V. Joseph Bowman, Fred Glover and David Sommer

Dynamic Linear Programs for Production Scheduling pp. 45-56

C. Roger Glassey

A Class of Fractional Programming Problems pp. 57-67

Y. Almogy and O. Levin

Generalized Lagrange Multipliers in Integer Programming pp. 68-76

Jeremy F. Shapiro

Optimality Criteria in Nonlinear Programming Without Differentiability pp. 77-86

M. S. Bazaraa, J. J. Goode and C. M. Shetty

Quadratic Programming with a Quasiconvex Objective Function pp. 87-97

Béla Martos

Vector-Valued Criteria in Geometric Programming pp. 98-104

Luis D. Pascual and Adi Ben-Israel

On the Objective Function for the Sequential P-Model of Chance-Constrained Programming pp. 105-114

Robert S. Kaplan and John V. Soden

Technical Note—A Flexible Tree-Search Method for Integer Programming Problems pp. 115-119

Nghiem Ph. Tuan

Technical Note—“Linear” Programming with Absolute-Value Functionals pp. 120-124

David F. Shanno and Roman L. Weil

Technical Note—The Optimal Location of New Facilities Using Rectangular Distances pp. 124-130

G. O. Wesolowsky and R. F. Love

Technical Note—An Integer Approach to Modular Design pp. 130-134

Tim Shaftel

A Computer-Based System for Forming Efficient Election Districts pp. 135-155

E. S. Savas

The One-Terminal TELPAK Problem pp. 156-169

B. Rothfarb and M. Goldstein

A Single-Shot Noisy Duel with Detection Uncertainty pp. 170-181

Calvin W. Sweat

A Model for Allocating Interceptors from Overlapping Batteries: A Method of Dynamic Programming pp. 182-193

G. E. Swinson, P. H. Randolph, B. J. Dunn, M. E. Walker and R. D. Williams

An Optimal Rejection Time for an M / G /1 Queuing System pp. 194-207

Hisashi Mine and Katsuhisa Ohno

Characterization and Computation of Optimal Policies for Operating an M / G /1 Queuing System with Removable Server pp. 208-218

Colin E. Bell

The Remaining Busy Period of a Finite Queue pp. 219-223

Terrell J. Harris

Technical Note—A Taxonomy for Operations Research pp. 224-234

Russell W. Fenske

Technical Note—An Algorithm to Find Elementary Negative-Cost Circuits with a Given Number of Arcs—The Traveling-Salesman Problem pp. 234-237

J. P. Netter

Technical Note—Minimizing a Function of Permutations of n Integers pp. 237-240

John G. Rau

Technical Note—Bounds on the Gain of a Markov Decision Process pp. 240-244

N. A. J. Hastings

Technical Note—On the Asymptotic Convergence Rate of Cost Differences for Markovian Decision Processes pp. 244-248

Thomas E. Morton

Technical Note—A Further Note on One-Dimensional Space Allocation pp. 249-249

Donald M. Simmons

The 1970 Lanchester Prize---Call for Nominations pp. 255-255

Joseph H. Engel