Selective Incapacitation Strategies Based on Estimated Crime Rates

Pages:1259–1274

Published Online:December 1, 1980

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

Optimal Search for a Moving Target in Discrete Time and Space

Pages:1275–1289

Published Online:December 1, 1980

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

Search-Evasion Game in a Fixed Region

Pages:1290–1298

Published Online:December 1, 1980

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

Expected Coverage of a Randomly Located Target by Multiple Independent Salvos

Pages:1299–1318

Published Online:December 1, 1980

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

Optimal Stopping in a Partially Observable Markov Process with Costly Information

Pages:1319–1334

Published Online:December 1, 1980

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

A Queueing System in Which Customers Require a Random Number of Servers

Pages:1335–1346

Published Online:December 1, 1980

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

A Dynamic Programming Approach for Sequencing Groups of Identical Jobs

Pages:1347–1359

Published Online:December 1, 1980

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

A Natural Gas Flow Model under Uncertainty in Demand

Pages:1360–1374

Published Online:December 1, 1980

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

DISCON: A New Method for the Layout Problem

Pages:1375–1384

Published Online:December 1, 1980

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

A Maxmin Location Problem

Pages:1385–1401

Published Online:December 1, 1980

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

Hard Knapsack Problems

Pages:1402–1411

Published Online:December 1, 1980

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

The Linear Multiple Choice Knapsack Problem

Pages:1412–1423

Published Online:December 1, 1980

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

A Tradeoff Cut Approach to Multiple Objective Optimization

Pages:1424–1435

Published Online:December 1, 1980

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

Free Access
Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times

Pages:1436–1441

Published Online:December 1, 1980

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

Free Access
Technical Note—Generalized Covering Relaxation for 0-1 Programs

Pages:1442–1450

Published Online:December 1, 1980

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

Free Access
Technical Note—Improved Bounds for Aggregated Linear Programs

Pages:1450–1453

Published Online:December 1, 1980

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

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.