Author:
Barros Bruno José S.,Ochi Luiz Satoru,Pinheiro Rian Gabriel S.,Souza Uéverton S.
Publisher
Springer International Publishing
Reference16 articles.
1. Capua, R., Frota, Y., Ochi, L.S., Vidal, T.: A study on exponential-size neighborhoods for the bin packing problem with conflicts. J. Heuristics 24(4), 667–695 (2018). https://doi.org/10.1007/s10732-018-9372-2
2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);A Darmann,2009
3. Darmann, A., Pferschy, U., Schauer, J., Woeginger, G.J.: Paths, trees and matchings under disjunctive constraints. Discret. Appl. Math. 159(16), 1726–1735 (2011)
4. Dhanalakshmi, S., Sadagopan, N., Manogna, V.: On 2K2-free graphs. Int. J. Pure Appl. Math. 109(7), 167–173 (2016)
5. Viana, L., Campêlo, M., Sau, I., Silva, A.: A unifying model for locally constrained spanning tree problems. J. Comb. Optim. 42(1), 125–150 (2021). https://doi.org/10.1007/s10878-021-00740-2
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献