Author:
Gollowitzer Stefan,Pereira Dilson Lucas,Wojciechowski Adam
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Bauer, P., Linderoth, J., Savelsbergh, M.: A branch and cut approach to the cardinality constrained circuit problem. Mathematical Programming 91(2), 307–348 (2002)
2. Branco, I., Coelho, J.: The Hamiltonian p-median problem. European Journal of Operational Research 47(1), 86–95 (1990)
3. Cerdeira, J.: The hamiltonian k-median problem for any given k is NP-complete. Tech. rep., Centro de Estatistica e Aplicacoes, nota no. 14/86 (1986)
4. Egawa, Y., Hagita, M., Kawarabayashi, K.I., Wang, H.: Covering vertices of a graph by k disjoint cycles. Discrete Mathematics 270(1-3), 115–125 (2003)
5. Glaab, H., Löfflad, S., Pott, A.: Rundreiseprobleme beim halb-automatischen Lederzuschnitt. In: Proceedings of Operations Research 1997, pp. 86–101. Springer, Heidelberg (1998)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献