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 23, issue 6, 1975

A Queuing-Linear Programming Approach to Scheduling Police Patrol Cars pp. 1045-1062

Peter J. Kolesar, Kenneth L. Rider, Thomas B. Crabill and Warren E. Walker

Optimal Doubling in Backgammon pp. 1063-1071

Emmett B. Keeler and Joel Spencer

On Competitive Bidding pp. 1072-1079

M. E. Oren and A. C. Williams

Optimal Bidding in Sequential Auctions pp. 1080-1090

Shmuel S. Oren and Michael H. Rothkopf

Optimization Problems Subject to a Budget Constraint with Economies of Scale pp. 1091-1098

R. J. Hillestad

Merging and Sorting Applied to the Zero-One Knapsack Problem pp. 1099-1109

J. H. Ahrens and G. Finke

An Algorithm for the Solution of 0-1 Loading Problems pp. 1110-1119

Giorgio Ingargiola and James F. Korsh

A Stochastic Sequential Allocation Model pp. 1120-1130

C. Derman, G. J. Lieberman and S. M. Ross

A Discrete Time Inventory Model with Arbitrary Interval and Quantity Distributions of Demand pp. 1131-1142

Edward P. C. Kao

Application of a Functional Equation to a Class of Stochastic Detection Models pp. 1143-1154

Barry Belkin

Approximate Solutions for Some Two-Stage Tandem Queues, Part 1: Individual Arrivals at the Second Stage pp. 1155-1166

Matthew Rosenshine and M. Jeya Chandra

Technical Note—Bench Marks Comparing Transportation Codes based on Primal Simplex and Primal-Dual Algorithms pp. 1167-1172

Richard S. Hatch

Technical Note—Capacity Expansion in Convex Cost Networks with Uncertain Demand pp. 1172-1178

Cornelius T. Leondes and Ranjit K. Nandi

Technical Note—A Note on the Busy Period of an M / G /1 Finite Queue pp. 1179-1182

Louis W. Miller

Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem pp. 1183-1191

Patrick McKeown

Volume 23, issue 5, 1975

Approximating the Performance of Urban Emergency Service Systems pp. 845-868

Richard C. Larson

An Optimum Manpower Utilization Model for Health Maintenance Organizations pp. 869-889

Donald P. Schneider and Kerry E. Kilpatrick

On-Line and Adaptive Optimum Advertising Control by a Diffusion Approximation pp. 890-907

Charles S. Tapiero

Minimizing Total Costs in One-Machine Scheduling pp. 908-927

A. H. G. Rinnooy Kan, B. J. Lageweg and J. K. Lenstra

Generalized Utility Independence and Some Implications pp. 928-940

Peter C. Fishburn and Ralph L. Keeney

A Fractional Hypercube Decomposition Theorem for Multiattribute Utility Functions pp. 941-967

Peter H. Farquhar

Optimal Starting Height for Pole-Vaulting pp. 968-978

Shaul P. Ladany

Two Models for Optimal Allocation of Aircraft Sorties pp. 979-995

Jerome Bracken, James E. Falk and Alan F. Karr

Infinite Linear Programming in Games with Partial Information pp. 996-1010

W. D. Cook, C. A. Field and M. J. L. Kirby

Approximating the Behavior of Nonstationary Single-Server Queues pp. 1011-1032

S. C. Moore

Technical Note—On the Rate of Expansion of Gamma Search Plans pp. 1033-1037

Barry Belkin

Technical Note—A Recursion Algorithm for Finding Pure Admissible Decision Functions in Statistical Decisions pp. 1037-1042

Herbert Moskowitz

Letter to the Editor—Errata pp. 1043-1044

T. C. T. Kotiah

Letter to the Editor—Remarks pp. 1043-1043

Wlodzimierz Szwarc

Volume 23, issue 4, 1975

A Model for Predicting Average Fire Engine Travel Times pp. 603-613

Peter Kolesar

Determining the Relation between Fire Engine Travel Times and Travel Distances in New York City pp. 614-627

Peter Kolesar, Warren Walker and Jack Hausner

BRANDAID: A Marketing-Mix Model, Part 1: Structure pp. 628-655

John D. C. Little

BRANDAID: A Marketing-Mix Model, Part 2: Implementation, Calibration, and Case Study pp. 656-673

John D. C. Little

Waiting Time in an ( S − 1, S ) Inventory System pp. 674-680

Isamu Higa, Arlin M. Feyerherm and Arlette L. Machado

