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 24, issue 6, 1976

Sequential Bounding of the Reliability of a Stochastic Network pp. 1027-1044

Andrew W. Shogan

The Simple Plant-Location Problem under Uncertainty pp. 1045-1055

James V. Jucker and Robert C. Carlson

Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code pp. 1056-1077

D. Karney and D. Klingman

A Research Bibliography in Stochastic Programming, 1955–1975 pp. 1078-1119

I. M. Stancu-Minasian and M. J. Wets

Comparison of Some Algorithms for Solving the Group Theoretic Integer Programming Problem pp. 1120-1128

Chen Der-San and Stanley Zionts

The Assortment Problem with Nonlinear Cost Functions pp. 1129-1142

David W. Pentico

Analysis of a Standing Order Inventory System with Emergency Orders pp. 1143-1155

Matthew Rosenshine and Duncan Obee

Technical Note—On the Estimation of Smuggling in a “Gray Market” Commodity pp. 1156-1163

Michael D. Maltz

Technical Note—Shortest-Path Algorithms: A Comparison pp. 1164-1168

Bruce Golden

Technical Note—Surrogate Constraints and the Strength of Bounds Derived from 0-1 Benders' Partitioning Procedures pp. 1169-1175

Ronald L. Rardin and V. E. Unger

Technical Note—On Mitten's Axioms for Branch-and-Bound pp. 1176-1178

A. H. G. Rinnooy Kan

Letter to the Editor—A Comment on “Optimal Doubling in Backgammon” pp. 1179-1179

P. J. Orth

Volume 24, issue 5, 1976

Preface pp. 797-798

William P. Pierskalla and Glen L. Urban

Bibliography of Operations Research in Health-Care Systems pp. 801-814

Brant E. Fries

Analytic Framework and Measurement Strategy for Investigating Optimal Staffing in Medical Practice pp. 815-841

Kenneth R. Smith, A. Over, Marc F. Hansen, Frederick L. Golladay and Esther J. Davenport

Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach pp. 842-856

D. Michael Warner

Nurse Scheduling Using Mathematical Programming pp. 857-870

Holmes E. Miller, William P. Pierskalla and Gustave J. Rath

A Two-Stage Optimization Model for In-Patient Transfers pp. 871-883

Manus Rabinowitz, M. Barry Dumas and David Valinsky

A Stochastic Model for an Optimal Priority Bed Distribution Problem in a Hospital Ward pp. 884-898

Augustine O. Esogbue and Amar J. Singh

Selecting Optimal Training Programs in a Hospital for the Mentally Retarded pp. 899-915

Jack Meredith

Markov Chain Model for Events Following Induced Abortion pp. 916-932

Richard H. Shachtman and Carol J. Hogue

Application of Multidimensional Utility Theory in Determining Optimal Test-Treatment Strategies for Streptococcal Sore Throat and Rheumatic Fever pp. 933-950

William C. Giauque and Thomas C. Peebles

Utility Structure of a Medical Decision-Making Problem pp. 951-972

Jeffrey P. Krischer

Analytical Approach to Marketing Decisions in Health-Care Organizations pp. 973-990

Yoram Wind and Lawrence K. Spitz

A Consumer Preference Approach to the Planning of Rural Primary Health-Care Facilities pp. 991-1025

Barnett Parker and V. Srinivasan

Volume 24, issue 4, 1976

Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/ LP Approach pp. 595-610

A. M. Geoffrion and G. W. Graves

Branch-and-Bound Strategies for Dynamic Programming pp. 611-627

Thomas L. Morin and Roy E. Marsten

Convex Location Problems on Tree Networks pp. 628-642

P. M. Dearing, R. L. Francis and T. J. Lowe

Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints pp. 643-657

Richard E. Wendell and Arthur P. Hurter

Minimizing the Cost of Servicing an End Product Subject to a Completion Time Constraint pp. 658-674

