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 27, issue 6, 1979

Interior Path Methods for Heuristic Integer Programming Procedures pp. 1069-1087

Bruce H. Faaland and Frederick S. Hillier

A Dynamic Priority Queue with General Concave Priority Functions pp. 1088-1100

A. Netterman and I. Adiri

New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem pp. 1101-1114

Richard Loulou and Eleftherios Michaelides

Approximations of the Mean Waiting Time in an M / G / s Queueing System pp. 1115-1127

O. J. Boxma, J. W. Cohen and N. Huffels

A Method of Decomposition for Integer Programs pp. 1128-1141

Dennis J. Sweeney and Richard A. Murphy

Bayes Estimation of Reliability Using an Estimated Prior Distribution pp. 1142-1157

W. J. Padgett and Chris P. Tsokos

The Age Replacement Problem with Minimal Repair and Random Repair Costs pp. 1158-1167

R. Cléroux, S. Dubuc and C. Tilquin

Qualitative Properties and Bounds for the Serial Covariances of Waiting Times in Single-Server Queues pp. 1168-1179

Reinhard Bergmann

Technical Note—Minisum I p Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm pp. 1180-1188

James G. Morris and William A. Verdini

Technical Note—A Generalized Maximum Entropy Principle pp. 1188-1196

Marlin U. Thomas

Technical Note—Response Time Distribution of the M / M / m / N Queueing Model pp. 1196-1202

J. W. Wong

Technical Note—An Adjustment to the Norman-White Approach to Approximating Dynamic Programs pp. 1203-1208

Evan L. Porteus

Technical Note—Approximations for Overflows from Queues with a Finite Waiting Room pp. 1208-1216

John H. Rath and Diane Sheng

Volume 27, issue 5, 1979

A Mathematical Programming Model for Allocation of Natural Gas pp. 857-873

Richard P. O'Neill, Mark Williard, Bert Wilkins and Ralph Pike

Algorithms and Planning Horizon Results for Production Planning Problems with Separable Costs pp. 874-887

Paul R. Kleindorfer and Zvi Lieber

Stochastic Models for Pensionable Service pp. 888-903

Izzet Sahin and Yves Balcer

Simple Approximations for a Variety of Dynamic Leadtime Lost-Sales Inventory Models pp. 904-924

Steven Nahmias

Preemptive Scheduling with Due Dates pp. 925-934

Sartaj Sahni

A Multi-Type Production System for Perishable Inventories pp. 935-943

Bryan L. Deuermeyer

The Effect of Long Term Dependence on Risk-Return Models of Common Stocks pp. 944-951

Myron T. Greene and Bruce D. Fielitz

Some Layout Problems on the Line with Interdistance Constraints and Costs pp. 952-971

Albert W. Chan and Richard L. Francis

Location Dominance on Spherical Surfaces pp. 972-981

Adel A. Aly, David C. Kay and Daniel W. Litwhiler

A Branch-and-Bound Method for Reversed Geometric Programming pp. 982-996

Willy Gochet and Yves Smeers

Variance Reduction for Population Growth Simulation Models pp. 997-1010

George S. Fishman

A Sequential Procedure for Determining the Length of a Steady-State Simulation pp. 1011-1025

Averill M. Law and John S. Carson

Simulation of Nonhomogeneous Poisson Processes with Degree-Two Exponential Polynomial Rate Function pp. 1026-1040

P. A. W. Lewis and G. S. Shedler

Structural Results for Partially Observable Markov Decision Processes pp. 1041-1053

S. Christian Albright

Consistent Assessment Procedures Using Conditional Utility Functions pp. 1054-1066

David E. Bell

Volume 27, issue 4, 1979

Feature Article—Aggregate Advertising Models: The State of the Art pp. 629-667

John D. C. Little

Markov Models of Advertising and Pricing Decisions pp. 668-681

S. Christian Albright and Wayne Winston

Optimizing Advertising Expenditures in a Dynamic Duopoly pp. 682-692

Kenneth R. Deal

A Queueing Theory, Bayesian Model for the Circulation of Books in a Library pp. 693-716

Philip M. Morse

On the Stationary Analysis of Continuous Review ( s, S ) Inventory Systems with Constant Lead Times pp. 717-729

Izzet Sahin

Infinite-Horizon Dynamic Programming Models—A Planning-Horizon Formulation pp. 730-742

Thomas E. Morton

Bounding Global Minima with Interval Arithmetic pp. 743-754

Louis J. Mancini and Garth P. McCormick

The Sum of Serial Correlations of Waiting and System Times in GI / G /1 Queues pp. 755-766

B. Pagurek and C. M. Woodside

Queues Solvable without Rouché's Theorem pp. 767-781

Marcel F. Neuts

The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations pp. 782-791

Jeffrey B. Sidney

The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions pp. 792-798

Clyde L. Monma

An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit pp. 799-809

M. L. Fisher, G. L. Nemhauser and L. A. Wolsey

Measurable Multiattribute Value Functions pp. 810-822

James S. Dyer and Rakesh K. Sarin

Computing Network Reliability pp. 823-838

Michael O. Ball

Technical Note—A Note on the Nerlove-Arrow Model under Uncertainty pp. 839-842

Suresh Sethi

