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 31, issue 6, 1983

Preface pp. 981-982

Richard E. Nance, Nabil R. Adam and Robert G. Sargent

Feature Article—Statistical Analysis of Simulation Output Data pp. 983-1029

Averill M. Law

A Unifying View of Hybrid Simulation/Analytic Models and Modeling pp. 1030-1052

J. G. Shanthikumar and R. G. Sargent

The Integrated Simulation Environment (Simulation Software of the 1990s) pp. 1053-1073

James O. Henriksen

Accelerated Convergence in the Simulation of Countably Infinite State Markov Chains pp. 1074-1089

George S. Fishman

Confidence Interval Estimation Using Standardized Time Series pp. 1090-1108

Lee Schruben

Simulation Run Length Control in the Presence of an Initial Transient pp. 1109-1144

Philip Heidelberger and Peter D. Welch

Regenerative Simulation for Estimating Extreme Values pp. 1145-1166

Donald L. Iglehart and Mark L. Stone

Optimal Tests for Initialization Bias in Simulation Output pp. 1167-1178

L. Schruben, H. Singh and L. Tierney

Simple Dependent Pairs of Exponential and Uniform Random Variables pp. 1179-1197

A. J. Lawrance and P. A. W. Lewis

Volume 31, issue 5, 1983

Solving Large-Scale Zero-One Linear Programming Problems pp. 803-834

Harlan Crowder, Ellis L. Johnson and Manfred Padberg

Bargaining under Incomplete Information pp. 835-851

Kalyan Chatterjee and William Samuelson

A Selection Artifact in Delinquency Data Revisited pp. 852-865

Luke Tierney

Reconciliation of Probability Distributions pp. 866-880

Dennis Lindley

Resource Allocation with Tree Constraints pp. 881-890

K. M. Mjelde

Time Step vs. Dynamic Optimization of Generation-Capacity-Expansion Programs of Power Systems pp. 891-914

Nissan Levin, Asher Tishler and Jacob Zahavi

Sensitivity Theory and Its Application to a Large Energy-Economics Model pp. 915-937

R. G. Alsmiller, J. Barish, J. D. Drischler, J. E. Horwedel, J. L. Lucius and J. W. McAdoo

Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem pp. 938-945

Edward K. Baker

Technical Note—Linearization in 0-1 Variables: A Clarification pp. 946-947

A. J. Goldman

Technical Note—A Convexity Result for a Class of GI / G /1 Queueing Systems pp. 948-950

Hung-Yuan Tu and Hillel Kumin

Technical Note—A Note on Waiting Times in Single Server Queues pp. 950-951

Richard R. Weber

Technical Note—A Note on the One Against Many Battle pp. 952-956

Kensaku Kikuta

Technical Note—Cost Formulas for Continuous Review Inventory Models with Fixed Delivery Lags pp. 957-965

Awi Federgruen and Zvi Schechner

Technical Note—Simulating the GI / G /1 Queue in Heavy Traffic pp. 966-971

Do Le Minh and Ronald M. Sorli

Volume 31, issue 4, 1983

Feature Article—Decision-Aiding Models: Validation, Assessment, and Related Issues for Policy Analysis pp. 603-631

Saul I. Gass

Oil Stockpiles and Import Reductions: A Dynamic Programming Approach pp. 632-651

Hung-Po Chao and Alan Manne

Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel pp. 652-669

Richard C. Larson and Ghazala Sadiq

An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem pp. 670-684

Jonathan F. Bard

Mean-Variance Approximations to Expected Logarithmic Utility pp. 685-696

Lawrence B. Pulley

Optimum Replacement of a System Subject to Shocks pp. 697-704

Philip J. Boland and Frank Proschan

On the M / G /1 Queue with Rest Periods and Certain Service-Independent Queueing Disciplines pp. 705-719

Michel Scholl and Leonard Kleinrock

Surveillance Search for a Moving Target pp. 720-738

Luke Tierney and Joseph B. Kadane

Search for a Moving Target: The FAB Algorithm pp. 739-751

Alan R. Washburn

Annihilation Prediction for Lanchester-Type Models of Modern Warfare pp. 752-771

James G. Taylor and Gerald G. Brown

Complexity of the Project Sequencing Problem pp. 772-778

V. Akileswaran, G. B. Hazen and T. L. Morin

Technical Note—On the Evaluation of Intertemporal Lotteries pp. 779-782

Stephen C. Hora and Larry M. Austin

Technical Note—Mean Drifts and the Non-Ergodicity of Markov Chains pp. 783-789

Linn I. Sennott, Pierre A. Humblet and Richard L. Tweedie

