G. L. Nemhauser and L. A. Wolsey

Best Algorithms for Approximating the Maximum of a Submodular Set Function
MATHEMATICS OF OPERATIONS RESEARCH 1978 3: 177-188. [Abstract] [PDF]  

Nimrod Megiddo

Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
MATHEMATICS OF OPERATIONS RESEARCH 1978 3: 189-196. [Abstract] [PDF]  

Oscar H. Ibarra and Chul E. Kim

Approximation Algorithms for Certain Scheduling Problems
MATHEMATICS OF OPERATIONS RESEARCH 1978 3: 197-204. [Abstract] [PDF]  

Elja Arjas and Tapani Lehtonen

Approximating Many Server Queues by Means of Single Server Queues
MATHEMATICS OF OPERATIONS RESEARCH 1978 3: 205-223. [Abstract] [PDF]  

David W. Walkup

The Hirsch Conjecture Fails for Triangulated 27-Spheres
MATHEMATICS OF OPERATIONS RESEARCH 1978 3: 224-230. [Abstract] [PDF]  

Ward Whitt

Approximations of Dynamic Programs, I
MATHEMATICS OF OPERATIONS RESEARCH 1978 3: 231-243. [Abstract] [PDF]  

David F. Shanno

Conjugate Gradient Methods with Inexact Searches
MATHEMATICS OF OPERATIONS RESEARCH 1978 3: 244-256. [Abstract] [PDF]  

Robert James Weber

Attainable Sets of Quasiconcave Markets, II: Convexifiable Sets
MATHEMATICS OF OPERATIONS RESEARCH 1978 3: 257-264. [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.