Help
Cart
Skip main navigation

Available Issues

April 16, 2013 - May 25, 2026

Available Issues

April 16, 2013 - May 25, 2026

Applying Cost-Effectiveness Concepts to the Community Health System

Pages:227–253

Published Online:April 1, 1968

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

Preview Abstract
Sensitivity of Decisions to Probability Estimation Errors: A Reexamination

Pages:254–267

Published Online:April 1, 1968

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

Preview Abstract
Solving the Fixed Charge Problem by Ranking the Extreme Points

Pages:268–279

Published Online:April 1, 1968

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

Preview Abstract
The Allocation of Computer Time in Comparing Simulation Experiments

Pages:280–295

Published Online:April 1, 1968

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

Preview Abstract
A Method for Approximate Solutions to Stochastic Dynamic Programming Problems Using Expectations

Pages:296–306

Published Online:April 1, 1968

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

Preview Abstract
The Pareto Distribution as a Queue Service Discipline

Pages:307–313

Published Online:April 1, 1968

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

Preview Abstract
The Measurement of Combat Effectiveness

Pages:314–323

Published Online:April 1, 1968

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

Preview Abstract
Dual-Resource Constrained Series Service Systems

Pages:324–341

Published Online:April 1, 1968

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

Preview Abstract
Minimum Change-Over Scheduling of Several Products on One Machine

Pages:342–352

Published Online:April 1, 1968

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

Preview Abstract
A Branch-Bound Solution to the General Scheduling Problem

Pages:353–361

Published Online:April 1, 1968

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

Preview Abstract
Optimal Operating Policies for M/G/1 Queuing Systems

Pages:362–382

Published Online:April 1, 1968

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

Preview Abstract
Programming Problems with Convex Fractional Functions

Pages:383–391

Published Online:April 1, 1968

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

Preview Abstract
Optimum Redundancy for Maximum System Reliability by the Method of Convex and Integer Programming

Pages:392–406

Published Online:April 1, 1968

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

Preview Abstract
First Emptiness in the Spare Parts Problem for Reparable Components

Pages:407–415

Published Online:April 1, 1968

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

Preview Abstract
Nonpreemptive Priority Queue with Binomial Input

Pages:416–421

Published Online:April 1, 1968

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

Preview Abstract
Free Access
Letter to the Editor—The Multidimensional Assignment Problem

Pages:422–431

Published Online:April 1, 1968

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

Preview Abstract
Free Access
Letter to the Editor—Stopping Rules for Queuing Simulations

Pages:431–437

Published Online:April 1, 1968

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

Preview Abstract
Free Access
Letter to the Editor—Quasilinearization and Inverse Problems for Lanchester Equations of Conflict

Pages:437–442

Published Online:April 1, 1968

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

Preview Abstract
Free Access
Letter to the Editor—A Note on the Branch-and-Bound Principle

Pages:442–445

Published Online:April 1, 1968

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

Free Access
Letter to the Editor—Computing Two-Commodity Flows

Pages:446–450

Published Online:April 1, 1968

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

Preview Abstract
Free Access
Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem

Pages:450–453

Published Online:April 1, 1968

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

Preview Abstract
Free Access
Letter to the Editor—On King's Note

Pages:453–454

Published Online:April 1, 1968

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

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