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 28, issue 6, 1980

Selective Incapacitation Strategies Based on Estimated Crime Rates pp. 1259-1274

Jan M. Chaiken and John E. Rolph

Optimal Search for a Moving Target in Discrete Time and Space pp. 1275-1289

Scott Shorey Brown

Search-Evasion Game in a Fixed Region pp. 1290-1298

Alan R. Washburn

Expected Coverage of a Randomly Located Target by Multiple Independent Salvos pp. 1299-1318

Gerhard Schroeter

Optimal Stopping in a Partially Observable Markov Process with Costly Information pp. 1319-1334

George E. Monahan

A Queueing System in Which Customers Require a Random Number of Servers pp. 1335-1346

Linda Green

A Dynamic Programming Approach for Sequencing Groups of Identical Jobs pp. 1347-1359

Harilaos N. Psaraftis

A Natural Gas Flow Model under Uncertainty in Demand pp. 1360-1374

Reuven R. Levary and Burton V. Dean

DISCON: A New Method for the Layout Problem pp. 1375-1384

Zvi Drezner

A Maxmin Location Problem pp. 1385-1401

B. Dasarathy and Lee J. White

Hard Knapsack Problems pp. 1402-1411

Vasek Chvátal

The Linear Multiple Choice Knapsack Problem pp. 1412-1423

Eitan Zemel

A Tradeoff Cut Approach to Multiple Objective Optimization pp. 1424-1435

K. Musselman and Joseph Talavage

Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times pp. 1436-1441

C. N. Potts

Technical Note—Generalized Covering Relaxation for 0-1 Programs pp. 1442-1450

Daniel Granot and Frieda Granot

Technical Note—Improved Bounds for Aggregated Linear Programs pp. 1450-1453

Roy Mendelssohn

Volume 28, issue 5, 1980

Feature Article—Survey of Nonlinear Programming Applications pp. 1029-1073

Leon S. Lasdon and Allan D. Waren

Cyclic Scheduling via Integer Programs with Circular Ones pp. 1074-1085

John J. Bartholdi, James B. Orlin and H. Donald Ratliff

Local Search for the Asymmetric Traveling Salesman Problem pp. 1086-1099

Paris-C. Kanellakis and Christos H. Papadimitriou

Multiple Objective Mathematical Programming with Respect to Multiple Decision-Makers pp. 1100-1111

Richard E. Wendell

A Dual-Bounded Algorithm for the p -Median Problem pp. 1112-1121

Roberto D. Galvão

The Stochastic Shortest Route Problem pp. 1122-1129

C. Elliott Sigal, A. Alan B. Pritsker and James J. Solberg

An Algorithm for Large Zero-One Knapsack Problems pp. 1130-1154

Egon Balas and Eitan Zemel

Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine pp. 1155-1167

R. G. Vickson

Waiting Time In a Multi-Server Cutoff-Priority Queue, and Its Application to an Urban Ambulance Service pp. 1168-1188

I. D. S. Taylor and J. G. C. Templeton

Optimal Operation of an M / M /2 Queue with Removable Servers pp. 1189-1204

Colin E. Bell

The Distribution of Security Price Changes: A Test of a Volume-Mixture Model with Cauchy Disturbances pp. 1205-1212

Thomas W. Epps

Technical Note—Enforcing Constraints on Expanded Networks pp. 1213-1218

Eric V. Denardo and Bennett L. Fox

Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit pp. 1219-1222

Roy Jonker, Rob Kaas and Ton Volgenant

Technical Note—Further Results on the Minimization of a Nonseparable Objective Function Subject to Disjoint Constraints pp. 1222-1226

Richard E. Wendell and Daniel M. Rosenblum

Technical Note—A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems pp. 1226-1227

Silvano Martello and Paolo Toth

Technical Note—A One-Product Production/Inventory Problem under Continuous Review Policy pp. 1228-1236

Bezalel Gavish and Stephen C. Graves

Technical Note—A Solvable Cyclic Scheduling Problem with Serial Precedence Structure pp. 1236-1240

R. S. Garfinkel and W. J. Plotnicki

Technical Note—Location Theory, Dominance, and Convexity: Some Further Results pp. 1241-1250

P. Hansen, J. Perreur and Jacques Thisse

Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions pp. 1251-1257

Mark H. Karwan and Ronald L. Rardin

Volume 28, issue 4, 1980

Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem pp. 847-858

Gerard Cornuejols, George L. Nemhauser and Laurence A. Wolsey

Determining Optimal Use of Resources among Regional Producers under Differing Levels of Cooperation pp. 859-866

Robert B. Rovinsky, Christine A. Shoemaker and Michael Todd

A Resource Allocation Algorithm (ALCOT) for Controlling Mine Drainage Pollution pp. 867-888

Gordon M. Clark and Anbil N. Ranganathan

A Solution Method for Multistage Stochastic Programs with Recourse with Application to an Energy Investment Problem pp. 889-902

Francois V. Louveaux

Bounds for Row-Aggregation in Linear Programming pp. 903-916

