Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Wided Ouaja Imperial College London, London, UK
Barry Richards Imperial College London, London, UK
Published in:
Cover Image
 
· Proceeding
SAC '05 Proceedings of the 2005 ACM symposium on Applied computing
Pages 383-387
ACM New York, NY, USA ©2005
table of contents ISBN:1-58113-964-0 doi>10.1145/1066677.1066766
Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 14
· Downloads (cumulative): 218
· 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