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 25, issue 6, 1977

Optimal Peremptory Challenges in Trials by Juries: A Bilateral Sequential Process pp. 901-919

Arthur Roth, Joseph B. Kadane and Morris H. Degroot

General Techniques for Combinatorial Approximation pp. 920-936

Sartaj Sahni

Sequencing Competitive Expansion Projects pp. 937-951

Donald Erlenkotter and J. Scott Rogers

Simple Criteria for Optimal Portfolio Selection with Upper Bounds pp. 952-967

Edwin J. Elton, Martin J. Gruber and Manfred W. Padberg

A Strategic Weapons Exchange Allocation Model pp. 968-976

Jerome Bracken, James E. Falk and Frederic A. Miercort

Planning Horizons for a Stochastic Lead-Time Inventory Model pp. 977-988

Matthew J. Liberatore

Multicriteria Choice Functions Based on Binary Relations pp. 989-1012

Peter C. Fishburn

Coalitional and Chance-Constrained Solutions to n -Person Games, II: Two-Stage Solutions pp. 1013-1019

A. Charnes and Daniel Granot

Structure of Optimal Policies in Complex Queuing Systems pp. 1020-1027

S. Christian Albright

Technical Note—An Eigenvector Condition for Markov Chain Lumpability pp. 1028-1031

D. R. Barr and M. U. Thomas

Technical Note—Cannibalization Policies for Multistate Systems pp. 1032-1039

David Khalifa, Michael Hottenstein and Sumer Aggarwal

Errata pp. 1040-1040a

W. T. Ziemba

Errata pp. 1040-1040

Brant E. Fries

Volume 25, issue 5, 1977

An Offensive Earned-Run Average for Baseball pp. 729-740

Thomas M. Cover and Carroll W. Keilers

Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems pp. 741-751

Robert S. Garfinkel

A General Algorithm for One-Dimensional Knapsack Problems pp. 752-759

Giorgio P. Ingargiola and James F. Korsh

The Set-Covering Problem: A New Implicit Enumeration Algorithm pp. 760-772

Javier Etcheberry

An Algorithm for the Vertex Packing Problem pp. 773-787

David J. Houck and R. Rao Vemuganti

A Simplex-Like Algorithm for the Continuous Modular Design Problem pp. 788-807

Timothy L. Shaftel and Gerald L. Thompson

An Algorithm for Some Special Nondifferentiable Optimization Problems pp. 808-817

Yves Smeers

On Optimal Dividend, Reinvestment, and Liquidation Policies for the Firm pp. 818-834

Evan L. Porteus

The ( S − 1, S ) Inventory Model under Time Limit on Backorders pp. 835-850

Chandrasekhar Das

Bounds and Approximations in Queuing through Monotonicity and Continuity pp. 851-863

Dietrich Stoyan

Optimal Search of a Moving Target pp. 864-870

Y. C. Kan

Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges pp. 871-874

Saman Hong and Manfred W. Padberg

Technical Note—An Importance Ranking for System Components Based upon Cuts pp. 874-879

David A. Butler

Technical Note—An Inequality for the Variance of Waiting Time under a General Queuing Discipline pp. 879-884

Oldrich A. Vasicek

Technical Note—Optimal Strategy for the One-against-Many Battle pp. 884-888

Yoram Friedman

Technical Note—Bayesian Decision Making with Ordinal Information pp. 889-892

Johnnie R. Charnetski

Letter to the Editor—On Solving Cesario's Interesting Test Problem pp. 893-894

Jerrold H. May and Biplab K. Dutta

Volume 25, issue 4, 1977

Computation of Optimal Poker Strategies pp. 541-562

Norman Zadeh

Mathematical Programming and the Location of Fire Companies for the Denver Fire Department pp. 563-578

Donald R. Plane and Thomas E. Hendrick

A Normative Methodology for Modeling Consumer Response to Innovation pp. 579-619

John R. Hauser and Glen L. Urban

Bidding in Simultaneous Auctions with a Constraint on Exposure pp. 620-629

Michael H. Rothkopf

Higher-Order Approximations for the Perishable-Inventory Problem pp. 630-640

Steven Nahmias

The Centers and Medians of a Graph pp. 641-650

Edward Minieka

Capacity Design and Service Quality Control in a Queuing System pp. 651-661

S. D. Deshmukh and Suresh Jain

Level Crossings in Point Processes Applied to Queues: Single-Server Case pp. 662-674

P. H. Brill and M. J. M. Posner

The Application of a Hankel Transformation to a Class of Circularly Symmetric Coverage Problems pp. 675-687

Gerhard Schroeter

An Algorithm for Solving Interval Linear Programming Problems pp. 688-695

A. Charnes, Frieda Granot and F. Phillips

Dynamic Optimal Pricing to Deter Entry under Constrained Supply pp. 696-705

Zvi Lieber and Amir Barnea

Technical Note—A Note on the Nonparametric Analysis of the Stollmack-Harris Recidivism Data pp. 706-708

Bruce W. Turnbull

Technical Note—An Algorithm for the p -Median Problem pp. 709-713

Subhash C. Narula, Ugonnaya I. Ogbu and Haakon M. Samuelsson

Technical Note—On Converse Duality for a Nondifferentiable Programming Problem pp. 713-715

B. Mond

Technical Note—Some Examples Concerning Linear Continuity of Solutions to Programming Problems pp. 715-719

Michiel Hazewinkel

Technical Note—Using a Monte Carlo Method for Optimizing Smoothed Functional pp. 720-724

Y. Rubinstein

Volume 25, issue 3, 1977

Turfing pp. 367-386

M. Segal and D. B. Weinberger

An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems pp. 387-403

John A. Muckstadt and Sherri A. Koenig

Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem pp. 404-418

