Using adaptive memory in GRASP to find minimum conflict-free spanning trees-Reference-Cited by-同舟云学术

Using adaptive memory in GRASP to find minimum conflict-free spanning trees

Published:2022-11-13 Issue:8 Volume:27 Page:4699-4712
ISSN:1432-7643
Container-title:Soft Computing
language:en
Short-container-title:Soft Comput

Author:

da Silva Barros Bruno José^ORCID,Pinheiro Rian Gabriel S.,Souza Uéverton S.,Ochi Luiz Satoru

Funder

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Publisher

Springer Science and Business Media LLC

Subject

Geometry and Topology,Theoretical Computer Science,Software

Link

https://link.springer.com/content/pdf/10.1007/s00500-022-07602-x.pdf

Reference31 articles.

1. Aiex RM, Resende MGC, Ribeiro CC (2007) Ttt plots: a Perl program to create time-to-target plots. Optim Lett 1(4):355–366. https://doi.org/10.1007/s11590-006-0031-4

2. Barbosa MAL, Delbem ACB (2017) A iterated local search for the minimum spanning tree under conflict constraints (published in portuguese). In: Annals of XLVIII Brazilian symposium of operational research (Anais do XLIII Simpósio Brasileiro de Pesquisa Operacional), pp 2533–2544

3. Binato S, Hery WJ, Loewenstern DM, Resende MG (2000) A grasp for job shop scheduling. Essays Surv Metaheur. https://doi.org/10.1007/978-1-4615-1507-4_3

4. Bittencourt YB, Campêlo M, Dias FCS (2016) Mtz formulation for minimum spanning tree under conflict constraints (published in portuguese). In: Annals of XLIII Brazilian symposium of operational research (Anais do XLVIII Simpósio Brasileiro de Pesquisa Operacional), pp 2441–2448

5. Bresina JL (1996) Heuristic-biased stochastic sampling. In: Clancey WJ, Weld DS (eds) Proceedings of the 13th national conference on artificial intelligence and 8th innovative applications of artificial intelligence conference, AAAI 96, IAAI 96, Portland, Oregon, USA, August 4–8, vol 1. AAAI Press/The MIT Press, pp 271–278