Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:( GRASP metaheuristics). Showing records 1 – 21 of 21 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Universidade do Rio Grande do Norte

1. Santos, João Paulo Queiroz dos. Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço .

Degree: 2009, Universidade do Rio Grande do Norte

 The metaheuristics techiniques are known to solve optimization problems classified as NP-complete and are successful in obtaining good quality solutions. They use non-deterministic approaches to… (more)

Subjects/Keywords: Metaheurísticas GRASP; Algoritmos genéticos; Q-learning; Sistemas paralelos e distribuídos; GRASP metaheuristics; Genetic algorithm; Q-learning; Parallel and distributed systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Santos, J. P. Q. d. (2009). Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço . (Masters Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/15221

Chicago Manual of Style (16th Edition):

Santos, João Paulo Queiroz dos. “Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço .” 2009. Masters Thesis, Universidade do Rio Grande do Norte. Accessed June 01, 2020. http://repositorio.ufrn.br/handle/123456789/15221.

MLA Handbook (7th Edition):

Santos, João Paulo Queiroz dos. “Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço .” 2009. Web. 01 Jun 2020.

Vancouver:

Santos JPQd. Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço . [Internet] [Masters thesis]. Universidade do Rio Grande do Norte; 2009. [cited 2020 Jun 01]. Available from: http://repositorio.ufrn.br/handle/123456789/15221.

Council of Science Editors:

Santos JPQd. Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço . [Masters Thesis]. Universidade do Rio Grande do Norte; 2009. Available from: http://repositorio.ufrn.br/handle/123456789/15221


Universidade do Rio Grande do Norte

2. Oliveira Júnior, Edmilson Frank Machado. Aplicação do algoritmo de otimização por colônia de formigas sobre o problema do passeio do robô seletivo .

Degree: 2012, Universidade do Rio Grande do Norte

 This work seeks to propose and evaluate a change to the Ant Colony Optimization based on the results of experiments performed on the problem of… (more)

Subjects/Keywords: Otimização combinatória; Problemas de rotemento, Algoritmos em colônia de formiga; Algoritmos experimentais; Grasp; Vns; Metaheurísticas; Vns; Grasp; Metaheuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Oliveira Júnior, E. F. M. (2012). Aplicação do algoritmo de otimização por colônia de formigas sobre o problema do passeio do robô seletivo . (Masters Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/18048

Chicago Manual of Style (16th Edition):

Oliveira Júnior, Edmilson Frank Machado. “Aplicação do algoritmo de otimização por colônia de formigas sobre o problema do passeio do robô seletivo .” 2012. Masters Thesis, Universidade do Rio Grande do Norte. Accessed June 01, 2020. http://repositorio.ufrn.br/handle/123456789/18048.

MLA Handbook (7th Edition):

Oliveira Júnior, Edmilson Frank Machado. “Aplicação do algoritmo de otimização por colônia de formigas sobre o problema do passeio do robô seletivo .” 2012. Web. 01 Jun 2020.

Vancouver:

Oliveira Júnior EFM. Aplicação do algoritmo de otimização por colônia de formigas sobre o problema do passeio do robô seletivo . [Internet] [Masters thesis]. Universidade do Rio Grande do Norte; 2012. [cited 2020 Jun 01]. Available from: http://repositorio.ufrn.br/handle/123456789/18048.

Council of Science Editors:

Oliveira Júnior EFM. Aplicação do algoritmo de otimização por colônia de formigas sobre o problema do passeio do robô seletivo . [Masters Thesis]. Universidade do Rio Grande do Norte; 2012. Available from: http://repositorio.ufrn.br/handle/123456789/18048


Universidade do Rio Grande do Norte

3. Santos, João Paulo Queiroz dos. Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço .

Degree: 2009, Universidade do Rio Grande do Norte

 The metaheuristics techiniques are known to solve optimization problems classified as NP-complete and are successful in obtaining good quality solutions. They use non-deterministic approaches to… (more)

Subjects/Keywords: Metaheurísticas GRASP; Algoritmos genéticos; Q-learning; Sistemas paralelos e distribuídos; GRASP metaheuristics; Genetic algorithm; Q-learning; Parallel and distributed systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Santos, J. P. Q. d. (2009). Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço . (Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/15221

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Santos, João Paulo Queiroz dos. “Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço .” 2009. Thesis, Universidade do Rio Grande do Norte. Accessed June 01, 2020. http://repositorio.ufrn.br/handle/123456789/15221.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Santos, João Paulo Queiroz dos. “Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço .” 2009. Web. 01 Jun 2020.

Vancouver:

Santos JPQd. Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço . [Internet] [Thesis]. Universidade do Rio Grande do Norte; 2009. [cited 2020 Jun 01]. Available from: http://repositorio.ufrn.br/handle/123456789/15221.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Santos JPQd. Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço . [Thesis]. Universidade do Rio Grande do Norte; 2009. Available from: http://repositorio.ufrn.br/handle/123456789/15221

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade do Rio Grande do Norte

4. Oliveira Júnior, Edmilson Frank Machado. Aplicação do algoritmo de otimização por colônia de formigas sobre o problema do passeio do robô seletivo .

Degree: 2012, Universidade do Rio Grande do Norte

 This work seeks to propose and evaluate a change to the Ant Colony Optimization based on the results of experiments performed on the problem of… (more)

Subjects/Keywords: Otimização combinatória; Problemas de rotemento, Algoritmos em colônia de formiga; Algoritmos experimentais; Grasp; Vns; Metaheurísticas; Vns; Grasp; Metaheuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Oliveira Júnior, E. F. M. (2012). Aplicação do algoritmo de otimização por colônia de formigas sobre o problema do passeio do robô seletivo . (Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/18048

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Oliveira Júnior, Edmilson Frank Machado. “Aplicação do algoritmo de otimização por colônia de formigas sobre o problema do passeio do robô seletivo .” 2012. Thesis, Universidade do Rio Grande do Norte. Accessed June 01, 2020. http://repositorio.ufrn.br/handle/123456789/18048.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Oliveira Júnior, Edmilson Frank Machado. “Aplicação do algoritmo de otimização por colônia de formigas sobre o problema do passeio do robô seletivo .” 2012. Web. 01 Jun 2020.

Vancouver:

Oliveira Júnior EFM. Aplicação do algoritmo de otimização por colônia de formigas sobre o problema do passeio do robô seletivo . [Internet] [Thesis]. Universidade do Rio Grande do Norte; 2012. [cited 2020 Jun 01]. Available from: http://repositorio.ufrn.br/handle/123456789/18048.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Oliveira Júnior EFM. Aplicação do algoritmo de otimização por colônia de formigas sobre o problema do passeio do robô seletivo . [Thesis]. Universidade do Rio Grande do Norte; 2012. Available from: http://repositorio.ufrn.br/handle/123456789/18048

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

5. Fernandes, Susana. Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems.

Degree: 2008, RCAAP

Tese dout., Matemática, Investigação Operacional, Universidade do Algarve, 2009

Scheduling problems have many real life applications, from automotive industry to air traffic control. These problems… (more)

Subjects/Keywords: Metaheuristics; Exact Algorithms; GRASP; Tabu Search; Branch-and-Bound; Valid Inequalities; Scheduling Problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fernandes, S. (2008). Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems. (Thesis). RCAAP. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/1154

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Fernandes, Susana. “Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems.” 2008. Thesis, RCAAP. Accessed June 01, 2020. http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/1154.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Fernandes, Susana. “Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems.” 2008. Web. 01 Jun 2020.

Vancouver:

Fernandes S. Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems. [Internet] [Thesis]. RCAAP; 2008. [cited 2020 Jun 01]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/1154.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fernandes S. Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems. [Thesis]. RCAAP; 2008. Available from: http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/1154

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

6. João Paulo Queiroz dos Santos. Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço.

Degree: 2009, Universidade Federal do Rio Grande do Norte

As metaheurísticas são técnicas conhecidas para a resolução de problemas de otimização, classificados como NP-Completos e vêm obtendo sucesso em soluções aproximadas de boa qualidade.… (more)

Subjects/Keywords: Genetic algorithm; Parallel and distributed systems; Metaheurísticas GRASP; Algoritmos genéticos; Q-learning; Sistemas paralelos e distribuídos; ENGENHARIA ELETRICA; GRASP metaheuristics; Q-learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Santos, J. P. Q. d. (2009). Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço. (Thesis). Universidade Federal do Rio Grande do Norte. Retrieved from http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=2365

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Santos, João Paulo Queiroz dos. “Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço.” 2009. Thesis, Universidade Federal do Rio Grande do Norte. Accessed June 01, 2020. http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=2365.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Santos, João Paulo Queiroz dos. “Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço.” 2009. Web. 01 Jun 2020.

Vancouver:

Santos JPQd. Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço. [Internet] [Thesis]. Universidade Federal do Rio Grande do Norte; 2009. [cited 2020 Jun 01]. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=2365.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Santos JPQd. Uma implementação paralela híbrida para o problema do caixeiro viajante usando algoritmos genéticos, GRASP e aprendizagem por reforço. [Thesis]. Universidade Federal do Rio Grande do Norte; 2009. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=2365

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade Federal de Viçosa

7. Alexandre Fraga de Araújo. Using metaheuristics for solving the irrigation timetabling problem.

Degree: 2010, Universidade Federal de Viçosa

Neste trabalho, propõe-se a utilização de metaheurísticas para a solução do problema de programação de escalas de horários de irrigação, tendo como fatores de influência… (more)

Subjects/Keywords: CIENCIA DA COMPUTACAO; Metaheurísticas; Escala de horários; Engenharia de irrigação; GRASP; ILS; Otimização combinatória; Metaheuristics; Time scale; Irrigation engineering; GRASP; ILS; Combinatorial optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Araújo, A. F. d. (2010). Using metaheuristics for solving the irrigation timetabling problem. (Thesis). Universidade Federal de Viçosa. Retrieved from http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=2602

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Araújo, Alexandre Fraga de. “Using metaheuristics for solving the irrigation timetabling problem.” 2010. Thesis, Universidade Federal de Viçosa. Accessed June 01, 2020. http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=2602.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Araújo, Alexandre Fraga de. “Using metaheuristics for solving the irrigation timetabling problem.” 2010. Web. 01 Jun 2020.

Vancouver:

Araújo AFd. Using metaheuristics for solving the irrigation timetabling problem. [Internet] [Thesis]. Universidade Federal de Viçosa; 2010. [cited 2020 Jun 01]. Available from: http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=2602.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Araújo AFd. Using metaheuristics for solving the irrigation timetabling problem. [Thesis]. Universidade Federal de Viçosa; 2010. Available from: http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=2602

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade Federal de Viçosa

8. Wellington Gomes Ribeiro. Aplicação de metaheurísticas para o problema de cobertura e roteamento em redes de sensores sem fio.

Degree: 2012, Universidade Federal de Viçosa

A Wireless Sensor Network (WSN) consists of automata devices composed of a battery, a process, a memory and a transmission radius and sensing. These devices… (more)

Subjects/Keywords: Heurística; Metaheurísticas; Redes de sensores sem fio; RSSF; ILS; GRASP; CPLEX; CIENCIA DA COMPUTACAO; Heuristics, Metaheuristics; Wireless Sensor Networks; RSSF; ILS; GRASP; CPLEX

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ribeiro, W. G. (2012). Aplicação de metaheurísticas para o problema de cobertura e roteamento em redes de sensores sem fio. (Thesis). Universidade Federal de Viçosa. Retrieved from http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=4485

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ribeiro, Wellington Gomes. “Aplicação de metaheurísticas para o problema de cobertura e roteamento em redes de sensores sem fio.” 2012. Thesis, Universidade Federal de Viçosa. Accessed June 01, 2020. http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=4485.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ribeiro, Wellington Gomes. “Aplicação de metaheurísticas para o problema de cobertura e roteamento em redes de sensores sem fio.” 2012. Web. 01 Jun 2020.

Vancouver:

Ribeiro WG. Aplicação de metaheurísticas para o problema de cobertura e roteamento em redes de sensores sem fio. [Internet] [Thesis]. Universidade Federal de Viçosa; 2012. [cited 2020 Jun 01]. Available from: http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=4485.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ribeiro WG. Aplicação de metaheurísticas para o problema de cobertura e roteamento em redes de sensores sem fio. [Thesis]. Universidade Federal de Viçosa; 2012. Available from: http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=4485

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

9. Esseghir, Mohamed Amir. Metaheuristics for the feature selection problem : adaptive, memetic and swarm approaches : Métaheuristiques pour le problème de sélection d'attributs.

Degree: Docteur es, Génie Informatique et Automatique, 2011, Université d'Artois

Afin d’améliorer la qualité de prédiction des techniques de classification automatique et de fouilles de données, plusieurs modèles ont été proposés dans la littérature en… (more)

Subjects/Keywords: Sélection d'attributs; Métaheuristiques; Classification; Optimisation combinatoire; Algorithmes génétiques; GRASP; PSO; Recherche locale; Feature selection; Metaheuristics; Classification; Combinatorial optimization; Genetic algorithms; GRASP; PSO; Local search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Esseghir, M. A. (2011). Metaheuristics for the feature selection problem : adaptive, memetic and swarm approaches : Métaheuristiques pour le problème de sélection d'attributs. (Doctoral Dissertation). Université d'Artois. Retrieved from http://www.theses.fr/2011ARTO0206

Chicago Manual of Style (16th Edition):

Esseghir, Mohamed Amir. “Metaheuristics for the feature selection problem : adaptive, memetic and swarm approaches : Métaheuristiques pour le problème de sélection d'attributs.” 2011. Doctoral Dissertation, Université d'Artois. Accessed June 01, 2020. http://www.theses.fr/2011ARTO0206.

MLA Handbook (7th Edition):

Esseghir, Mohamed Amir. “Metaheuristics for the feature selection problem : adaptive, memetic and swarm approaches : Métaheuristiques pour le problème de sélection d'attributs.” 2011. Web. 01 Jun 2020.

Vancouver:

Esseghir MA. Metaheuristics for the feature selection problem : adaptive, memetic and swarm approaches : Métaheuristiques pour le problème de sélection d'attributs. [Internet] [Doctoral dissertation]. Université d'Artois; 2011. [cited 2020 Jun 01]. Available from: http://www.theses.fr/2011ARTO0206.

Council of Science Editors:

Esseghir MA. Metaheuristics for the feature selection problem : adaptive, memetic and swarm approaches : Métaheuristiques pour le problème de sélection d'attributs. [Doctoral Dissertation]. Université d'Artois; 2011. Available from: http://www.theses.fr/2011ARTO0206


Universidade do Rio Grande do Sul

10. Silva, Victor Billy da. Otimização volumétrica de gemas de cor utilizadas para lapidação.

Degree: 2013, Universidade do Rio Grande do Sul

O Problema do Lapidário tem como objetivo encontrar o modelo de lapidação que resulte no maior aproveitamento volumétrico para uma dada gema bruta. Nesta dissertação… (more)

Subjects/Keywords: The gemstone cutting problem; Algoritmos geneticos; Otimização volumétrica; Heuristics; Metaheuristics; Continuous global optimization problems; Genetic Algorithms; Continuous GRASP

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Silva, V. B. d. (2013). Otimização volumétrica de gemas de cor utilizadas para lapidação. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/90428

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Silva, Victor Billy da. “Otimização volumétrica de gemas de cor utilizadas para lapidação.” 2013. Thesis, Universidade do Rio Grande do Sul. Accessed June 01, 2020. http://hdl.handle.net/10183/90428.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Silva, Victor Billy da. “Otimização volumétrica de gemas de cor utilizadas para lapidação.” 2013. Web. 01 Jun 2020.

Vancouver:

Silva VBd. Otimização volumétrica de gemas de cor utilizadas para lapidação. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2013. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/10183/90428.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Silva VBd. Otimização volumétrica de gemas de cor utilizadas para lapidação. [Thesis]. Universidade do Rio Grande do Sul; 2013. Available from: http://hdl.handle.net/10183/90428

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Rochester Institute of Technology

11. Skidmore, Gerald. Metaheuristics and combinatorial optimization problems.

Degree: Computer Science (GCCIS), 2006, Rochester Institute of Technology

 This thesis will use the traveling salesman problem (TSP) as a tool to help present and investigate several new techniques that improve the overall performance… (more)

Subjects/Keywords: Genetic algorithms; GRASP; Heuristic crossovers; Hybrid genetic algorithms; Metaheuristics; Population seeding; Random restart

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Skidmore, G. (2006). Metaheuristics and combinatorial optimization problems. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/72

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Skidmore, Gerald. “Metaheuristics and combinatorial optimization problems.” 2006. Thesis, Rochester Institute of Technology. Accessed June 01, 2020. https://scholarworks.rit.edu/theses/72.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Skidmore, Gerald. “Metaheuristics and combinatorial optimization problems.” 2006. Web. 01 Jun 2020.

Vancouver:

Skidmore G. Metaheuristics and combinatorial optimization problems. [Internet] [Thesis]. Rochester Institute of Technology; 2006. [cited 2020 Jun 01]. Available from: https://scholarworks.rit.edu/theses/72.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Skidmore G. Metaheuristics and combinatorial optimization problems. [Thesis]. Rochester Institute of Technology; 2006. Available from: https://scholarworks.rit.edu/theses/72

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

12. Castaño Giraldo , Fabián Andrés. Decomposition-based approaches for the design of energy efficient wireless sensor networks .

Degree: 2013, Universidad de los Andes

 En el disen?o de redes inala?mbricas una de las principales preocupaciones es co?mo hacer un uso eficiente de la energi?a. Estas redes esta?n compuestas de… (more)

Subjects/Keywords: Wireless Sensor Networks; Column Generation; Integer Programming; Metaheuristics; Benders Decomposition; GRASP; VNS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Castaño Giraldo , F. A. (2013). Decomposition-based approaches for the design of energy efficient wireless sensor networks . (Thesis). Universidad de los Andes. Retrieved from http://documentodegrado.uniandes.edu.co/documentos/200913437_fecha_2015_01_26_hora_10_09_01_parte_1.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Castaño Giraldo , Fabián Andrés. “Decomposition-based approaches for the design of energy efficient wireless sensor networks .” 2013. Thesis, Universidad de los Andes. Accessed June 01, 2020. http://documentodegrado.uniandes.edu.co/documentos/200913437_fecha_2015_01_26_hora_10_09_01_parte_1.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Castaño Giraldo , Fabián Andrés. “Decomposition-based approaches for the design of energy efficient wireless sensor networks .” 2013. Web. 01 Jun 2020.

Vancouver:

Castaño Giraldo FA. Decomposition-based approaches for the design of energy efficient wireless sensor networks . [Internet] [Thesis]. Universidad de los Andes; 2013. [cited 2020 Jun 01]. Available from: http://documentodegrado.uniandes.edu.co/documentos/200913437_fecha_2015_01_26_hora_10_09_01_parte_1.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Castaño Giraldo FA. Decomposition-based approaches for the design of energy efficient wireless sensor networks . [Thesis]. Universidad de los Andes; 2013. Available from: http://documentodegrado.uniandes.edu.co/documentos/200913437_fecha_2015_01_26_hora_10_09_01_parte_1.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

13. Paulo Henrique Asconavieta da Silva. O problema do caixeiro viajante alugador : um estudo algorítmico.

Degree: 2011, Universidade Federal do Rio Grande do Norte

O Problema do Caixeiro Alugador (CaRS) é uma variante ainda não descrita na literatura do clássico Problema do Caixeiro Viajante onde o tradicional tour de… (more)

Subjects/Keywords: Memetic algorithm; Ant colony; Computational transgenic; Evolutionary computation; O Problema do caixeiro alugador; Metaheurísticas; GRASP/VND; Colônia de formigas; Computação evolucionária; Algoritmo memético; Transgenética computacional; SISTEMAS DE COMPUTACAO; The car rental salesman problem; Metaheuristics; GRASP/VND

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Silva, P. H. A. d. (2011). O problema do caixeiro viajante alugador : um estudo algorítmico. (Thesis). Universidade Federal do Rio Grande do Norte. Retrieved from http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=5104

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Silva, Paulo Henrique Asconavieta da. “O problema do caixeiro viajante alugador : um estudo algorítmico.” 2011. Thesis, Universidade Federal do Rio Grande do Norte. Accessed June 01, 2020. http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=5104.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Silva, Paulo Henrique Asconavieta da. “O problema do caixeiro viajante alugador : um estudo algorítmico.” 2011. Web. 01 Jun 2020.

Vancouver:

Silva PHAd. O problema do caixeiro viajante alugador : um estudo algorítmico. [Internet] [Thesis]. Universidade Federal do Rio Grande do Norte; 2011. [cited 2020 Jun 01]. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=5104.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Silva PHAd. O problema do caixeiro viajante alugador : um estudo algorítmico. [Thesis]. Universidade Federal do Rio Grande do Norte; 2011. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=5104

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade do Rio Grande do Norte

14. Silva, Paulo Henrique Asconavieta da. O problema do caixeiro viajante alugador : um estudo algorítmico .

Degree: 2011, Universidade do Rio Grande do Norte

 The Car Rental Salesman Problem (CaRS) is a variant of the classical Traveling Salesman Problem which was not described in the literature where a tour… (more)

Subjects/Keywords: O Problema do caixeiro alugador; Metaheurísticas; GRASP/VND; Colônia de formigas; Computação evolucionária; Algoritmo memético; Transgenética computacional; The car rental salesman problem; Metaheuristics; GRASP/VND; Ant colony; Evolutionary computation; Memetic algorithm; Computational transgenic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Silva, P. H. A. d. (2011). O problema do caixeiro viajante alugador : um estudo algorítmico . (Doctoral Dissertation). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/17945

Chicago Manual of Style (16th Edition):

Silva, Paulo Henrique Asconavieta da. “O problema do caixeiro viajante alugador : um estudo algorítmico .” 2011. Doctoral Dissertation, Universidade do Rio Grande do Norte. Accessed June 01, 2020. http://repositorio.ufrn.br/handle/123456789/17945.

MLA Handbook (7th Edition):

Silva, Paulo Henrique Asconavieta da. “O problema do caixeiro viajante alugador : um estudo algorítmico .” 2011. Web. 01 Jun 2020.

Vancouver:

Silva PHAd. O problema do caixeiro viajante alugador : um estudo algorítmico . [Internet] [Doctoral dissertation]. Universidade do Rio Grande do Norte; 2011. [cited 2020 Jun 01]. Available from: http://repositorio.ufrn.br/handle/123456789/17945.

Council of Science Editors:

Silva PHAd. O problema do caixeiro viajante alugador : um estudo algorítmico . [Doctoral Dissertation]. Universidade do Rio Grande do Norte; 2011. Available from: http://repositorio.ufrn.br/handle/123456789/17945


Universidade do Rio Grande do Norte

15. Menezes, Matheus da Silva. O problema do caixeiro alugador com coleta de bonus: um estudo algoritmico .

Degree: 2014, Universidade do Rio Grande do Norte

 This paper introduces a new variant of the Traveling Car Renter Problem, named Prizecollecting Traveling Car Renter Problem. In this problem, a set of vertices,… (more)

Subjects/Keywords: Caixeiro alugador com coleta de prêmios. Metaheurísticas. GRASP/VNS. Algoritmo memético. Transgenética computacional. Computação evolucionária; The Prize Collecting Traveling Car Renter Problem. Metaheuristics. GRASP/VNS. Memetic Algorithm. Computational Transgenetic. Evolutionary Computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Menezes, M. d. S. (2014). O problema do caixeiro alugador com coleta de bonus: um estudo algoritmico . (Doctoral Dissertation). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/18693

Chicago Manual of Style (16th Edition):

Menezes, Matheus da Silva. “O problema do caixeiro alugador com coleta de bonus: um estudo algoritmico .” 2014. Doctoral Dissertation, Universidade do Rio Grande do Norte. Accessed June 01, 2020. http://repositorio.ufrn.br/handle/123456789/18693.

MLA Handbook (7th Edition):

Menezes, Matheus da Silva. “O problema do caixeiro alugador com coleta de bonus: um estudo algoritmico .” 2014. Web. 01 Jun 2020.

Vancouver:

Menezes MdS. O problema do caixeiro alugador com coleta de bonus: um estudo algoritmico . [Internet] [Doctoral dissertation]. Universidade do Rio Grande do Norte; 2014. [cited 2020 Jun 01]. Available from: http://repositorio.ufrn.br/handle/123456789/18693.

Council of Science Editors:

Menezes MdS. O problema do caixeiro alugador com coleta de bonus: um estudo algoritmico . [Doctoral Dissertation]. Universidade do Rio Grande do Norte; 2014. Available from: http://repositorio.ufrn.br/handle/123456789/18693


Universidade do Rio Grande do Norte

16. Silva, Paulo Henrique Asconavieta da. O problema do caixeiro viajante alugador : um estudo algorítmico .

Degree: 2011, Universidade do Rio Grande do Norte

 The Car Rental Salesman Problem (CaRS) is a variant of the classical Traveling Salesman Problem which was not described in the literature where a tour… (more)

Subjects/Keywords: O Problema do caixeiro alugador; Metaheurísticas; GRASP/VND; Colônia de formigas; Computação evolucionária; Algoritmo memético; Transgenética computacional; The car rental salesman problem; Metaheuristics; GRASP/VND; Ant colony; Evolutionary computation; Memetic algorithm; Computational transgenic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Silva, P. H. A. d. (2011). O problema do caixeiro viajante alugador : um estudo algorítmico . (Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/17945

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Silva, Paulo Henrique Asconavieta da. “O problema do caixeiro viajante alugador : um estudo algorítmico .” 2011. Thesis, Universidade do Rio Grande do Norte. Accessed June 01, 2020. http://repositorio.ufrn.br/handle/123456789/17945.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Silva, Paulo Henrique Asconavieta da. “O problema do caixeiro viajante alugador : um estudo algorítmico .” 2011. Web. 01 Jun 2020.

Vancouver:

Silva PHAd. O problema do caixeiro viajante alugador : um estudo algorítmico . [Internet] [Thesis]. Universidade do Rio Grande do Norte; 2011. [cited 2020 Jun 01]. Available from: http://repositorio.ufrn.br/handle/123456789/17945.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Silva PHAd. O problema do caixeiro viajante alugador : um estudo algorítmico . [Thesis]. Universidade do Rio Grande do Norte; 2011. Available from: http://repositorio.ufrn.br/handle/123456789/17945

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade do Rio Grande do Norte

17. Menezes, Matheus da Silva. O problema do caixeiro alugador com coleta de bonus: um estudo algoritmico .

Degree: 2014, Universidade do Rio Grande do Norte

 This paper introduces a new variant of the Traveling Car Renter Problem, named Prizecollecting Traveling Car Renter Problem. In this problem, a set of vertices,… (more)

Subjects/Keywords: Caixeiro alugador com coleta de prêmios. Metaheurísticas. GRASP/VNS. Algoritmo memético. Transgenética computacional. Computação evolucionária; The Prize Collecting Traveling Car Renter Problem. Metaheuristics. GRASP/VNS. Memetic Algorithm. Computational Transgenetic. Evolutionary Computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Menezes, M. d. S. (2014). O problema do caixeiro alugador com coleta de bonus: um estudo algoritmico . (Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/18693

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Menezes, Matheus da Silva. “O problema do caixeiro alugador com coleta de bonus: um estudo algoritmico .” 2014. Thesis, Universidade do Rio Grande do Norte. Accessed June 01, 2020. http://repositorio.ufrn.br/handle/123456789/18693.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Menezes, Matheus da Silva. “O problema do caixeiro alugador com coleta de bonus: um estudo algoritmico .” 2014. Web. 01 Jun 2020.

Vancouver:

Menezes MdS. O problema do caixeiro alugador com coleta de bonus: um estudo algoritmico . [Internet] [Thesis]. Universidade do Rio Grande do Norte; 2014. [cited 2020 Jun 01]. Available from: http://repositorio.ufrn.br/handle/123456789/18693.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Menezes MdS. O problema do caixeiro alugador com coleta de bonus: um estudo algoritmico . [Thesis]. Universidade do Rio Grande do Norte; 2014. Available from: http://repositorio.ufrn.br/handle/123456789/18693

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

18. Kafafy, Ahmed. Hybrid Evolutionary Metaheuristics for Multiobjective Decision Support : Métaheuristiques hybrides évolutionnaires pour l'aide à la décision multi-objectifs.

Degree: Docteur es, Informatique, 2013, Université Claude Bernard – Lyon I

La prise de décision est une partie intégrante de notre vie quotidienne où le décideur est confronté à des problèmes composés de plusieurs objectifs habituellement… (more)

Subjects/Keywords: Optimisation multi-objectifs; Métaheuristiques hybrides; Algorithmes évolutionnaires; DM-GRASP; Path-relinking; Adaptive Binary Differential Evolution; Problèmes du sac à dos multi-objectifs 0/1; Adaptation de la stratégie de recherche; Multiobjective Optimization; Hybrid Metaheuristics; Evolutionary Algorithms; DM-GRASP; Path-relinking; Adaptive Binary Differential Evolution; 0/1 Multiobjective Knapsack Problems; Search Strategy adaptation; 005

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kafafy, A. (2013). Hybrid Evolutionary Metaheuristics for Multiobjective Decision Support : Métaheuristiques hybrides évolutionnaires pour l'aide à la décision multi-objectifs. (Doctoral Dissertation). Université Claude Bernard – Lyon I. Retrieved from http://www.theses.fr/2013LYO10184

Chicago Manual of Style (16th Edition):

Kafafy, Ahmed. “Hybrid Evolutionary Metaheuristics for Multiobjective Decision Support : Métaheuristiques hybrides évolutionnaires pour l'aide à la décision multi-objectifs.” 2013. Doctoral Dissertation, Université Claude Bernard – Lyon I. Accessed June 01, 2020. http://www.theses.fr/2013LYO10184.

MLA Handbook (7th Edition):

Kafafy, Ahmed. “Hybrid Evolutionary Metaheuristics for Multiobjective Decision Support : Métaheuristiques hybrides évolutionnaires pour l'aide à la décision multi-objectifs.” 2013. Web. 01 Jun 2020.

Vancouver:

Kafafy A. Hybrid Evolutionary Metaheuristics for Multiobjective Decision Support : Métaheuristiques hybrides évolutionnaires pour l'aide à la décision multi-objectifs. [Internet] [Doctoral dissertation]. Université Claude Bernard – Lyon I; 2013. [cited 2020 Jun 01]. Available from: http://www.theses.fr/2013LYO10184.

Council of Science Editors:

Kafafy A. Hybrid Evolutionary Metaheuristics for Multiobjective Decision Support : Métaheuristiques hybrides évolutionnaires pour l'aide à la décision multi-objectifs. [Doctoral Dissertation]. Université Claude Bernard – Lyon I; 2013. Available from: http://www.theses.fr/2013LYO10184


Pontifical Catholic University of Rio de Janeiro

19. ISABEL CRISTINA MELLO ROSSETI. [en] SEQUENTIAL AND PARALLEL STRATEGIES OF GRASP WITH PATH-RELINKING FOR THE 2-PATH NETWORK DESIGN PROBLEM.

Degree: 2004, Pontifical Catholic University of Rio de Janeiro

[pt] Seja G= (V, E) um grafo não-orientado com custos não- negativos em suas arestas e D um conjunto de pares origem - destino. Um… (more)

Subjects/Keywords: [pt] GRASP; [en] GRASP; [pt] METAHEURISTICAS; [en] METAHEURISTICS; [pt] PARALELISMO; [en] PARALLELISM; [pt] RECONEXAO POR CAMINHOS; [pt] SINTESE DE REDES A 2-CAMINHOS; [en] 2-PATH NETWORK DESIGN PROBLEM

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

ROSSETI, I. C. M. (2004). [en] SEQUENTIAL AND PARALLEL STRATEGIES OF GRASP WITH PATH-RELINKING FOR THE 2-PATH NETWORK DESIGN PROBLEM. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4365

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

ROSSETI, ISABEL CRISTINA MELLO. “[en] SEQUENTIAL AND PARALLEL STRATEGIES OF GRASP WITH PATH-RELINKING FOR THE 2-PATH NETWORK DESIGN PROBLEM.” 2004. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed June 01, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4365.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

ROSSETI, ISABEL CRISTINA MELLO. “[en] SEQUENTIAL AND PARALLEL STRATEGIES OF GRASP WITH PATH-RELINKING FOR THE 2-PATH NETWORK DESIGN PROBLEM.” 2004. Web. 01 Jun 2020.

Vancouver:

ROSSETI ICM. [en] SEQUENTIAL AND PARALLEL STRATEGIES OF GRASP WITH PATH-RELINKING FOR THE 2-PATH NETWORK DESIGN PROBLEM. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2004. [cited 2020 Jun 01]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4365.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

ROSSETI ICM. [en] SEQUENTIAL AND PARALLEL STRATEGIES OF GRASP WITH PATH-RELINKING FOR THE 2-PATH NETWORK DESIGN PROBLEM. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2004. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4365

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Pontifical Catholic University of Rio de Janeiro

20. RENATA MACHADO AIEX. [en] AN EXPERIMENTAL INVESTIGATION OF PROBABILITY DISTRIBUTION OF SOLUTION TIME IN GRASP AND ITS APPLICATION ON THE ANALYSIS OF PARALLEL IMPLEMENTATIONS.

Degree: 2003, Pontifical Catholic University of Rio de Janeiro

[pt] GRASP (Greedy Randomized Adaptive Search Procedure)é uma metaeurística de partidas múltiplas usada para obter soluções para problemas de otimização combinatória. Nesse trabalho. A metaheurística… (more)

Subjects/Keywords: [pt] GRASP; [en] GRASP; [pt] METAHEURISTICAS; [en] METAHEURISTICS; [pt] OTIMIZACAO COMBINATORIA; [en] COMBINATORIAL OPTIMIZATION; [pt] METODOLOGIA PARA ANALISE DO GRASP; [en] METHODOLOGY FOR ANALYSIS OF GRASP; [pt] PROBLEMA DE ATRIBUICAO DE TRES INDICES; [en] 3-INDEX ASSIGNMENT PROBLEM; [pt] PROBLEMA DE ESCALONAMENTO DE TAREFAS; [en] JOB-SHOP SCHEDULING PROBLEM; [pt] ALGORITMOS PARALELOS; [en] PARALLEL ALGORITHMS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

AIEX, R. M. (2003). [en] AN EXPERIMENTAL INVESTIGATION OF PROBABILITY DISTRIBUTION OF SOLUTION TIME IN GRASP AND ITS APPLICATION ON THE ANALYSIS OF PARALLEL IMPLEMENTATIONS. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=3637

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

AIEX, RENATA MACHADO. “[en] AN EXPERIMENTAL INVESTIGATION OF PROBABILITY DISTRIBUTION OF SOLUTION TIME IN GRASP AND ITS APPLICATION ON THE ANALYSIS OF PARALLEL IMPLEMENTATIONS.” 2003. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed June 01, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=3637.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

AIEX, RENATA MACHADO. “[en] AN EXPERIMENTAL INVESTIGATION OF PROBABILITY DISTRIBUTION OF SOLUTION TIME IN GRASP AND ITS APPLICATION ON THE ANALYSIS OF PARALLEL IMPLEMENTATIONS.” 2003. Web. 01 Jun 2020.

Vancouver:

AIEX RM. [en] AN EXPERIMENTAL INVESTIGATION OF PROBABILITY DISTRIBUTION OF SOLUTION TIME IN GRASP AND ITS APPLICATION ON THE ANALYSIS OF PARALLEL IMPLEMENTATIONS. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2003. [cited 2020 Jun 01]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=3637.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

AIEX RM. [en] AN EXPERIMENTAL INVESTIGATION OF PROBABILITY DISTRIBUTION OF SOLUTION TIME IN GRASP AND ITS APPLICATION ON THE ANALYSIS OF PARALLEL IMPLEMENTATIONS. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2003. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=3637

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universitat Pompeu Fabra

21. Colomé, Rosa. Consumer choice in competitive location models.

Degree: Departament d'Economia i Empresa, 2002, Universitat Pompeu Fabra

 The main aim of this thesis is the introduction of consumer store - choice theories in the discrete competitive location models that have a maximum… (more)

Subjects/Keywords: Models d'elecció del consumidor; modelos de máxima captura; metaheurístiques; GRASP; TABU Search; competitive location models; distance; maximum capture models; metaheuristics; consumer choice models; metaheurísticas; sector de venta al por menor; distancia; sector de venta al detall; models de localització competitiva; models de màxima captura; distància; modelos de elección del consumidor; Ant System; modelos de localización competitiva; retail sector; 33

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Colomé, R. (2002). Consumer choice in competitive location models. (Thesis). Universitat Pompeu Fabra. Retrieved from http://hdl.handle.net/10803/7330

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Colomé, Rosa. “Consumer choice in competitive location models.” 2002. Thesis, Universitat Pompeu Fabra. Accessed June 01, 2020. http://hdl.handle.net/10803/7330.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Colomé, Rosa. “Consumer choice in competitive location models.” 2002. Web. 01 Jun 2020.

Vancouver:

Colomé R. Consumer choice in competitive location models. [Internet] [Thesis]. Universitat Pompeu Fabra; 2002. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/10803/7330.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Colomé R. Consumer choice in competitive location models. [Thesis]. Universitat Pompeu Fabra; 2002. Available from: http://hdl.handle.net/10803/7330

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.