Help
Cart
Skip main navigation

Available Issues

April 16, 2013 - May 25, 2026

Available Issues

April 16, 2013 - May 25, 2026

Operations Research in Wartime Naval Mining

Pages:1–10

Published Online:February 1, 1967

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

An Attrition Game

Pages:11–31

Published Online:February 1, 1967

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

Preview Abstract
Two-Dimensional Collision in Parallel Paths

Pages:32–38

Published Online:February 1, 1967

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

Preview Abstract
Solving Bicriterion Mathematical Programs

Pages:39–54

Published Online:February 1, 1967

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

Preview Abstract
Two-Stage Programming under Uncertainty with Discrete Distribution Function

Pages:55–70

Published Online:February 1, 1967

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

Preview Abstract
A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop

Pages:71–82

Published Online:February 1, 1967

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

Preview Abstract
Methods for the Solution of the Multidimensional 0/1 Knapsack Problem

Pages:83–103

Published Online:February 1, 1967

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

Preview Abstract
Time Dependent Priority Queues

Pages:104–116

Published Online:February 1, 1967

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

Preview Abstract
Queues with State-Dependent Stochastic Service Rates

Pages:117–130

Published Online:February 1, 1967

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

Preview Abstract
Stream of Overflows from a Finite Queue

Pages:131–134

Published Online:February 1, 1967

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

Preview Abstract
Comparing a Scheduled Process with an Analogous Poisson Process

Pages:135–138

Published Online:February 1, 1967

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

Preview Abstract
A Discrete Version of Pontryagin's Maximum Principle

Pages:139–146

Published Online:February 1, 1967

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

Preview Abstract
The Supporting Hyperplane Method for Unimodal Programming

Pages:147–152

Published Online:February 1, 1967

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

Preview Abstract
Free Access
Letter to the Editor—Computational Experience with the Algorithm of Balas

Pages:153–155

Published Online:February 1, 1967

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

Preview Abstract
Free Access
Letter to the Editor—Stronger Cuts in Gomory's All-Integer Integer Programming Algorithm

Pages:155–157

Published Online:February 1, 1967

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

Preview Abstract
Free Access
Letter to the Editor—Comments on “Reliability Considerations for a Two Element Redundant System with Generalized Repair Times”

Pages:157–159

Published Online:February 1, 1967

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

Preview Abstract
Free Access
Letter to the Editor—Circular Distribution Estimation

Pages:160–165

Published Online:February 1, 1967

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

Preview Abstract
Free Access
Letter to the Editor—Kill Probability for Multiple Shots

Pages:165–169

Published Online:February 1, 1967

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

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

Pages:169–170

Published Online:February 1, 1967

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

Preview Abstract
Free Access
Letter to the Editor—On the Convexity of Quadratic Forms Over Convex Sets

Pages:170–172

Published Online:February 1, 1967

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

Free Access
The Analyst's Bookshelf

Pages:173–181

Published Online:February 1, 1967

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

Preview Abstract
Free Access
Books Received

Pages:181–182

Published Online:February 1, 1967

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

Free Access
Notes

Pages:182–183

Published Online:February 1, 1967

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

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