The ABC's of OR

Pages:1259–1281

Published Online:October 1, 1971

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

A Motivational Profile of Management Scientists

Pages:1282–1299

Published Online:October 1, 1971

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

Toward an Integrated Methodology for the Analysis of Health-Care Systems

Pages:1300–1322

Published Online:October 1, 1971

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

The Theorem of the Alternative in Social Choice Theory

Pages:1323–1330

Published Online:October 1, 1971

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

A Search Model for Evaluating Combinatorially Explosive Problems

Pages:1331–1349

Published Online:October 1, 1971

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

An Ordering Algorithm for Analysis of Data Arrays

Pages:1350–1362

Published Online:October 1, 1971

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

The Location of Emergency Service Facilities

Pages:1363–1373

Published Online:October 1, 1971

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

Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions

Pages:1374–1392

Published Online:October 1, 1971

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

Hypercylindrically Deduced Cuts in Zero-One Integer Programs

Pages:1393–1405

Published Online:October 1, 1971

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

An all Zero-One Algorithm for a Certain Class of Transportation Problems

Pages:1406–1418

Published Online:October 1, 1971

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

The Solution of an Optimal Control Problem in Financial Modeling

Pages:1419–1433

Published Online:October 1, 1971

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

Stochastic Prices in a Single-Item Inventory Purchasing Model

Pages:1434–1458

Published Online:October 1, 1971

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

Solution Method for a Class of Stochastic Scheduling Problems for the Production of a Single Commodity

Pages:1459–1466

Published Online:October 1, 1971

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

A Multi-Item Inventory Model with Joint Backorder Criterion

Pages:1467–1476

Published Online:October 1, 1971

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

An Algorithm to Solve Finite Separable Single-Constrained Optimization Problems

Pages:1477–1493

Published Online:October 1, 1971

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

The Distribution of the Occupation Time for Single-Server Queues

Pages:1494–1501

Published Online:October 1, 1971

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

A Model of the ABM-vs.-RV Engagement with Imperfect RV Discrimination

Pages:1502–1517

Published Online:October 1, 1971

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

Free Access
Technical Note—A Counterexample to the Rudimentary Primal Integer Programming Algorithm

Pages:1518–1522

Published Online:October 1, 1971

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

Free Access
Technical Note—Complementary Programming

Pages:1523–1529

Published Online:October 1, 1971

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

Free Access
Technical Note—Exact Solution of the Fixed-Charge Transportation Problem

Pages:1529–1538

Published Online:October 1, 1971

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

Free Access
Technical Note—A Note on Gomory Fractional Cuts

Pages:1538–1541

Published Online:October 1, 1971

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

Free Access
Errata

Pages:1542–1542

Published Online:October 1, 1971

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

Free Access
Errata

Pages:1543–1543

Published Online:October 1, 1971

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

Free Access
The Analyst's Bookshelf

Pages:1544–1549

Published Online:October 1, 1971

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

Free Access
Books Received

Pages:1549–1551

Published Online:October 1, 1971

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

Free Access
Notes

Pages:1551–1551

Published Online:October 1, 1971

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

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.