Help
Cart
Skip main navigation

Available Issues

April 16, 2013 - May 25, 2026

Available Issues

April 16, 2013 - May 25, 2026

Free Access
In This Issue

Pages:166–168

Published Online:April 1, 1987

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

Free Access
OR Practice—A Utility Fuel Inventory Model

Pages:169–184

Published Online:April 1, 1987

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

Preview Abstract
Derived Demand and Capacity Planning Under Uncertainty

Pages:185–197

Published Online:April 1, 1987

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

Preview Abstract
The Role of External Search in Bilateral Bargaining

Pages:198–205

Published Online:April 1, 1987

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

Preview Abstract
Constant Exchange Risk Properties

Pages:206–214

Published Online:April 1, 1987

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

Preview Abstract
Aggregation in Dynamic Programming

Pages:215–220

Published Online:April 1, 1987

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

Preview Abstract
The P-Centroid Problem on an Inclined Plane

Pages:221–233

Published Online:April 1, 1987

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

Preview Abstract
The Role of Cost Allocation in Locational Models

Pages:234–248

Published Online:April 1, 1987

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

Preview Abstract
Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities

Pages:249–253

Published Online:April 1, 1987

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

Preview Abstract
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

Pages:254–265

Published Online:April 1, 1987

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

Preview Abstract
Vehicle Routing with Time Windows

Pages:266–273

Published Online:April 1, 1987

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

Preview Abstract
Inventory Policy in the Presence of Market Disruptions

Pages:274–281

Published Online:April 1, 1987

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

Preview Abstract
A Method to Calculate Steady-State Distributions of Large Markov Chains by Aggregating States

Pages:282–290

Published Online:April 1, 1987

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

Preview Abstract
An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking

Pages:291–305

Published Online:April 1, 1987

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

Preview Abstract
Comparison of Policies for Routing Customers to Parallel Queueing Systems

Pages:306–310

Published Online:April 1, 1987

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

Preview Abstract
Free Access
Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines

Pages:311–313

Published Online:April 1, 1987

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

Preview Abstract
Free Access
OR Forum—Presidents' Symposium: Science and Professionalism in Operations Research

Pages:314–319

Published Online:April 1, 1987

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

Preview Abstract
Free Access
OR Forum—President's Symposium: A Perspective on the Future of Operations Research

Pages:320–321

Published Online:April 1, 1987

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

Preview Abstract
Free Access
Contributors

Pages:322–324

Published Online:April 1, 1987

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

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