Author:
Agarwala Richa,Fernández-Baca David
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. M. Ajtai, J. Komlós, and E. Szemerédi: A O(n log n) sorting network. Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp 1–9, 1983.
2. Y. P. Aneja and S. N. Kabadi: Polynomial algorithms for lagrangean relaxations in combinatorial problems (Manuscript).
3. D. Bertsimas and J.B. Orlin: A technique for speeding up the solution of the Lagrangean dual. In proceedings of IPCO 92.
4. P.M. Camerini, F. Maffioli, and C. Vercellis: Multi-constrained matroidal knapsack problems. Mathematical Programming 45:211–231 (1989).
5. V. Chvátal: Linear Programming. W.H. Freeman, San Francisco 1983.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献