Systems Analysis for Social Decisions

Pages:927–940

Published Online:December 1, 1969

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

Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

Pages:941–957

Published Online:December 1, 1969

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

Production Allocation with Set-Up Penalties and Concave Material Costs

Pages:958–972

Published Online:December 1, 1969

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

A New Method for Constrained Optimization Problems

Pages:973–983

Published Online:December 1, 1969

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

A Problem in Optimal Search and Stop

Pages:984–992

Published Online:December 1, 1969

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

A Probabilistic Approach to Solving Assignment Problems

Pages:993–1004

Published Online:December 1, 1969

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

Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem

Pages:1005–1016

Published Online:December 1, 1969

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

A Graph-Theoretic Approach to a Class of Integer-Programming Problems

Pages:1017–1033

Published Online:December 1, 1969

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

A Dynamic Programming Algorithm for Cluster Analysis

Pages:1034–1057

Published Online:December 1, 1969

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

Some Conditions for Ergodicity and Recurrence of Markov Chains

Pages:1058–1061

Published Online:December 1, 1969

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

On a Class of Queuing Problems and Discrete Transforms

Pages:1062–1076

Published Online:December 1, 1969

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

A Time-Sharing Model with Many Queues

Pages:1077–1089

Published Online:December 1, 1969

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

Free Access
The Analyst's Bookshelf

Pages:1090–1092

Published Online:December 1, 1969

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

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.