Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition

Wided Ouaja, Barry Richards. Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition. In Hisham Haddad, Lorie M. Liebrock, Andrea Omicini, Roger L. Wainwright, editors, Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005. pages 383-387, ACM, 2005. [doi]

@inproceedings{OuajaR05,
  title = {Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition},
  author = {Wided Ouaja and Barry Richards},
  year = {2005},
  doi = {10.1145/1066677.1066766},
  url = {http://doi.acm.org/10.1145/1066677.1066766},
  tags = {routing},
  researchr = {https://researchr.org/publication/OuajaR05},
  cites = {0},
  citedby = {0},
  pages = {383-387},
  booktitle = {Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005},
  editor = {Hisham Haddad and Lorie M. Liebrock and Andrea Omicini and Roger L. Wainwright},
  publisher = {ACM},
  isbn = {1-58113-964-0},
}