Technical Note—The Asymptotic Extreme Value Distribution of the Sample Minimum of a Concave Function under Linear Constraints pp. 789-794

Nitin R. Patel and Robert L. Smith

Technical Note—Computational Viability of a Constraint Aggregation Scheme for Integer Linear Programming Problems pp. 795-801

Denis C. Onyekwelu

Volume 31, issue 3, 1983

Model Building Techniques for the Correction of End Effects in Multistage Convex Programs pp. 407-431

Richard C. Grinold

An Empirical Investigation of the Transient Behavior of Stationary Queueing Systems pp. 432-455

Amedeo R. Odoni and Emily Roth

The Response Times of Priority Classes under Preemptive Resume in M / M / m Queues pp. 456-465

J. P. Buzen and A. B. Bondi

Accelerated Accuracy in the Simulation of Markov Chains pp. 466-487

George S. Fishman

Decompositions of Multiattribute Utility Functions Based on Convex Dependence pp. 488-506

Hiroyuki Tamura and Yutaka Nakamura

Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem pp. 507-521

H. Donald Ratliff and Arnon S. Rosenthal

An Integer Programming Procedure for Assembly System Design Problems pp. 522-545

Stephen C. Graves and Bruce W. Lamar

The Discrete-Time Sequencing Expansion Problem pp. 546-558

A. W. Neebe and M. R. Rao

Stochastic Scheduling with Release Dates and Due Dates pp. 559-572

Michael Pinedo

Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems pp. 573-586

P. Y. Wang

Technical Note—The Nested Ball Principle for the Relaxation Method pp. 587-590

Zvi Drezner

Technical Note—Monotone Optimal Issuing Policies in a Deterministic Inventory Model pp. 591-595

R. Chandrasekaran

Technical Note—A Polynomial Simplex Method for the Assignment Problem pp. 595-600

Ming S. Hung

Volume 31, issue 2, 1983

Feature Article—The Process of Search Planning: Current Approaches and Continuing Problems pp. 207-233

Lawrence D. Stone

System Balance for Extended Logistic Systems pp. 234-252

Stephen C. Graves and Julian Keilson

Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations pp. 253-276

Hanif D. Sherali, Allen L. Soyster and Frederic H. Murphy

Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem pp. 277-291

Leon F. McGinnis

Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network pp. 292-303

D. R. Shier and P. M. Dearing

Diffusion Approximation for an M / G / m Queue pp. 304-321

Toshikazu Kimura

Optimal Prediction of Times and Queue Lengths in the GI / M /1 Queue pp. 322-337

D. A. Stanford, B. Pagurek and C. M. Woodside

A Class of Variance-Constrained Problems pp. 338-353

Moshe Sniedovich

Modeling and Analysis of Three-Stage Transfer Lines with Unreliable Machines and Finite Buffers pp. 354-380

Stanley B. Gershwin and Irvin C. Schick

Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints pp. 381-386

K. R. Baker, E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan

Technical Note—A Class of Linear Programs Convertible to Network Problems pp. 387-391

William H. Cunningham

Technical Note—When Does the βth Percentile Residual Life Function Determine the Distribution? pp. 391-396

Barry C. Arnold and Patrick L. Brockett

Technical Note—Branch and Fathom: A Technique for Computing Functions on the Power Set of a Set pp. 396-400

David R. Strip

Technical Note—Mathematical Pitfalls in the One Machine Multiproduct Economic Lot Scheduling Problem pp. 401-405

Paul J. Schweitzer and Edward A. Silver

Volume 31, issue 1, 1983

Editorial pp. 1-4

Thomas L. Magnanti

Area Editor Statement—OR Practice pp. 5-6

Michael H. Rothkopf

A System Point Approach to Nonuniform Advertising Insertions pp. 7-23

Percy H. Brill and Jacob Hornik

Parallel Scheduling Algorithms pp. 24-49

Eliezer Dekel and Sartaj Sahni

Illustrative Comparison of One Utility's Coal and Nuclear Choices pp. 50-83

Ralph L. Keeney and Alan Sicherman

Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition pp. 84-100

Jeremy A. Bloom

An Outer Approximation Algorithm for Solving General Convex Programs pp. 101-113

Masao Fukushima

A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates pp. 114-127

J. Erschler, G. Fontan, C. Merce and F. Roubellat

A Holistic Methodology for Modeling Consumer Response to Innovation pp. 128-176

Richard P. Bagozzi

A Multivariate New Better than Used Class Derived from a Shock Model pp. 177-183

Emad El-Neweihi, Frank Proschan and Jayaram Sethuraman

A Single-Server Queue with Cyclostationary Arrivals and Arithmetic Service pp. 184-205

Michael Kaplan