Author:
Uchoa Eduardo,Fukasawa Ricardo,Lysgaard Jens,Pessoa Artur,de Aragão Marcus Poggi,Andrade Diogo
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference43 articles.
1. Ahuja R., Orlin J., Sharma D. (2001) Multi-exchange neighborhood search structures for the capacitated minimum spanning tree problem. Math. Program. 91, 71–97
2. Ahuja R., Orlin J., Sharma D. (2003) A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Oper. Res. Lett. 31(3): 185–194
3. Amberg A., Domschke W., Voss S. (1996) Capacitated minimum spanning trees: Algorithms using intelligent search. Comb. Optim. Theory Pract. 1, 9–39
4. Araque J., Hall L., Magnanti T. (1990) Capacitated trees, capacitated routing, and associated polyhedra. Technical Report OR232-90. MIT, Operations Research Center
5. Barahona F., Anbil R. (2000) The volume algorithm: producing primal solutions with a subgradient method. Math. Program. 87, 385–399
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献