James E. Falk and Marshall Rose

Duality and Sensitivity Analysis for Fractional Programs pp. 675-699

Gabriel R. Bitran and Thomas L. Magnanti

A Cotton Ginning Problem pp. 700-717

Darwin Klingman, Paul H. Randolph and Stephen W. Fuller

On a General Solution of the Deterministic Lot Size Problem with Time-Proportional Demand pp. 718-725

Michael Resh, Moshe Friedman and Lineu C. Barbosa

Analysis of Single Critical Number Ordering Policies for Perishable Inventories pp. 726-741

Morris A. Cohen

An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks pp. 742-759

V. Balachandran

The M / M /∞ Queue with Varying Arrival and Departure Rates pp. 760-773

T. Collings and C. Stoneman

Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem pp. 774-783

J. Erschler, F. Roubellat and J. P. Vernhes

Technical Note—Exact Solutions of Inexact Linear Programs pp. 783-787

James E. Falk

Technical Note—The Shirt Allocation Problem pp. 788-792

Paul Gray

Technical Note—A Reduced Tableau for Primal Integer Programming pp. 793-795

Julie Herman Zalkind

Volume 24, issue 3, 1976

Manpower Planning with Uncertain Requirements pp. 387-399

Richard C. Grinold

Dynamic Modeling and Control of Congestion-Prone Systems pp. 400-419

Carson E. Agnew

Aircraft Missile Avoidance pp. 420-437

Thomas L. Vincent, Douglas J. Sticht and Willy Y. Peng

On Searching for Events of Limited Duration pp. 438-451

Arnold Barnett

Duality in Fractional Programming: A Unified Approach pp. 452-461

Siegfried Schaible

Rates of Stability in Nonlinear Programming pp. 462-476

Michael H. Stern and Donald M. Topkis

Countable-State, Continuous-Time Dynamic Programming with Structure pp. 477-490

Steven A. Lippman

Incorporating Component and System Test Data into the Same Assessment: A Bayesian Approach pp. 491-499

David V. Mastran

Probabilistic Analysis of a Multicomponent Series-Parallel System under Preemptive Repeat Repair Discipline pp. 500-515

Masanori Kodama

Cyclic Queue Models of Fleet Operations pp. 516-529

Ernest Koenigsberg and Richard C. Lam

On the Output of a GI / M / N Queuing System with Interrupted Poisson Input pp. 530-542

Harry Heffes

Busy Period Control of Queues Based on Waiting Times at Arrivals pp. 543-563

Leonard Shaw

On the Busy Periods of Single-Server Queues with Poisson Input and General Service Times pp. 564-571

Lajos Takács

Technical Note—Optimal Initial Conditions for a Simulation Problem pp. 572-577

Albert Madansky

Technical Note—Johnson's Three-Machine Flow-Shop Conjecture pp. 578-580

Fennell Burns and John Rooker

Technical Note—Stronger Inequalities for 0-1 Integer Programming: Computational Refinements pp. 581-585

Ferydoon Kianfar

Technical Note—Probability of Kill and Expected Destroyed Value if the Underlying Distributions Are Rotationally Symmetric pp. 586-591

Gerhard Schroeter

Letter to the Editor—Acknowledgment pp. 592-592

Cyrus Derman and Edward Ignall

Volume 24, issue 2, 1976

Random Juror Selection from Multiple Lists pp. 207-219

Joseph B. Kadane and John P. Lehoczky

An Actual Application of Collective Choice Theory to the Selection of Trajectories for the Mariner Jupiter/Saturn 1977 Project pp. 220-244

James S. Dyer and Ralph F. Miles

Utility Independence on Subsets of Product Sets pp. 245-255

Peter C. Fishburn

Pyramid and Semicube Decompositions of Multiattribute Utility Functions pp. 256-271

Peter H. Farquhar

Network Flows, Minimum Coverings, and the Four-Color Conjectures pp. 272-290