Paul H. Zipkin

Beta Variate Generation via Exponential Majorizing Functions pp. 917-926

Bruce W. Schmeiser and A. J. G. Babu

A Parametric Linear Complementarity Technique for Optimal Portfolio Selection with a Risk-Free Asset pp. 927-941

Jong-Shi Pang

Sequencing to Minimize the Maximum Job Cost pp. 942-951

Clyde L. Monma

Optimal Challenges for Selection pp. 952-968

Morris H. Degroot and Joseph B. Kadane

Solving the Assignment Problem by Relaxation pp. 969-982

Ming S. Hung and Walter O. Rom

The Relation between Customer and Time Averages in Queues pp. 983-994

Daniel P. Heyman and Shaler Stidham

Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms pp. 995-1000

Amzad Ali, R. Helgason, J. Kennington and H. Lall

Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm pp. 1001-1005

Robert W. Haessler

Technical Note—Duality Theory for Generalized Linear Programs with Computational Methods pp. 1005-1011

David J. Thuente

Technical Note—Generation of Variates from Distribution Tails pp. 1012-1017

Bruce W. Schmeiser

Technical Note—An n -Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem pp. 1018-1021

Kenneth R. Fox, Bezalel Gavish and Stephen C. Graves

Letter to the Editor—Comments on “Optimal Jury Selection” pp. 1022-1024

Charles Tiplitz

Letter to the Editor—Authors' Rejoinder pp. 1024-1025

Steven Brams and Morton D. Davis

Volume 28, issue 3-part-ii, 1980

Dynamic Loading and Unloading of Liquids into Tanks pp. 633-649

Nicos Christofides, Aristide Mingozzi and Paolo Toth

A Method to Overcome the Ill-Conditioning Problem of Differentiable Penalty Functions pp. 650-667

Christakis Charalambous

An Evaluation of Substitute Methods for Derivatives in Unconstrained Optimization pp. 668-686

D. M. Himmelblau and J. W. Lindsay

A Stochastic Allocation Problem pp. 687-693

Haim Mendelson, Joseph S. Pliskin and Uri Yechiali

Approximate Traveling Salesman Algorithms pp. 694-711

B. Golden, L. Bodin, T. Doyle and W. Stewart

Capacity Expansion when Demand Is a Birth-Death Random Process pp. 712-721

John Freidenfelds

Duality in the Cent-Dian of a Graph pp. 722-735

Jonathan Halpern

An Investment Staging Model for a Bridge Replacement Problem pp. 736-753

Alberto Garcia-Diaz and Judith S. Liebman

A New and Efficient Algorithm for a Class of Portfolio Selection Problems pp. 754-767

Jong-Shi Pang

Inspection Procedures when Failure Symptoms Are Delayed pp. 768-776

Bhaskar Sengupta

Restricted Bayes Strategies for Programs with Simple Recourse pp. 777-784

Raymond Nadeau and Radu Theodorescu

Identifying Efficient Vectors: Some Theory and Computational Results pp. 785-793

Stanley Zionts and Jyrki Wallenius

Successive Approximation Methods in Undiscounted Stochastic Games pp. 794-809

Awi Federgruen

A Characterization of Waiting Time Performance Realizable by Single-Server Queues pp. 810-821

E. G. Coffman and I. Mitrani

Technical Note—Geometric Interpretation of Generalized Lagrangian Multiplier Search Procedures in the Payoff Space pp. 822-827

William B. Widhelm

Technical Note—Some Remarks on Scheduling Nursing Personnel pp. 828-829

Otto Roglin

Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks pp. 829-836

Fred Glover and John M. Mulvey

Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems pp. 836-844

J. E. Ward and R. E. Wendell

Technical Note—Generalized Efficient Solutions for Sums of Sets pp. 844-846

D. J. White

Volume 28, issue 3-part-i, 1980

Feature Article—Research Portfolio for Inventory Management and Production Planning Systems pp. 445-475

Harvey M. Wagner

A Decoupling Inventory Problem with Storage Capacity Constraints pp. 476-488

Peter C. Bell

Development of a Rating System for All Tennis Players pp. 489-502

Samuel S. Blackman and James W. Casey

Statistical Acceptance Sampling in a Competitive Environment pp. 503-511

Melvin Dresher and Sidney Moglewer

A Two-Fold Tandem Net with Deterministic Links and Source Interference pp. 512-526

Michael Kaplan

Equity and Public Risk pp. 527-534

Ralph L. Keeney

Conservation Equations and Variance Reduction in Queueing Simulations pp. 535-546

John S. Carson and Averill M. Law

Artificial Inflation of a Delinquency Rate by a Selection Artifact pp. 547-559

Michael D. Maltz and Stephen M. Pollock

Lanchester-Type Equations of Combat which Account for Multiple Killing Hits pp. 560-569

Visvaldis Mangulis

On Multiplicative Bidding Strategies pp. 570-575

Michael H. Rothkopf

Equilibrium Linear Bidding Strategies pp. 576-583

Michael H. Rothkopf

