A Survey of Linear Cost Multicommodity Network Flows

Pages:209–236

Published Online:April 1, 1978

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

Using Simulation to Develop and Validate Analytic Models: Some Case Studies

Pages:237–253

Published Online:April 1, 1978

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

An Interactive Multiple-Objective Linear Programming Approach to a Problem in Forest Management

Pages:254–269

Published Online:April 1, 1978

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

Optimum Solution Structure for a Repairable Inventory Problem

Pages:270–281

Published Online:April 1, 1978

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

The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs

Pages:282–304

Published Online:April 1, 1978

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

Minimizing a Submodular Function on a Lattice

Pages:305–321

Published Online:April 1, 1978

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

Interactive Identification and Optimization Using a Binary Preference Relation

Pages:322–332

Published Online:April 1, 1978

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

Approximate Transient Analysis of Some Queuing Systems

Pages:333–346

Published Online:April 1, 1978

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

Free Access
Technical Note—On the Expected Performance of Branch-and-Bound Algorithms

Pages:347–349

Published Online:April 1, 1978

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

Free Access
Technical Note—Accelerated Computation of the Expected Discounted Return in a Markov Chain

Pages:350–358

Published Online:April 1, 1978

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

Free Access
Technical Note—An Implementation of Surrogate Constraint Duality

Pages:358–364

Published Online:April 1, 1978

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

Free Access
Technical Note—Dynamic Generalized Upper Bounding

Pages:365–369

Published Online:April 1, 1978

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

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.