A Cutting Plane Algorithm for the Linear Ordering Problem

Pages:1195–1220

Published Online:December 1, 1984

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

Confidence Intervals for Steady-State Simulations: I. A Survey of Fixed Sample Size Procedures

Pages:1221–1239

Published Online:December 1, 1984

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

The Economic Foundation of Generalized Equilibrium Modeling

Pages:1240–1267

Published Online:December 1, 1984

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

An Efficient Algorithm for Computing Optimal (s, S) Policies

Pages:1268–1285

Published Online:December 1, 1984

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

Production-Inventory with Equipment Replacement—PIER

Pages:1286–1295

Published Online:December 1, 1984

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

Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions

Pages:1296–1308

Published Online:December 1, 1984

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

Some Properties of Location Problems with Block and Round Norms

Pages:1309–1327

Published Online:December 1, 1984

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

A Separating Choice Hyperplane Algorithm for Evaluating Multiattribute Decisions

Pages:1328–1344

Published Online:December 1, 1984

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

Nested Renewal Processes with Special Erlangian Densities

Pages:1345–1357

Published Online:December 1, 1984

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

Realizable Performance Vectors of a Finite-Source Queue

Pages:1358–1367

Published Online:December 1, 1984

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

Free Access
Technical Note—A Note on the M/G/1 Queue with Server Vacations

Pages:1368–1373

Published Online:December 1, 1984

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

Free Access
Technical Note—Financial Market Approaches to Facility Location under Uncertainty

Pages:1374–1380

Published Online:December 1, 1984

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

Free Access
Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming

Pages:1381–1384

Published Online:December 1, 1984

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

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.