Author:
Gouveia Luis,Paias Ana,Sharma Dushyant
Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference9 articles.
1. Dahl G, Gouveia L, Requejo C. On formulations and methods for the hop-constrained minimum spanning tree problem. In: Mauricio Resende, Panos Pardalos., editors, Handbook of Optimization in Telecommunications, Springer 2006, pp. 493–515.
2. Optimal trees in network models;Magnanti;Handbooks in Operations Research and Management Science,1996
3. Multicommodity network-flow problem with side constraints on paths solved by column generation;Holmberg;INFORMS Journal on Computing,2003
4. Improved preprocessing, labeling and scaling algorithms for the weight constrained shortest path problem;Dumitrescu;Networks,2003
5. Lagrangian relaxation for integer programming;Geoffrion;Mathematical Programming Study,1974
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献