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 17, issue 6, 1969

Systems Analysis for Social Decisions pp. 927-940

Joseph L. Bower

Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm pp. 941-957

Egon Balas

Production Allocation with Set-Up Penalties and Concave Material Costs pp. 958-972

Charles H. White

A New Method for Constrained Optimization Problems pp. 973-983

J. Kowalik, M. R. Osborne and D. M. Ryan

A Problem in Optimal Search and Stop pp. 984-992

Sheldon M. Ross

A Probabilistic Approach to Solving Assignment Problems pp. 993-1004

Mehmet I. Celebiler

Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem pp. 1005-1016

Graciano Sá

A Graph-Theoretic Approach to a Class of Integer-Programming Problems pp. 1017-1033

J. F. Desler and S. L. Hakimi

A Dynamic Programming Algorithm for Cluster Analysis pp. 1034-1057

Robert E. Jensen

Some Conditions for Ergodicity and Recurrence of Markov Chains pp. 1058-1061

A. G. Pakes

On a Class of Queuing Problems and Discrete Transforms pp. 1062-1076

S. Subba Rao and N. K. Jaiswal

A Time-Sharing Model with Many Queues pp. 1077-1089

I. Adiri and B. Avi-Itzhak

Volume 17, issue 5, 1969

Brains and Personality pp. 761-769

Joseph H. Engel

Macro-Analysis of the American Educational System pp. 770-784

Alex M. Mood

Experimental Design and Simulation in Unloading Ships by Helicopter pp. 785-799

Robert McQuie

A Model of Adaptive Team Decision pp. 800-811

Charles C. Ying

One-Dimensional Space Allocation: An Ordering Algorithm pp. 812-826

Donald M. Simmons

System Availability and Some Design Implications pp. 827-837

Irwin W. Kabak

Optimal Redundancy for Reliability in Series Systems pp. 838-847

P. M. Ghare and R. E. Taylor

The Set-Partitioning Problem: Set Covering with Equality Constraints pp. 848-856

R. S. Garfinkel and G. L. Nemhauser

On Finding the Maximal Gain for Markov Decision Processes pp. 857-860

Amedeo R. Odoni

Probability Density of a Moving Particle pp. 861-871

Alan Washburn

Constrained Nonlinear Optimization by Heuristic Programming pp. 872-882

D. A. Paviani and D. M. Himmelblau

Closure of the Right-Hand-Side Set for Systems of Nonlinear Inequalities pp. 883-887

F. J. Gould and H. Pashner

The Lanchester Attrition-Rate Coefficient: Some Comments on Seth Bonder's Paper and a Suggested Alternate Method pp. 888-894

C. B. Barfoot

A Force Effectiveness Model with Area Defense of Targets pp. 895-906

A. Kooharian, N. Saber and H. Young

GI / M /1 Priority Queue pp. 907-910

W. Henderson

Letter to the Editor—Educational Planning in Developing Countries—A Possible Role for Operations Research pp. 911-915

Richard M. Durstine and Russell G. Davis

Letter to the Editor—A Simpler Proof of L = λ W pp. 915-917

Samuel Eilon

Letter to the Editor—Computational Experience with a Zero-One Programming Problem pp. 917-920

Horst Steinmann and Rolf Schwinn

Letter to the Editor—Criterion Equivalence in Discrete Dynamic Programming pp. 920-922

Steven A. Lippman

Letter to the Editor—A Comparison of Estimates of Nuclear Bomb Casualties from Two Different Urban Models pp. 923-925

C. A. Wilkins, J. A. Shaw and A. Keane

Volume 17, issue 4, 1969

Medium-Range Scheduling for a Freighter Fleet pp. 565-582

C. A. Olson, E. E. Sorenson and W. J. Sullivan

Shortest Paths in Probabilistic Graphs pp. 583-599

H. Frank

Efficient Heuristic Procedures for Integer Linear Programming with an Interior pp. 600-637

Frederick S. Hillier

A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables pp. 638-679

Frederick S. Hillier

On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints pp. 680-684

M. Raghavachari

On Assembly-Line Balancing Problems pp. 685-700

Raymond Reiter

One-Machine Sequencing to Minimize Certain Functions of Job Tardiness pp. 701-715

Hamilton Emmons

Perturbation Theory and Undiscounted Markov Renewal Programming pp. 716-727

Paul J. Schweitzer

A Mixed-Priority Queue with Applications to the Analysis of Real-Time Systems pp. 728-742

Linus Schrage

Letter to the Editor—Computational Results of an Integer Programming Algorithm pp. 743-749

Patrick D. Krolak

Letter to the Editor—An Approach to Some Structured Linear Programming Problems pp. 749-750

