PAGP, A Partitioning Algorithm for (Linear) Goal Programming Problems

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Jeffrey L. Arthur Department of Statistics, Oregon State University, Corvalhs, OR
A. Ravindran School of Industrial Engineering, Purdue University, West Lafayette, IN
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 6 Issue 3, Sept. 1980
Pages 378-386
ACM New York, NY, USA
table of contents doi>10.1145/355900.355909
PAGP, A Partitioning Algorithm for (Linear) Goal Programming Problems Published by ACM 1980 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 31
· Downloads (cumulative): 367
· Citation Count: 3


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder