ReP USP - Resultado da busca

Trabalho de evento
Improving an exact solver for the Traveling Salesman Problem using partition crossover (2017)
Sanches, Danilo; Whitley, Darrell; Tinós, Renato
Source: Proceedings. Conference titles: Genetic and Evolutionary Computation Conference (GECCO). Unidade: FFCLRP
Subjects: INTELIGÊNCIA ARTIFICIAL, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SANCHES, Danilo e WHITLEY, Darrell e TINÓS, Renato. Improving an exact solver for the Traveling Salesman Problem using partition crossover. 2017, Anais.. Berlin: ACM, 2017. Disponível em: https://doi.org/10.1145/3071178.3071304. Acesso em: 19 nov. 2024.
APA
Sanches, D., Whitley, D., & Tinós, R. (2017). Improving an exact solver for the Traveling Salesman Problem using partition crossover. In Proceedings. Berlin: ACM. doi:10.1145/3071178.3071304
NLM
Sanches D, Whitley D, Tinós R. Improving an exact solver for the Traveling Salesman Problem using partition crossover [Internet]. Proceedings. 2017 ;[citado 2024 nov. 19 ] Available from: https://doi.org/10.1145/3071178.3071304
Vancouver
Sanches D, Whitley D, Tinós R. Improving an exact solver for the Traveling Salesman Problem using partition crossover [Internet]. Proceedings. 2017 ;[citado 2024 nov. 19 ] Available from: https://doi.org/10.1145/3071178.3071304
Trabalho de evento
Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search (2017)
Chicano, Francisco; Ochoa, Gabriela; Whitley, Darrell; Tinós, Renato
Source: Proceedings. Conference titles: Genetic and Evolutionary Computation Conference (GECCO). Unidade: FFCLRP
Subjects: INTELIGÊNCIA ARTIFICIAL, APRENDIZADO COMPUTACIONAL, HEURÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHICANO, Francisco et al. Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. 2017, Anais.. Berlin: ACM, 2017. Disponível em: https://doi.org/10.1145/3071178.3071285. Acesso em: 19 nov. 2024.
APA
Chicano, F., Ochoa, G., Whitley, D., & Tinós, R. (2017). Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search. In Proceedings. Berlin: ACM. doi:10.1145/3071178.3071285
NLM
Chicano F, Ochoa G, Whitley D, Tinós R. Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search [Internet]. Proceedings. 2017 ;[citado 2024 nov. 19 ] Available from: https://doi.org/10.1145/3071178.3071285
Vancouver
Chicano F, Ochoa G, Whitley D, Tinós R. Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search [Internet]. Proceedings. 2017 ;[citado 2024 nov. 19 ] Available from: https://doi.org/10.1145/3071178.3071285
Trabalho de evento
Building a better heuristic for the traveling salesman problem (2017)
Sanches, Danilo; Whitley, Darrell; Tinós, Renato
Source: Proceedings. Conference titles: Genetic and Evolutionary Computation Conference (GECCO). Unidade: FFCLRP
Subjects: OTIMIZAÇÃO COMBINATÓRIA, ESTUDOS RANDOMIZADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SANCHES, Danilo e WHITLEY, Darrell e TINÓS, Renato. Building a better heuristic for the traveling salesman problem. 2017, Anais.. Berlin: ACM, 2017. Disponível em: https://doi.org/10.1145/3071178.3071305. Acesso em: 19 nov. 2024.
APA
Sanches, D., Whitley, D., & Tinós, R. (2017). Building a better heuristic for the traveling salesman problem. In Proceedings. Berlin: ACM. doi:10.1145/3071178.3071305
NLM
Sanches D, Whitley D, Tinós R. Building a better heuristic for the traveling salesman problem [Internet]. Proceedings. 2017 ;[citado 2024 nov. 19 ] Available from: https://doi.org/10.1145/3071178.3071305
Vancouver
Sanches D, Whitley D, Tinós R. Building a better heuristic for the traveling salesman problem [Internet]. Proceedings. 2017 ;[citado 2024 nov. 19 ] Available from: https://doi.org/10.1145/3071178.3071305

USP Schools

ReP

Filtros

Funding Agencies

Non normalized affiliation