Technical Note—Constraint Qualifications for Inexact Linear Programs pp. 843-847

J. Ch. Pomerol

Letter to the Editor—Comments on the Possibility of Cycling with the Simplex Method pp. 848-852

Saul I. Gass

Letter to the Editor—To the Editor pp. 852-852

S. S. Nair

Letter to the Editor—To the Editor pp. 852-854

W. Karl Kruse

Errata pp. 854-854

T. M. O'Donovan

Volume 27, issue 3, 1979

The Status of Nonlinear Programming Software pp. 431-456

Allan D. Waren and Leon S. Lasdon

Solving Nonlinear Programs Without Using Analytic Derivatives pp. 457-484

Jerrold H. May

Two-Period Stochastic Programs with Simple Recourse pp. 485-502

R. Everitt and W. T. Ziemba

The Multiple-Choice Knapsack Problem pp. 503-515

Prabhakant Sinha and Andris A. Zoltners

The Indefinite Quadratic Programming Problem pp. 516-533

Paul F. Kough

On the Storage and Handling of Binary Data Using FORTRAN with Applications to Integer Programming pp. 534-547

Joseph S. Graves

Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound pp. 548-566

Eric V. Denardo and Bennett L. Fox

A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion pp. 567-582

John Freidenfelds and C. D. McLaughlin

Stochastic Control of Competition Through Prices pp. 583-594

S. D. Deshmukh and Wayne Winston

An Iterative Solution of Two-Dimensional Birth and Death Processes pp. 595-605

Alexandre Brandwajn

Estimation of Parameters of Zero-One Processes by Interval Sampling: An Adaptive Strategy pp. 606-615

M. Brown, H. Solomon and M. A. Stephens

Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes pp. 616-620

Richard F. Serfozo

Technical Note—An Improved Computational Procedure for Optimal Allocation of Aircraft Sorties pp. 621-627

Eleanor L. Schwartz

Volume 27, issue 2, 1979

Feature Article—Changing the Future of Operations Research pp. 209-224

Seth Bonder

A Dynamic Programming Algorithm for Decision CPM Networks pp. 225-241

Thomas J. Hindelang and John Muth

Information Systems for Observing Inventory Levels pp. 242-259

Edward A. Stohr

On Optimal Utilization of Production Processes pp. 260-278

Dov Pekelman

A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs pp. 279-289

Edward P. C. Kao

A Production Scheduling Problem in the Glass-Container Industry pp. 290-302

R. J. Paul

Optimal Inspection Schedules for Failure Detection in a Model Where Tests Hasten Failures pp. 303-317

N. Wattanapanom and L. Shaw

A Simple Method for Reducing Queuing Times in M/G/1 pp. 318-323

D. E. Matthews

The Sharing Problem pp. 324-340

J. Randall Brown

The Knapsack Sharing Problem pp. 341-355

J. Randall Brown

Multidimensional Line Search Using a Binary Preference Relation pp. 356-363

Donald Wehrung

Competitive Bidding: A Comprehensive Bibliography pp. 364-390

Robert M. Stark and Michael H. Rothkopf

Technical Note—The EOQ Model under Stochastic Lead Time pp. 391-396

Matthew J. Liberatore

Technical Note—Average Costs in a Continuous Review ( s, S ) Inventory System with Exponentially Distributed Lead Time pp. 396-401

J. Wijngaard and E. G. F. Van Winkel

Technical Note—On the Estimation of Convex Functions pp. 401-407

Charles A. Holloway

Technical Note—Bibliography of Operations Research in Health-Care Systems: An Update pp. 408-419

Brant E. Fries

Letter to the Editor—Engineering Design and Operations Research pp. 420-422

Albert G. Holzman

Volume 27, issue 1, 1979

Feature Article—Energy Policy Modeling: A Survey pp. 1-36

Alan Manne, Richard G. Richels and John P. Weyant

Optimal Structures and Maintenance Policies for PABX Power Systems pp. 37-47

Goor Vered and Uri Yechiali

Evaluation of Proposed Storage Sites pp. 48-64

Ralph L. Keeney

Analysis of a Single-Buffer Loss-Delay System pp. 65-79

E. Arthurs and B. W. Stuck

Criteria for Proportional Representation pp. 80-95

Michel Balinski and H. P. Young

Optimal Commitment of Forces in Some Lanchester-Type Combat Models pp. 96-114

James G. Taylor

An Operational Critique of Detection Laws pp. 115-133

B. O. Koopman

Concomitant Control Variables Applied to the Regenerative Simulation of Queuing Systems pp. 134-160

S. S. Lavenberg, T. L. Moeller and C. H. Sauer

Shortest-Route Methods: 1. Reaching, Pruning, and Buckets pp. 161-186

Eric V. Denardo and Bennett L. Fox

Technical Note—Exact Solution for the Bradford Distribution and Its Use in Modeling Informational Data pp. 187-198

Philip M. Morse and Ferdinand F. Leimkuhler

Technical Note—Estimating the Probability Distribution of Travel Times for Urban Emergency Service Systems pp. 199-204

Kenneth Chelst and James P. Jarvis

Technical Note—The Busy Probability in M/G/N Loss Systems pp. 204-206

J. S. Kaufman

Errata pp. 207-207

Thomas M. Cover