A Queuing System with Heterogeneous Servers and Autonomous Traffic Control pp. 681-686

Austin J. Lemoine

Applying a New Device in the Optimization of Exponential Queuing Systems pp. 687-710

Steven A. Lippman

Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results pp. 711-734

Rolf A. Lundin and Thomas E. Morton

Optimal Ordering Policies for Perishable Inventory—II pp. 735-749

Steven Nahmias

The Output of an M / D /1 Queue pp. 750-760

Charles D. Pack

Bounds and Transformations for Discounted Finite Markov Decision Chains pp. 761-784

Evan L. Porteus

Normalized Markov Decision Chains I; Sensitive Discount Optimality pp. 785-795

Uriel G. Rothblum

Subproblem and Overall Convergence for a Method-of-Centers Algorithm pp. 796-809

Robert Mifflin

Optimal Network Capacity Planning: A Shortest-Path Scheme pp. 810-818

P. J. Doulliez and M. R. Rao

Technical Note—Waiting Time in an ( S − 1, S ) Inventory System—Constant Service Time Case pp. 819-820

Craig C. Sherbrooke

Technical Note—The Queue M / G /1 When Jobs Are Scheduled within Generations pp. 821-824

T. M. O'Donovan

Technical Note—Stopping Rules for War Games or Combat Simulations with Exponential Life-Times pp. 824-829

John H. Shuford and Frank E. Grubbs

Technical Note—Delays in Single-Server Queues with Batch Input pp. 830-833

P. J. Burke

Technical Note—A Note on Zero-One Programming pp. 833-837

Manfred W. Padberg

Letter to the Editor—Some Implications of Modeling Food Preferences over Time pp. 838-839

P. H. Benson

Letter to the Editor—More about Modeling Food Preferences pp. 839-840

Joseph L. Balintfy, William J. Duffy and Prabhakant Sinha

Volume 23, issue 3, 1975

The B oxstep Method for Large-Scale Optimization pp. 389-405

R. E. Marsten, W. W. Hogan and J. W. Blankenship

The Accelerated Bound-and-Scan Algorithm for Integer Programming pp. 406-433

Bruce H. Faaland and Frederick S. Hillier

Surrogate Constraint Duality in Mathematical Programming pp. 434-451

Fred Glover

Measures of Effectiveness for Crime Reduction Programs pp. 452-474

Michael D. Maltz

On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness pp. 475-482

Graham McMahon and Michael Florian

Controlling Cutting Pattern Changes in One-Dimensional Trim Problems pp. 483-493

Robert W. Haessler

A Chance Constrained Multiple Choice Programming Algorithm pp. 494-510

Ronald D. Armstrong and Joseph L. Balintfy

A Linear Fractional Max-Min Problem pp. 511-521

W. D. Cook, M. J. L. Kirby and S. L. Mehndiratta

Force-Ratio Considerations for Some Lanchester-Type Models of Warfare pp. 522-533

James G. Taylor and Samuel H. Parry

Probabilistic Analysis of a System with Two Dissimilar Units Subject to Preventive Maintenance and a Single Service Facility pp. 534-548

M. N. Gopalan and C. A. D'Souza

Technical Note—Optimality Conditions and Recession Cones pp. 549-553

Robert A. Abrams and Adi Ben-Israel

Technical Note—A Stopping Criterion for the Golden-Ratio Search pp. 553-555

Byron S. Gottfried

Technical Note—Vertex Generation and Cardinality Constrained Linear Programs pp. 555-565

David S. Rubin

Technical Note—On the Generalized Lattice Point Problem and Nonlinear Programming pp. 565-571

A. Victor Cabot

Technical Note—Turning Off a Server with Customers Present: Is This Any Way to Run an M / M / c Queue with Removable Servers? pp. 571-574

Colin E. Bell

Technical Note—On the Stochastic Ordering of Markov Chains pp. 574-576

Cyrus Derman and Edward Ignall

Technical Note—Multidimensional Sequencing Rule pp. 576-580

Thomas L. Morin

Technical Note—Solving Constrained Multi-Facility Location Problems Involving l p Distances Using Convex Programming pp. 581-587

Robert F. Love and James G. Morris

Technical Note—Comment on “The Random Nature of Stock-Market Prices” Authored by Barrett and Wright pp. 587-591

Donald Aucamp

Technical Note—Probabilistic Analysis of a Single-Server n -unit System with ( n − 1) Warm Standbys pp. 591-598

