Interior Path Methods for Heuristic Integer Programming Procedures

Pages:1069–1087

Published Online:December 1, 1979

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

A Dynamic Priority Queue with General Concave Priority Functions

Pages:1088–1100

Published Online:December 1, 1979

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

New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem

Pages:1101–1114

Published Online:December 1, 1979

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

Approximations of the Mean Waiting Time in an M/G/s Queueing System

Pages:1115–1127

Published Online:December 1, 1979

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

A Method of Decomposition for Integer Programs

Pages:1128–1141

Published Online:December 1, 1979

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

Bayes Estimation of Reliability Using an Estimated Prior Distribution

Pages:1142–1157

Published Online:December 1, 1979

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

The Age Replacement Problem with Minimal Repair and Random Repair Costs

Pages:1158–1167

Published Online:December 1, 1979

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

Qualitative Properties and Bounds for the Serial Covariances of Waiting Times in Single-Server Queues

Pages:1168–1179

Published Online:December 1, 1979

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

Free Access
Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm

Pages:1180–1188

Published Online:December 1, 1979

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

Free Access
Technical Note—A Generalized Maximum Entropy Principle

Pages:1188–1196

Published Online:December 1, 1979

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

Free Access
Technical Note—Response Time Distribution of the M/M/m/N Queueing Model

Pages:1196–1202

Published Online:December 1, 1979

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

Free Access
Technical Note—An Adjustment to the Norman-White Approach to Approximating Dynamic Programs

Pages:1203–1208

Published Online:December 1, 1979

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

Free Access
Technical Note—Approximations for Overflows from Queues with a Finite Waiting Room

Pages:1208–1216

Published Online:December 1, 1979

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

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.