Jan M. Chaiken and John E. Rolph

Selective Incapacitation Strategies Based on Estimated Crime Rates
OPERATIONS RESEARCH 1980 28: 1259-1274. [Abstract] [PDF]  

Scott Shorey Brown

Optimal Search for a Moving Target in Discrete Time and Space
OPERATIONS RESEARCH 1980 28: 1275-1289. [Abstract] [PDF]  

Alan R. Washburn

Search-Evasion Game in a Fixed Region
OPERATIONS RESEARCH 1980 28: 1290-1298. [Abstract] [PDF]  

Gerhard Schroeter

Expected Coverage of a Randomly Located Target by Multiple Independent Salvos
OPERATIONS RESEARCH 1980 28: 1299-1318. [Abstract] [PDF]  

George E. Monahan

Optimal Stopping in a Partially Observable Markov Process with Costly Information
OPERATIONS RESEARCH 1980 28: 1319-1334. [Abstract] [PDF]  

Linda Green

A Queueing System in Which Customers Require a Random Number of Servers
OPERATIONS RESEARCH 1980 28: 1335-1346. [Abstract] [PDF]  

Harilaos N. Psaraftis

A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
OPERATIONS RESEARCH 1980 28: 1347-1359. [Abstract] [PDF]  

Reuven R. Levary and Burton V. Dean

A Natural Gas Flow Model under Uncertainty in Demand
OPERATIONS RESEARCH 1980 28: 1360-1374. [Abstract] [PDF]  

Zvi Drezner

DISCON: A New Method for the Layout Problem
OPERATIONS RESEARCH 1980 28: 1375-1384. [Abstract] [PDF]  

B. Dasarathy and Lee J. White

A Maxmin Location Problem
OPERATIONS RESEARCH 1980 28: 1385-1401. [Abstract] [PDF]  

Vasek Chvátal

Hard Knapsack Problems
OPERATIONS RESEARCH 1980 28: 1402-1411. [Abstract] [PDF]  

Eitan Zemel

The Linear Multiple Choice Knapsack Problem
OPERATIONS RESEARCH 1980 28: 1412-1423. [Abstract] [PDF]  

K. Musselman and Joseph Talavage

A Tradeoff Cut Approach to Multiple Objective Optimization
OPERATIONS RESEARCH 1980 28: 1424-1435. [Abstract] [PDF]  

C. N. Potts

Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
OPERATIONS RESEARCH 1980 28: 1436-1441. [Abstract] [PDF]  

Daniel Granot and Frieda Granot

Technical Note—Generalized Covering Relaxation for 0-1 Programs
OPERATIONS RESEARCH 1980 28: 1442-1450. [Abstract] [PDF]  

Roy Mendelssohn

Technical Note—Improved Bounds for Aggregated Linear Programs
OPERATIONS RESEARCH 1980 28: 1450-1453. [Abstract] [PDF]  

To see an article, click its [Full Text] or [PDF] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Get All Checked Abstract(s)' button. To see one abstract at a time, click its [Abstract] link.