Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W.H. Freeman and Company, San Francisco (1979)
2. Agarwal, C.C., Orlin, J.B., Tai, R.P.: Optimized crossover for the independent set problem. Working paper # 3787-95. MIT, Cambridge (1995)
3. Balas, E., Niehaus, W.: Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems. J. Heur. 4(2), 107–122 (1998)
4. Borisovsky, P., Dolgui, A., Eremeev, A.: Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder. Eur. J. Oper. Res. 195(3), 770–779 (2009)
5. Cook, W., Seymour, P.: Tour merging via branch-decomposition. INFORMS J. Comput. 15(2), 233–248 (2003)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献