A Queuing-Linear Programming Approach to Scheduling Police Patrol Cars

Pages:1045–1062

Published Online:December 1, 1975

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

Optimal Doubling in Backgammon

Pages:1063–1071

Published Online:December 1, 1975

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

On Competitive Bidding

Pages:1072–1079

Published Online:December 1, 1975

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

Optimal Bidding in Sequential Auctions

Pages:1080–1090

Published Online:December 1, 1975

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

Optimization Problems Subject to a Budget Constraint with Economies of Scale

Pages:1091–1098

Published Online:December 1, 1975

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

Merging and Sorting Applied to the Zero-One Knapsack Problem

Pages:1099–1109

Published Online:December 1, 1975

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

An Algorithm for the Solution of 0-1 Loading Problems

Pages:1110–1119

Published Online:December 1, 1975

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

A Stochastic Sequential Allocation Model

Pages:1120–1130

Published Online:December 1, 1975

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

A Discrete Time Inventory Model with Arbitrary Interval and Quantity Distributions of Demand

Pages:1131–1142

Published Online:December 1, 1975

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

Application of a Functional Equation to a Class of Stochastic Detection Models

Pages:1143–1154

Published Online:December 1, 1975

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

Approximate Solutions for Some Two-Stage Tandem Queues, Part 1: Individual Arrivals at the Second Stage

Pages:1155–1166

Published Online:December 1, 1975

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

Free Access
Technical Note—Bench Marks Comparing Transportation Codes based on Primal Simplex and Primal-Dual Algorithms

Pages:1167–1172

Published Online:December 1, 1975

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

Free Access
Technical Note—Capacity Expansion in Convex Cost Networks with Uncertain Demand

Pages:1172–1178

Published Online:December 1, 1975

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

Free Access
Technical Note—A Note on the Busy Period of an M/G/1 Finite Queue

Pages:1179–1182

Published Online:December 1, 1975

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

Free Access
Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem

Pages:1183–1191

Published Online:December 1, 1975

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

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.