Publisher
Springer International Publishing
Reference18 articles.
1. Averbakh, I., Berman, O., Chernykh, I.: A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network. Euro. J. Oper. Res. 166(1), 3–24 (2005). https://doi.org/10.1016/j.ejor.2003.06.050
2. Averbakh, I., Berman, O., Chernykh, I.: The routing open-shop problem on a network: complexity and approximation. Eur. J. Oper. Res. 173(2), 531–539 (2006). https://doi.org/10.1016/j.ejor.2005.01.034
3. van Bevern, R., Slugina, V.A.: A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem. Hist. Math. 53, 118–127 (2020). https://doi.org/10.1016/j.hm.2020.04.003
4. Chernykh, I., Kononov, A.V., Sevastyanov, S.: Efficient approximation algorithms for the routing open shop problem. Comput. Oper. Res. 40(3), 841–847 (2013). https://doi.org/10.1016/j.cor.2012.01.006
5. Chernykh, I., Krivonogiva, O.: Optima localization for the two-machine routing open shop on a tree (in Russian) (2021), submitted to Diskretnyj Analiz i Issledovanie Operacij
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献