B. N. Tien and T. C. Hu

A Convergent Duality Theory for Integer Programming pp. 419-434

David E. Bell and Jeremy F. Shapiro

A Characterization of Stability in Linear Programming pp. 435-447

Stephen M. Robinson

A Utility Function for Time Streams Having Inter-Period Dependencies pp. 448-458

David E. Bell

The Use of Decomposition in the Optimal Design of Reliable Systems pp. 459-468

David A. Butler

Assignment of Customers to Servers in a Heterogeneous Queuing System with Switching pp. 469-483

Wayne L. Winston

On the Optimal Operating Policy for the Machine Repair Problem When Failure and Repair Times Have Erlang Distribution pp. 484-492

Lola Coleman Goheen

Estimation of Parameters of Zero-One Processes by Interval Sampling pp. 493-505

M. Brown, H. Solomon and M. A. Stephens

Determining the Class of Payoffs That Yield Force-Level-Independent Optimal Fire-Support Strategies pp. 506-516

James G. Taylor

Technical Note—An Effective Heuristic for the M -Tour Traveling Salesman Problem with Some Side Conditions pp. 517-524

Robert A. Russell

Technical Note—A Special Case of the Transportation Problem pp. 525-528

R. Chandrasekaran and S. Subba Rao

Technical Note—Improved Conditions for Convergence in Undiscounted Markov Renewal Programming pp. 529-533

Loren Platzman

Technical Note—A Note on the Near Optimality of “5-EOQ's Worth” Forecast Horizons pp. 533-536

Leroy B. Schwarz

Volume 25, issue 2, 1977

ORSA Twenty-Five Years Later pp. 186-188

Philip M. Morse

Intuition in Mathematical Operations Research pp. 189-206

Bernard O. Koopman

National Development Planning Revisited pp. 207-218

Russell L. Ackoff

A Classified Bibliography of Research on Optimal Design and Control of Queues pp. 219-232

Thomas B. Crabill, Donald Gross and Michael J. Magazine

Individual versus Social Optimization in Exponential Congestion Systems pp. 233-247

Steven A. Lippman and Shaler Stidham

Optimal Control of Single-Server Queuing Networks and Multi-Class M / G /1 Queues with Feedback pp. 248-258

Dong-Wan Tcha and Stanley R. Pliska

Optimal Control of Discrete and Continuous Time Maintenance Systems with Variable Service Rates pp. 259-268

Wayne Winston

Analysis and Design of Loop Service Systems via a Diffusion Approximation pp. 269-278

M. J. Fischer

Conservation Equations and Their Application to Queuing Simulations pp. 279-288

Averill M. Law

On a Linear Programming Technique for the Steady-State Behavior of Some Queuing Systems pp. 289-303

T. C. T. Kotiah

Information Theory and the Optimal Detection Search pp. 304-314

William H. Barker

Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming pp. 315-325

C. C. Huang, W. T. Ziemba and A. Ben-Tal

Technical Note—Minimizing Cost to Maintain a Steady-State Growth Rate in a Population pp. 326-329

Rodger Parker

Technical Note—Insurance Exposure and Investment Risks: A Comment on the Use of Chance-Constrained Programming pp. 330-337

Yehuda Kahane

Technical Note—The One-Dimensional Generalized Lagrange Multiplier Problem pp. 338-345

Harvey J. Greenberg

Technical Note—Solving Integer Programming Problems by Aggregating Constraints pp. 346-351

Kenneth E. Kendall and Stanley Zionts

Technical Note—On Intersection Cuts in Interval Integer Linear Programming pp. 352-355

A. Charnes, Daniel Granot and Frieda Granot

Technical Note—Optimal Service Policies, Just after Idle Periods, in Two-Server Heterogeneous Queuing Systems pp. 356-360

Kiran Seth

Technical Note—Some Special Cases of Stochastic Programs with Recourse pp. 361-363

Behram Hansotia

Volume 25, issue 1, 1977

Mathematical Models for Economic and Political Advertising Campaigns pp. 1-14

Harold D. Shane

The Completion Time of PERT Networks pp. 15-29

Pierre Robillard and Michel Trahan

An Algorithm for Two-Dimensional Cutting Problems pp. 30-44

Nicos Christofides and Charles Whitlock

A Survey of Scheduling Rules pp. 45-61

S. S. Panwalkar and Wafik Iskander

Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties pp. 62-69

Jeffrey B. Sidney

Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem pp. 70-77

Wlodzimierz Szwarc

A Condensation Algorithm for a Class of Algebraic Programs pp. 78-88

Mordecai Avriel and Victoria Gurovich

Triangular Factorization and Generalized Upper Bounding Techniques pp. 89-99

Markku Kallio and Evan L. Porteus

Cost Models for Stochastic Clearing Systems pp. 100-127

Shaler Stidham

Sharp Bounds on the Value of Perfect Information pp. 128-139

C. C. Huang, I. Vertinsky and W. T. Ziemba

Two Queues in Tandem Attended by a Single Server pp. 140-147

Miguel Taube-Netto

Technical Note—Column Dropping in the Dantzig-Wolfe Convex Programming Algorithm: Computational Experience pp. 148-155

Richard P. O'Neill

Technical Note—On Sensitivity Analysis in Geometric Programming pp. 155-163

John J. Dinkel and Gary A. Kochenberger

Technical Note—Cost/Completion-Date Tradeoffs in the Transportation Problem pp. 163-168

Theodore S. Glickman and Paul D. Berger

Technical Note—Comparison between Two Dynamic Perishable Inventory Models pp. 168-172

Steven Nahmias

Technical Note—Minimax Procedure for a Class of Linear Programs under Uncertainty pp. 173-177

R. Jagannathan

Letter to the Editor pp. 178-178

A. Charnes