Faster algorithms for the quickest transshipment problem with zero transit times

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: L. Fleischer Department of Industrial Engineering and Operations Research, Columbia University
Published in:
· Proceeding
SODA '98 Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Pages 147-156
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1998
table of contents ISBN:0-89871-410-9
Faster algorithms for the quickest transshipment problem with zero transit times 1998 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 19
· Downloads (cumulative): 315
· Citation Count: 2


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