Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference38 articles.
1. Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks;Afrashteh;Ann. Oper. Res.,2020
2. Lagrangian and branch-and-cut approaches for upgrading spanning tree problems;Alvarez-Miranda;Comput. Oper. Res.,2017
3. Applegate, F., Bixby, R., Chvátal, V., Cook, W., 1995. Finding Cuts in the TSP (a Preliminary Report). DIMACS Technical Report 95-05.
4. Upgrading edges in the Maximal Covering Location Problem;Baldomero-Naranjo;European J. Oper. Res.,2022
5. On the cycle polytope of a binary matroid;Barahona;J. Combin. Theory B,1986
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献