An Applicable Model of Optimal Marketing Policy

Pages:401–412

Published Online:April 1, 1973

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

Computed School Assignments in a Large District

Pages:413–426

Published Online:April 1, 1973

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

The Progress of Management-Science Activities in Large US Industrial Corporations

Pages:427–450

Published Online:April 1, 1973

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

The Relation between Formal Procedures for Pursuing OR/MS Activities and OR/MS Group Success

Pages:451–474

Published Online:April 1, 1973

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

An Empirical Investigation of Optimum-Seeking in the Computer Simulation Situation

Pages:475–497

Published Online:April 1, 1973

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

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

Pages:498–516

Published Online:April 1, 1973

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

Maximal, Lexicographic, and Dynamic Network Flows

Pages:517–527

Published Online:April 1, 1973

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

Calculating Maximal Flows in a Network with Positive Gains

Pages:528–541

Published Online:April 1, 1973

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

Sequencing Expansion Projects

Pages:542–553

Published Online:April 1, 1973

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

Response-Variance Tradeoffs in Adaptive Forecasting

Pages:554–568

Published Online:April 1, 1973

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

Processor Utilization in Multiprogramming Systems via Diffusion Approximations

Pages:569–576

Published Online:April 1, 1973

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

The Rearrangement of Items in a Warehouse

Pages:577–589

Published Online:April 1, 1973

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

Optimal Defensive Missile Allocation: A Discrete Min-Max Problem

Pages:590–596

Published Online:April 1, 1973

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

On Two-Server Poisson Queues with Two Types of Customers

Pages:597–603

Published Online:April 1, 1973

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

A Queuing-Type Birth-and-Death Process Defined on a Continuous-Time Markov Chain

Pages:604–609

Published Online:April 1, 1973

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

Single-Server Queues with Service Time Dependent on Waiting Time

Pages:610–616

Published Online:April 1, 1973

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

On the Ergodic Theory of Markov Chains

Pages:617–622

Published Online:April 1, 1973

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

A k-Server Queue with Phase Input and Service Distribution

Pages:623–628

Published Online:April 1, 1973

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

Distribution-Free Analysis of M/G/1 and G/M/1 Queues

Pages:629–635

Published Online:April 1, 1973

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

Free Access
Technical Note—Distribution of the Mean Queue Size for the Time-Dependent Queue

Pages:636–638

Published Online:April 1, 1973

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

Free Access
Technical Note—How to Win by Losing

Pages:639–643

Published Online:April 1, 1973

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

Free Access
Technical Note—Economic Packaging Frequency for Items Jointly Replenished

Pages:644–647

Published Online:April 1, 1973

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

Free Access
Technical Note—Comment on an Integer Maximization Problem

Pages:648–650

Published Online:April 1, 1973

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

Free Access
Technical Note—A Note on Lipstein's Model of Consumer Behavior

Pages:650–652

Published Online:April 1, 1973

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

Free Access
Errata

Pages:653–653

Published Online:April 1, 1973

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

Free Access
The Analyst's Bookshelf

Pages:654–658

Published Online:April 1, 1973

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

Free Access
Books Received

Pages:658–659

Published Online:April 1, 1973

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

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.