David B. Weinberger

Optimal Capacity Expansion with Inventory pp. 291-300

M. R. Rao

An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks pp. 301-313

John Hultz, Darwin Klingman and Robert Russell

Ambushing Random Walks I: Finite Models pp. 314-324

William Ruckle, Robert Fennell, Paul T. Holmes and Charles Fennemore

Consistency, Superconsistency, and Dual Degeneracy in Posynomial Geometric Programming pp. 325-335

Robert A. Abrams

Stochastic Programs with Incomplete Information pp. 336-347

Aharon Ben-Tal and Eithan Hochman

Procedures for the Solution of a Finite-Horizon, Partially Observed, Semi-Markov Optimization Problem pp. 348-358

Chelsea C. White

Maintenance Policies When Deterioration Can be Observed by Inspections pp. 359-366

Hanan Luss

Technical Note—Facets and Strong Valid Inequalities for Integer Programs pp. 367-372

Laurence A. Wolsey

Technical Note—The Silver Anniversary of an Optimization Result in Rolling-Mill Practice pp. 373-378

H. M. Finucan

Technical Note—A Simple Concavity Condition for a Class of Chance-Constrained Programming Problems with Joint Constraints pp. 378-380

V. S. Bawa

Technical Note—An Application of Martingale Methods to Conflict Models pp. 380-382

R. K. Watson

Technical Note—Conditional Response Times in M / M /1 Processor-Sharing Models pp. 382-385

T. M. O'Donovan

Volume 24, issue 1, 1976

A Model for Allocating Retail Outlet Building Resources across Market Areas pp. 1-14

Gary L. Lilien and Ambar G. Rao

A Solution Procedure for Geometric Programming pp. 15-25

John R. McNamara

Confidence Assessment of Military Airframe Cost Predictions pp. 26-43

Dennis P. Tihansky

Canonical Methods in the Solution of Variable-Coefficient Lanchester-Type Equations of Modern Warfare pp. 44-69

James G. Taylor and Gerald G. Brown

A Lagrange Multiplier Method for Certain Constrained Min-Max Problems pp. 70-91

Edward S. Pearsall

Parametrically Dependent Preferences for Multiattributed Consequences pp. 92-103

Craig W. Kirkwood

An N -Server Stochastic Service System with Customer Preferences pp. 104-117

P. Lawrence Bein

A Stochastic Model of a Repairable-Item Inventory System with Attrition and Random Lead Times pp. 118-130

F. Russell Richards

An Analysis of General Exponential Smoothing pp. 131-140

Ed. McKenzie

Markovian Deterioration with Uncertain Information pp. 141-155

Donald Rosenfield

Bayes Analysis of Reliability for Complex Systems pp. 156-168

Eugene Y. Chang and William E. Thompson

Reliability of a Repairable System with Standby Failure pp. 169-176

R. Subramanian, K. S. Venkatakrishnan and K. P. Kistner

Technical Note—Expected Completion Time in Pert Networks pp. 177-182

Pierre Robillard and Michel Trahan

Technical Note—Sufficient Conditions for Insensitivity in Linear Models pp. 183-188

Robert Rosenthal

Technical Note—A Single-Server Queue with Service Times Depending on the Order of Services pp. 188-190

Hisashi Mine, Katsuhisa Ohno and Takatsugu Koizumi

Technical Note—A “Hard” Assignment Problem pp. 190-192

Robert E. Machol and Michael Wien

Technical Note—Optimality of a Heuristic Solution for a Class of Knapsack Problems pp. 193-196

T. C. Hu and M. L. Lenard

Technical Note—On the Comparison of Waiting Times in GI / G /1 Queues pp. 197-200

Tomasz Rolski and Dietrich Stoyan

Technical Note—Statistical Measures for Linear Functions on Polytopes pp. 201-204

Johnnie R. Charnetski and Richard M. Soland