Help
Cart
Skip main navigation

Available Issues

April 16, 2013 - May 25, 2026

Available Issues

April 16, 2013 - May 25, 2026

Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem

Pages:847–858

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.847

Preview Abstract
Determining Optimal Use of Resources among Regional Producers under Differing Levels of Cooperation

Pages:859–866

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.859

Preview Abstract
A Resource Allocation Algorithm (ALCOT) for Controlling Mine Drainage Pollution

Pages:867–888

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.867

Preview Abstract
A Solution Method for Multistage Stochastic Programs with Recourse with Application to an Energy Investment Problem

Pages:889–902

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.889

Preview Abstract
Bounds for Row-Aggregation in Linear Programming

Pages:903–916

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.903

Preview Abstract
Beta Variate Generation via Exponential Majorizing Functions

Pages:917–926

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.917

Preview Abstract
A Parametric Linear Complementarity Technique for Optimal Portfolio Selection with a Risk-Free Asset

Pages:927–941

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.927

Preview Abstract
Sequencing to Minimize the Maximum Job Cost

Pages:942–951

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.942

Preview Abstract
Optimal Challenges for Selection

Pages:952–968

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.952

Preview Abstract
Solving the Assignment Problem by Relaxation

Pages:969–982

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.969

Preview Abstract
The Relation between Customer and Time Averages in Queues

Pages:983–994

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.983

Preview Abstract
Free Access
Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms

Pages:995–1000

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.995

Preview Abstract
Free Access
Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm

Pages:1001–1005

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.1001

Preview Abstract
Free Access
Technical Note—Duality Theory for Generalized Linear Programs with Computational Methods

Pages:1005–1011

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.1005

Preview Abstract
Free Access
Technical Note—Generation of Variates from Distribution Tails

Pages:1012–1017

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.1012

Preview Abstract
Free Access
Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem

Pages:1018–1021

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.1018

Preview Abstract
Free Access
Letter to the Editor—Comments on “Optimal Jury Selection”

Pages:1022–1024

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.1022

Free Access
Letter to the Editor—Authors' Rejoinder

Pages:1024–1025

Published Online:August 1, 1980

https://doi.org/10.1287/opre.28.4.1024

Previous
Back to Top
Next
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.
Agree