John M. Bennett and David R. Green

Letter to the Editor—A Critique of the Norman-White Dynamic Programming Approximation pp. 751-753

Thomas E. Morton

Letter to the Editor—The Dependence of Sojourn Times in Tandem M/M/S Queues pp. 754-755

P. J. Burke

Letter to the Editor—A Note on Multicommodity Max-Flow pp. 755-755

Richard C. Grinold

Errata pp. 756-756

R. D. Smith and R. A. Dudek

Volume 17, issue 3, 1969

Cost-Effectiveness in Urban Transportation pp. 373-394

Edward N. Dodson

An Appraisal of Some Shortest-Path Algorithms pp. 395-412

Stuart E. Dreyfus

Information Analysis Without States of the World pp. 413-424

Peter C. Fishburn

A Computationally Compact Sufficient Condition for Constrained Minima pp. 425-436

G. Reklaitis and D. J. Wilde

An Improved Implicit Enumeration Approach for Integer Programming pp. 437-454

A. M. Geoffrion

Computer Solutions to Minimum-Cover Problems pp. 455-465

R. Roth

A Priority Rule Based on the Ranking of the Service Times for the M / G /1 Queue pp. 466-477

S. Sreekantan Nair and Marcel F. Neuts

A Duel Involving False Targets pp. 478-488

Calvin W. Sweat

Minimization of Fatalities in a Nuclear Attack Model pp. 489-505

Guillermo Owen

A Multiserver Queue with Enforced Idle Times pp. 506-518

L. E. N. Delbrouck

Some Waiting-Time Distributions for Queues with Multiple Feedback and Priorities pp. 519-525

E. G. Enns

Preemptive Priority Assignment in Multichannel Systems pp. 526-535

Israel Brosh

Letter to the Editor—Availability of Renewal Functions for Gamma and Weibull Distributions with Increasing Hazard Rate pp. 536-543

Richard M. Soland

Letter to the Editor—Some Comments on the Traveling Salesman Problem pp. 543-546

Akkanad M. Isaac and Efraim Turban

Letter to the Editor—Finding Minimal Cost-Time Ratio Circuits pp. 546-551

Bennett Fox

Letter to the Editor—Binomial Distribution Sample-Size Nomogram pp. 551-553

S. Matlin

Volume 17, issue 2, 1969

Models of a Total Criminal Justice System pp. 199-232

Alfred Blumstein and Richard Larson

Pseudo-Boolean Programming pp. 233-261

Peter L. Hammer and Sergiu Rudeanu

Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems pp. 262-291

Arthur F. Veinott

Optimal Strategies for Divestiture pp. 292-310

R. H. Hayes

Maintenance and Operating Characteristics of Communication Networks pp. 311-336

Kenji Onaga

Optimum Allocation of Stand-by Systems pp. 337-343

M. N. Bhattacharyya

Sensitivity of Bayes Procedures to the Prior Distribution pp. 344-350

Donald A. Pierce and J. Leroy Folks

A Single-Server Priority Queuing System with General Holding Times, Poisson Input, and Reverse-Order-of-Arrival Queuing Discipline pp. 351-358

L. Durr

Letter to the Editor—Toward a Unifying Theory for Integer Linear Programming pp. 359-367

Stanley Zionts

Letter to the Editor—A Method for Obtaining the Optimal Dual Solution to a Linear Program Using the Dantzig-Wolfe Decomposition pp. 368-370

Warren E. Walker

Volume 17, issue 1, 1969

A Media Planning Calculus pp. 1-35

John D. C. Little and Leonard M. Lodish

A Probabilistic Model for Obsolescence pp. 36-47

Philip M. Morse and Caroline Elston

A Class of Discrete-Time Models for the Study of Hospital Admission Systems pp. 48-69

J. F. Bithell

Event Classification pp. 70-84

Robert T. Nash

Algorithms for the Simple Plant-Location Problem with Some Side Conditions pp. 85-111

Kurt Spielberg

Safety-First Rules under Chance-Constrained Linear Programming pp. 112-132

J. K. Sengupta

Smoothing Start-Up and Shut-Down Costs in Sequential Production pp. 133-144

Matthew J. Sobel

Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs pp. 145-162

Matthew J. Sobel

Planning-Horizon Theorems for Knapsack and Renewal Problems with a Denumerable Number of Activities pp. 163-174

Steven A. Lippman

An Approximation for the Moments of Waiting Times pp. 175-186

C. R. Heathcote and P. Winer

Letters to the Editor---Extension of Dantzig's Algorithm to Finding an Initial Near-Optimal Basis for the Transportation Problem pp. 187-191

Edward J. Russell

Errata pp. 192-192

Martin Pincus