M. N. Gopalan

Letter to the Editor—An Interesting Test Problem for Nonlinear Programming Algorithms pp. 599-601

Frank J. Cesario

Volume 23, issue 2, 1975

An Interactive Procedure for the School Boundary Problem with Declining Enrollment pp. 191-206

Charles A. Holloway, Donald A. Wehrung, Michael P. Zeitlin and Rosser T. Nelson

When the Greedy Solution Solves a Class of Knapsack Problems pp. 207-217

M. J. Magazine, G. L. Nemhauser and L. E. Trotter

A Social Service Measurement Model pp. 218-239

Samuel J. Mantel, Allan L. Service, Arnold Reisman, Raymond A. Koleski, Arthur Blum, Burton V. Dean, Robert Reich, Miriam Jaffee, Howard Rieger, Richard Ronis and Judah Rubinstein

A Branch-and-Bound Algorithm for Pagination pp. 240-259

John Duncan and Lawrence W. Scott

A Priority Queue with Discounted Linear Costs pp. 260-269

J. Michael Harrison

Dynamic Scheduling of a Multiclass Queue: Discount Optimality pp. 270-282

J. Michael Harrison

Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs pp. 283-298

Jeffrey B. Sidney

A Lower Bounding Structure for Lot-Size Scheduling Problems pp. 299-311

P. R. Kleindorfer and E. F. P. Newson

Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II—Computation and Structure pp. 312-324

L. Gelders and P. R. Kleindorfer

An M / M / m / n Queue for the Shortest Distance Priority Machine Interference Problem pp. 325-341

Gary H. Reynolds

Strategic Weapons Exchange Models pp. 342-357

R. L. Arms, D. W. Grissmer, J. Bracken, L. A. Lyons, F. A. Miercort and N. M. Smith

Technical Note—A Note on Integer Maximization of Unimodal Functions pp. 358-360

Alan Washburn

Technical Note—Allocation of Effort Resources among Competing Activities pp. 360-366

Hanan Luss and Shiv K. Gupta

Technical Note—Comments on the Distribution of Inventory Position in a Continuous-Review ( s, S ) Inventory System pp. 366-371

F. R. Richards

Technical Note—Computational Experience with Normed and Nonnormed Column-Generation Procedures in Nonlinear Programming pp. 372-382

Richard P. O'Neill and William B. Widhelm

Technical Note—A Dynamic Programming Formulation for Continuous Time Stock Control Systems pp. 383-386

Ralph Snyder

Volume 23, issue 1, 1975

Man-Machine Synthesis of Disaster-Resistant Operations pp. 2-21

J. Roberto Rivas and Dale F. Rudd

Optimal Diagnostic Questionnaires pp. 22-32

George T. Duncan

Simulating Stable Stochastic Systems: III. Regenerative Processes and Discrete-Event Simulations pp. 33-45

Michael A. Crane and Donald L. Iglehart

Optimal Ordering Policy for a Perishable Commodity with Fixed Lifetime pp. 46-61

Brant E. Fries

A Comparative Study of Flow-Shop Algorithms pp. 62-73

Kenneth R. Baker

On the Set-Covering Problem: II. An Algorithm for Set Partitioning pp. 74-90

Egon Balas and Manfred Padberg

Solving Constrained Transportation Problems pp. 91-106

D. Klingman and R. Russell

Optimal Priority Assignment with Heterogeneous Waiting Costs pp. 107-117

Avraham Beja and Esther Sid

A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems pp. 118-136

Ergin Uskup and Spencer B. Smith

The Probability Distribution Function of the Optimum of a 0-1 Linear Program with Randomly Distributed Coefficients of the Objective Function and the Right-Hand Side pp. 137-149

H.-J. Zimmermann and M. A. Pollatschek

A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem pp. 150-158

Mokhtar S. Bazaraa and Jamie J. Goode

Technical Note—An Elimination Method for the Flow-Shop Problem pp. 159-162

Kenneth R. Baker

Technical Note—Approximations for a Service System with Nonindependent Interarrival Times pp. 162-166

Daniel Granot, Frieda Granot and Austin Lemoine

Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search pp. 166-172

James H. Patterson and Joseph J. Albracht

Technical Note—Probabilistic Analysis of a Two-Unit System with a Single Service Facility for Preventive Maintenance and Repair pp. 173-177

M. N. Gopalan and C. A. D'Souza