A Single Server Queueing Loss Model with Heterogeneous Arrival and Service pp. 584-593

Shun-Chen Niu

An Approximation Method for Open Restricted Queueing Networks pp. 594-602

Yutaka Takahashi, Hideo Miyahara and Toshiharu Hasegawa

Competitive Bidding with Dependent Value Estimates pp. 603-613

Robert L. Winkler and Daniel G. Brooks

Technical Note—A Comparison of the Method of Bounding Distributions (MBD) and Monte Carlo Simulation for Analyzing Stochastic Acyclic Networks pp. 614-617

Robert S. Sullivan and Jack C. Hayya

Technical Note—A Transient Solution to the Multistage Poisson Queueing System with Infinite Servers pp. 618-622

R. R. P. Jackson and P. Aspden

Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem pp. 623-627

R. Jonker, G. De Leve, J. A. Van Der Velde and A. Volgenant

Technical Note—A Note on the Multiple Traveling Salesmen Problem pp. 628-632

M. R. Rao

Volume 28, issue 2, 1980

A Multibrand Stochastic Model Compounding Heterogeneous Erlang Timing and Multinomial Choice Processes pp. 255-277

Abel P. Jeuland, Frank M. Bass and Gordon P. Wright

Intensity Measures of Consumer Preference pp. 278-320

John R. Hauser and Steven M. Shugan

Experimentation and Budgeting in Advertising: An Adaptive Control Approach pp. 321-347

Dov Pekelman and Edison Tse

Waiting Time in an S − 1, S Inventory System with Arbitrarily Distributed Lead Times pp. 348-352

W. Karl Kruse

Evaluating the Effectiveness of a New Method for Computing Approximately Optimal ( s, S ) Inventory Policies pp. 353-364

James R. Freeland and Evan L. Porteus

Optimal Ordering Policies for Continuous Review Perishable Inventory Models pp. 365-374

Howard J. Weiss

The Almost Regenerative Method for Stochastic System Simulations pp. 375-386

F. L. Gunther and R. W. Wolff

Generalized Value Bounds and Column Reduction in Finite Markov Decision Problems pp. 387-394

R. G. Vickson

The Expected Value of Perfect Information in Facility Location pp. 395-402

Z. Drezner and G. O. Wesolowsky

Bounds on the Effect of Aggregating Variables in Linear Programs pp. 403-418

Paul H. Zipkin

Technical Note—A Note on “Queueing Models with Lane Selection” pp. 419-420

Diego R. Roque

Technical Note—A Note on Quality Control under Markovian Deterioration pp. 421-424

John S. Hughes

Technical Note—A Look at Finding Points of a Convex Polyhedron Using Relaxation and Subgradient Procedures pp. 424-430

Gary J. Koehler and Surya Kumar

Letter to the Editor—Guidelines for Model Evaluation: An Abridged Version of the U.S. General Accounting Office Exposure Draft pp. 431-439

Saul I. Gass and Bruce W. Thompson

Letter to the Editor—The History of Two-Class Rules for Reducing Queueing Times in M / G /1 pp. 440-440

William L. Maxwell and Louis W. Miller

Letter to the Editor—Author's Rejoinder pp. 441-441

D. E. Matthews

Volume 28, issue 1, 1980

Preface pp. 1-2

Craig W. Kirkwood

TREES—A Decision-Maker's Lament pp. 3-3

Michael H. Rothkopf

An Assessment of Decision Analysis pp. 4-27

Ronald A. Howard

Clinical Decision Analysis pp. 28-43

Baruch Fischhoff

Decision Analysis Assessment of a National Medical Study pp. 44-59

Richard H. Shachtman

A Task Force Decision Analysis pp. 60-80

Richard D. Smallwood and Peter A. Morris

Negotiation of International Oil Tanker Standards: An Application of Multiattribute Value Theory pp. 81-96

Jacob W. Ulvila and Warren D. Snider

An Annotated Bibliography of Decision Analytic Applications to Health Care pp. 97-113

Jeffrey P. Krischer

Approximations and Sensitivity in Multiobjective Resource Allocation pp. 114-128

Donald L. Keefer and Stephen M. Pollock

On Value and Strategic Role of Information in Semi-Normalized Decisions pp. 129-138

Irving H. LaValle

The Use and Value of Models in Decision Analysis pp. 139-155

Robert C. Nickerson and Dean W. Boyd

Analysis of Risks to Life and Limb pp. 156-175

Samuel E. Bodily

The Problem of “Utility Weights” in Group Preference Aggregation pp. 176-187

Horace W. Brock

Evaluating Alternatives Involving Potential Fatalities pp. 188-205

Ralph L. Keeney

Utility Functions for Life Years and Health Status pp. 206-224

Joseph S. Pliskin, Donald S. Shepard and Milton C. Weinstein

Preference Conditions for Multiattribute Value Functions pp. 225-232

Craig W. Kirkwood and Rakesh K. Sarin

Multiattribute Decision Making by Sequential Resource Allocation pp. 233-252

Peter A. Morris and Shmuel S. Oren