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:( Metaheuristics search techniques). Showing records 1 – 30 of 10563 total matches.

[1] [2] [3] [4] [5] … [353]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


AUT University

1. Shah, Amit Anilkumar. Performance evaluation of Metaheuristics Search Techniques in resource allocation problems .

Degree: 2012, AUT University

 Existing research has focused on solving problems in the area of project management using variety of approaches including search based software engineering approach. The main… (more)

Subjects/Keywords: Software engineering; Search based software engineering; Metaheuristics search techniques; Resource constrained project scheduling problem; Cost allocation; Project management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shah, A. A. (2012). Performance evaluation of Metaheuristics Search Techniques in resource allocation problems . (Thesis). AUT University. Retrieved from http://hdl.handle.net/10292/4463

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):

Shah, Amit Anilkumar. “Performance evaluation of Metaheuristics Search Techniques in resource allocation problems .” 2012. Thesis, AUT University. Accessed June 19, 2019. http://hdl.handle.net/10292/4463.

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

MLA Handbook (7th Edition):

Shah, Amit Anilkumar. “Performance evaluation of Metaheuristics Search Techniques in resource allocation problems .” 2012. Web. 19 Jun 2019.

Vancouver:

Shah AA. Performance evaluation of Metaheuristics Search Techniques in resource allocation problems . [Internet] [Thesis]. AUT University; 2012. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/10292/4463.

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

Council of Science Editors:

Shah AA. Performance evaluation of Metaheuristics Search Techniques in resource allocation problems . [Thesis]. AUT University; 2012. Available from: http://hdl.handle.net/10292/4463

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

2. Lucas, François. Des métaheuristiques pour le guidage d’un solveur de contraintes dédié à la planification automatisée de véhicules : Metaheuristics for the guidance of a constraint solver dedicated to automated vehicle planning.

Degree: Docteur es, Informatique temps réel, robotique et automatique, 2012, Paris, ENMP

Cette thèse, réalisée en collaboration avec Sagem Défense Sécurité, porte sur l'élaboration d'une stratégie de recherche efficace pour la résolution de problèmes de planification d'itinéraires… (more)

Subjects/Keywords: Planification d'itinéraires; Programmation par contraintes; Méthode de sonde; Relaxation; Metaheuristiques; Méthodes de recherche; Path planning; Constraint programming; Probe backtracking; Relaxation; Metaheuristics; Search techniques

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lucas, F. (2012). Des métaheuristiques pour le guidage d’un solveur de contraintes dédié à la planification automatisée de véhicules : Metaheuristics for the guidance of a constraint solver dedicated to automated vehicle planning. (Doctoral Dissertation). Paris, ENMP. Retrieved from http://www.theses.fr/2012ENMP0027

Chicago Manual of Style (16th Edition):

Lucas, François. “Des métaheuristiques pour le guidage d’un solveur de contraintes dédié à la planification automatisée de véhicules : Metaheuristics for the guidance of a constraint solver dedicated to automated vehicle planning.” 2012. Doctoral Dissertation, Paris, ENMP. Accessed June 19, 2019. http://www.theses.fr/2012ENMP0027.

MLA Handbook (7th Edition):

Lucas, François. “Des métaheuristiques pour le guidage d’un solveur de contraintes dédié à la planification automatisée de véhicules : Metaheuristics for the guidance of a constraint solver dedicated to automated vehicle planning.” 2012. Web. 19 Jun 2019.

Vancouver:

Lucas F. Des métaheuristiques pour le guidage d’un solveur de contraintes dédié à la planification automatisée de véhicules : Metaheuristics for the guidance of a constraint solver dedicated to automated vehicle planning. [Internet] [Doctoral dissertation]. Paris, ENMP; 2012. [cited 2019 Jun 19]. Available from: http://www.theses.fr/2012ENMP0027.

Council of Science Editors:

Lucas F. Des métaheuristiques pour le guidage d’un solveur de contraintes dédié à la planification automatisée de véhicules : Metaheuristics for the guidance of a constraint solver dedicated to automated vehicle planning. [Doctoral Dissertation]. Paris, ENMP; 2012. Available from: http://www.theses.fr/2012ENMP0027


Univerzitet u Beogradu

3. Dražić, Zorica M., 1983-. Modifikacije metode promenljivih okolina i njihove primene za rešavanje problema raspoređivanja prenosa datoteka.

Degree: Matematički fakultet, 2017, Univerzitet u Beogradu

Racunarstvo - Optimizacija / Computer Science - Optimization

Metoda promenljivih okolina se u praksi pokazala vrlo uspesnom za resavanje pro- blema diskretne i kontinualne optimizacije.… (more)

Subjects/Keywords: continual optimization; combinatorial optimization; variable neighborhood search; integer linear programming; metaheuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dražić, Zorica M., 1. (2017). Modifikacije metode promenljivih okolina i njihove primene za rešavanje problema raspoređivanja prenosa datoteka. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:15561/bdef:Content/get

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):

Dražić, Zorica M., 1983-. “Modifikacije metode promenljivih okolina i njihove primene za rešavanje problema raspoređivanja prenosa datoteka.” 2017. Thesis, Univerzitet u Beogradu. Accessed June 19, 2019. https://fedorabg.bg.ac.rs/fedora/get/o:15561/bdef:Content/get.

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

MLA Handbook (7th Edition):

Dražić, Zorica M., 1983-. “Modifikacije metode promenljivih okolina i njihove primene za rešavanje problema raspoređivanja prenosa datoteka.” 2017. Web. 19 Jun 2019.

Vancouver:

Dražić, Zorica M. 1. Modifikacije metode promenljivih okolina i njihove primene za rešavanje problema raspoređivanja prenosa datoteka. [Internet] [Thesis]. Univerzitet u Beogradu; 2017. [cited 2019 Jun 19]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15561/bdef:Content/get.

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

Council of Science Editors:

Dražić, Zorica M. 1. Modifikacije metode promenljivih okolina i njihove primene za rešavanje problema raspoređivanja prenosa datoteka. [Thesis]. Univerzitet u Beogradu; 2017. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15561/bdef:Content/get

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


Clemson University

4. Sangsawang, Ornurai. METAHEURISTICS FOR HUB LOCATION MODELS.

Degree: PhD, Industrial Engineering, 2011, Clemson University

 In this research, we propose metaheuristics for solving two p-hub median problems.. The first p-hub median problem, which is NP-hard, is the uncapacitated single p-hub… (more)

Subjects/Keywords: hub location; metaheuristics; path relinking; tabu search; UMApHMP; USApHMP; Industrial Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sangsawang, O. (2011). METAHEURISTICS FOR HUB LOCATION MODELS. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/804

Chicago Manual of Style (16th Edition):

Sangsawang, Ornurai. “METAHEURISTICS FOR HUB LOCATION MODELS.” 2011. Doctoral Dissertation, Clemson University. Accessed June 19, 2019. https://tigerprints.clemson.edu/all_dissertations/804.

MLA Handbook (7th Edition):

Sangsawang, Ornurai. “METAHEURISTICS FOR HUB LOCATION MODELS.” 2011. Web. 19 Jun 2019.

Vancouver:

Sangsawang O. METAHEURISTICS FOR HUB LOCATION MODELS. [Internet] [Doctoral dissertation]. Clemson University; 2011. [cited 2019 Jun 19]. Available from: https://tigerprints.clemson.edu/all_dissertations/804.

Council of Science Editors:

Sangsawang O. METAHEURISTICS FOR HUB LOCATION MODELS. [Doctoral Dissertation]. Clemson University; 2011. Available from: https://tigerprints.clemson.edu/all_dissertations/804


University of Texas – Austin

5. Liu, Zelong. Thermo-economic optimization of a heat recovery steam generator (HRSG) system using Tabu search.

Degree: Mechanical Engineering, 2010, University of Texas – Austin

 Heat Recovery Steam Generator (HRSG) systems in conjunction with a primary gas turbine and a secondary steam turbine can provide advanced modern power generation with… (more)

Subjects/Keywords: Tabu Search; Metaheuristics; Simulation; Optimization; Heat recovery steam generator; Thermoeconomics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Z. (2010). Thermo-economic optimization of a heat recovery steam generator (HRSG) system using Tabu search. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-05-811

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):

Liu, Zelong. “Thermo-economic optimization of a heat recovery steam generator (HRSG) system using Tabu search.” 2010. Thesis, University of Texas – Austin. Accessed June 19, 2019. http://hdl.handle.net/2152/ETD-UT-2010-05-811.

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

MLA Handbook (7th Edition):

Liu, Zelong. “Thermo-economic optimization of a heat recovery steam generator (HRSG) system using Tabu search.” 2010. Web. 19 Jun 2019.

Vancouver:

Liu Z. Thermo-economic optimization of a heat recovery steam generator (HRSG) system using Tabu search. [Internet] [Thesis]. University of Texas – Austin; 2010. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-811.

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

Council of Science Editors:

Liu Z. Thermo-economic optimization of a heat recovery steam generator (HRSG) system using Tabu search. [Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-811

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


Univerzitet u Beogradu

6. Matić, Dragan. 1977-. Rješavanje nekih problema u nastavi primjenom metoda kombinatorne optimizacije.

Degree: Matematički fakultet, 2015, Univerzitet u Beogradu

Matematika - Metodika nastave matematike i računarstva / Mathematics - Mathematics and computer science teaching methodology Datum odbrane: 08.07.2013.

U ovom radu se istražuju neki aktuelni problemi kombinatorne optimizacije...

Advisors/Committee Members: Filipović, Vladimir, 1968-.

Subjects/Keywords: combinatorial; optimatization; mixed integer linear programming; metaheuristics; variable neighborhood search; genetic algorithms; balanced graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Matić, D. 1. (2015). Rješavanje nekih problema u nastavi primjenom metoda kombinatorne optimizacije. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:7097/bdef:Content/get

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):

Matić, Dragan 1977-. “Rješavanje nekih problema u nastavi primjenom metoda kombinatorne optimizacije.” 2015. Thesis, Univerzitet u Beogradu. Accessed June 19, 2019. https://fedorabg.bg.ac.rs/fedora/get/o:7097/bdef:Content/get.

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

MLA Handbook (7th Edition):

Matić, Dragan 1977-. “Rješavanje nekih problema u nastavi primjenom metoda kombinatorne optimizacije.” 2015. Web. 19 Jun 2019.

Vancouver:

Matić D1. Rješavanje nekih problema u nastavi primjenom metoda kombinatorne optimizacije. [Internet] [Thesis]. Univerzitet u Beogradu; 2015. [cited 2019 Jun 19]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:7097/bdef:Content/get.

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

Council of Science Editors:

Matić D1. Rješavanje nekih problema u nastavi primjenom metoda kombinatorne optimizacije. [Thesis]. Univerzitet u Beogradu; 2015. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:7097/bdef:Content/get

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

7. 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 19, 2019. 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. 19 Jun 2019.

Vancouver:

Fernandes S. Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems. [Internet] [Thesis]. RCAAP; 2008. [cited 2019 Jun 19]. 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

8. Arin, Arif. Incorporating Memory and Learning Mechanisms Into Meta-RaPS.

Degree: PhD, Engineering Management, 2012, Old Dominion University

  Due to the rapid increase of dimensions and complexity of real life problems, it has become more difficult to find optimal solutions using only… (more)

Subjects/Keywords: Estimation of distribution; Knapsack problem; Metaheuristics; Randomized priority search; Artificial Intelligence and Robotics; Operational Research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arin, A. (2012). Incorporating Memory and Learning Mechanisms Into Meta-RaPS. (Doctoral Dissertation). Old Dominion University. Retrieved from 9781267649591 ; https://digitalcommons.odu.edu/emse_etds/37

Chicago Manual of Style (16th Edition):

Arin, Arif. “Incorporating Memory and Learning Mechanisms Into Meta-RaPS.” 2012. Doctoral Dissertation, Old Dominion University. Accessed June 19, 2019. 9781267649591 ; https://digitalcommons.odu.edu/emse_etds/37.

MLA Handbook (7th Edition):

Arin, Arif. “Incorporating Memory and Learning Mechanisms Into Meta-RaPS.” 2012. Web. 19 Jun 2019.

Vancouver:

Arin A. Incorporating Memory and Learning Mechanisms Into Meta-RaPS. [Internet] [Doctoral dissertation]. Old Dominion University; 2012. [cited 2019 Jun 19]. Available from: 9781267649591 ; https://digitalcommons.odu.edu/emse_etds/37.

Council of Science Editors:

Arin A. Incorporating Memory and Learning Mechanisms Into Meta-RaPS. [Doctoral Dissertation]. Old Dominion University; 2012. Available from: 9781267649591 ; https://digitalcommons.odu.edu/emse_etds/37


Luleå University of Technology

9. Gabrielsson, Samuel. A parallel tabu search alglorithm for the quadratic assignment problem.

Degree: 2008, Luleå University of Technology

A parallel version of the tabu search algorithm is implemented and used to optimize the solutions for a quadratic assignment problem (QAP). The instances… (more)

Subjects/Keywords: Physics Chemistry Maths; Parallel Tabu Search; Optimization; QAPLIB; heuristics; metaheuristics; Fysik; Kemi; Matematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gabrielsson, S. (2008). A parallel tabu search alglorithm for the quadratic assignment problem. (Thesis). Luleå University of Technology. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-43798

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):

Gabrielsson, Samuel. “A parallel tabu search alglorithm for the quadratic assignment problem.” 2008. Thesis, Luleå University of Technology. Accessed June 19, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-43798.

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

MLA Handbook (7th Edition):

Gabrielsson, Samuel. “A parallel tabu search alglorithm for the quadratic assignment problem.” 2008. Web. 19 Jun 2019.

Vancouver:

Gabrielsson S. A parallel tabu search alglorithm for the quadratic assignment problem. [Internet] [Thesis]. Luleå University of Technology; 2008. [cited 2019 Jun 19]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-43798.

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

Council of Science Editors:

Gabrielsson S. A parallel tabu search alglorithm for the quadratic assignment problem. [Thesis]. Luleå University of Technology; 2008. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-43798

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


Universidade do Rio Grande do Sul

10. Bornia Poulsen, Camilo José. Desenvolvimento de um modelo para o School Timetabling Problem baseado na Meta-Heurística Simulated Annealing.

Degree: 2012, Universidade do Rio Grande do Sul

Todo início de período letivo, gestores de instituições de ensino se deparam com um típico problema: montar as grades horárias das turmas, segundo as demandas… (more)

Subjects/Keywords: School timetabling problem; Ferramentas de gestão; Timetable; Grade de horários; Simulated annealing; Alocação de recursos; Pesquisa operacional; Metaheuristics; Operational search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bornia Poulsen, C. J. (2012). Desenvolvimento de um modelo para o School Timetabling Problem baseado na Meta-Heurística Simulated Annealing. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/39522

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):

Bornia Poulsen, Camilo José. “Desenvolvimento de um modelo para o School Timetabling Problem baseado na Meta-Heurística Simulated Annealing.” 2012. Thesis, Universidade do Rio Grande do Sul. Accessed June 19, 2019. http://hdl.handle.net/10183/39522.

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

MLA Handbook (7th Edition):

Bornia Poulsen, Camilo José. “Desenvolvimento de um modelo para o School Timetabling Problem baseado na Meta-Heurística Simulated Annealing.” 2012. Web. 19 Jun 2019.

Vancouver:

Bornia Poulsen CJ. Desenvolvimento de um modelo para o School Timetabling Problem baseado na Meta-Heurística Simulated Annealing. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2012. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/10183/39522.

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

Council of Science Editors:

Bornia Poulsen CJ. Desenvolvimento de um modelo para o School Timetabling Problem baseado na Meta-Heurística Simulated Annealing. [Thesis]. Universidade do Rio Grande do Sul; 2012. Available from: http://hdl.handle.net/10183/39522

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


Massey University

11. Woods, David Colin. Modular local search : a framework for self-adaptive metaheuristics.

Degree: PhD, Decision Science, 2010, Massey University

 This research develops Modular Local Search (MLS), a framework such that trajectory-based metaheuristics can be expressed as subsets of “modules” from a common library, with… (more)

Subjects/Keywords: Decision-making; Data processing; Combinatorial optimisation; Mathematical optimisation; Computer algorithms; Modular local search; Self-adaptive metaheuristics; Decision science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Woods, D. C. (2010). Modular local search : a framework for self-adaptive metaheuristics. (Doctoral Dissertation). Massey University. Retrieved from http://hdl.handle.net/10179/2872

Chicago Manual of Style (16th Edition):

Woods, David Colin. “Modular local search : a framework for self-adaptive metaheuristics.” 2010. Doctoral Dissertation, Massey University. Accessed June 19, 2019. http://hdl.handle.net/10179/2872.

MLA Handbook (7th Edition):

Woods, David Colin. “Modular local search : a framework for self-adaptive metaheuristics.” 2010. Web. 19 Jun 2019.

Vancouver:

Woods DC. Modular local search : a framework for self-adaptive metaheuristics. [Internet] [Doctoral dissertation]. Massey University; 2010. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/10179/2872.

Council of Science Editors:

Woods DC. Modular local search : a framework for self-adaptive metaheuristics. [Doctoral Dissertation]. Massey University; 2010. Available from: http://hdl.handle.net/10179/2872

12. Sghir, Inès. A Multi-Agent based Optimization Method for Combinatorial Optimization Problems : Une méthode d’optimisation à base de système multi-agents pour l’optimisation combinatoire.

Degree: Docteur es, Informatique et applications, 2016, Angers; Université de Tunis

Nous élaborons une approche multi-agents pour la résolution des problèmes d’optimisation combinatoire nommée MAOM-COP. Elle combine des métaheuristiques, les systèmes multi-agents et l’apprentissage par renforcement.… (more)

Subjects/Keywords: Multi-agents; Recherche coopérative; Intensification; Diversification; Multi-agent; Cooperative search; Combinatorial optimization; Intensification; Diversification; Metaheuristics; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sghir, I. (2016). A Multi-Agent based Optimization Method for Combinatorial Optimization Problems : Une méthode d’optimisation à base de système multi-agents pour l’optimisation combinatoire. (Doctoral Dissertation). Angers; Université de Tunis. Retrieved from http://www.theses.fr/2016ANGE0009

Chicago Manual of Style (16th Edition):

Sghir, Inès. “A Multi-Agent based Optimization Method for Combinatorial Optimization Problems : Une méthode d’optimisation à base de système multi-agents pour l’optimisation combinatoire.” 2016. Doctoral Dissertation, Angers; Université de Tunis. Accessed June 19, 2019. http://www.theses.fr/2016ANGE0009.

MLA Handbook (7th Edition):

Sghir, Inès. “A Multi-Agent based Optimization Method for Combinatorial Optimization Problems : Une méthode d’optimisation à base de système multi-agents pour l’optimisation combinatoire.” 2016. Web. 19 Jun 2019.

Vancouver:

Sghir I. A Multi-Agent based Optimization Method for Combinatorial Optimization Problems : Une méthode d’optimisation à base de système multi-agents pour l’optimisation combinatoire. [Internet] [Doctoral dissertation]. Angers; Université de Tunis; 2016. [cited 2019 Jun 19]. Available from: http://www.theses.fr/2016ANGE0009.

Council of Science Editors:

Sghir I. A Multi-Agent based Optimization Method for Combinatorial Optimization Problems : Une méthode d’optimisation à base de système multi-agents pour l’optimisation combinatoire. [Doctoral Dissertation]. Angers; Université de Tunis; 2016. Available from: http://www.theses.fr/2016ANGE0009


Queensland University of Technology

13. Dik, Guvenc. A quay crane scheduling methodology for multimodal container terminals.

Degree: 2015, Queensland University of Technology

This thesis develops an operational decision support tool for container terminal managements. The tool generates efficient schedules for shore cranes handling containers carried by mega container vessels.

Subjects/Keywords: Scheduling; Metaheuristics; Optimisation; Operational Decision Support; Multimodal Container Terminals; Maritime Transport; Logistics; Tabu Search; Constructive heuristics; Mixed Integer Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dik, G. (2015). A quay crane scheduling methodology for multimodal container terminals. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/81691/

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):

Dik, Guvenc. “A quay crane scheduling methodology for multimodal container terminals.” 2015. Thesis, Queensland University of Technology. Accessed June 19, 2019. https://eprints.qut.edu.au/81691/.

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

MLA Handbook (7th Edition):

Dik, Guvenc. “A quay crane scheduling methodology for multimodal container terminals.” 2015. Web. 19 Jun 2019.

Vancouver:

Dik G. A quay crane scheduling methodology for multimodal container terminals. [Internet] [Thesis]. Queensland University of Technology; 2015. [cited 2019 Jun 19]. Available from: https://eprints.qut.edu.au/81691/.

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

Council of Science Editors:

Dik G. A quay crane scheduling methodology for multimodal container terminals. [Thesis]. Queensland University of Technology; 2015. Available from: https://eprints.qut.edu.au/81691/

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


Linköping University

14. Höghäll, Anton. Tuning of Metaheuristics for Systems Biology Applications.

Degree: Electrical Engineering, 2010, Linköping University

  In the field of systems biology the task of finding optimal model parameters is a common procedure. The optimization problems encountered are often multi-modal,… (more)

Subjects/Keywords: optimization; systems biology; metaheuristics; scatter search; simulated annealing; particle swarm optimization; core-box modeling; TECHNOLOGY; TEKNIKVETENSKAP

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Höghäll, A. (2010). Tuning of Metaheuristics for Systems Biology Applications. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-58842

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):

Höghäll, Anton. “Tuning of Metaheuristics for Systems Biology Applications.” 2010. Thesis, Linköping University. Accessed June 19, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-58842.

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

MLA Handbook (7th Edition):

Höghäll, Anton. “Tuning of Metaheuristics for Systems Biology Applications.” 2010. Web. 19 Jun 2019.

Vancouver:

Höghäll A. Tuning of Metaheuristics for Systems Biology Applications. [Internet] [Thesis]. Linköping University; 2010. [cited 2019 Jun 19]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-58842.

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

Council of Science Editors:

Höghäll A. Tuning of Metaheuristics for Systems Biology Applications. [Thesis]. Linköping University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-58842

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


Univerzitet u Beogradu

15. Đenić, Aleksandar D. Rešavanje diskretnih lokacijskih problema primenom metode promenljivih okolina.

Degree: Matematički fakultet, 2018, Univerzitet u Beogradu

računarstvo-računarska inteligencija / computer science-computational intelligence

Predmet ovog rada je analiza i re²avanje dva diskretna lokacijska problema: problema odreživanja lokacija autobuskih terminala (engl. Bus Terminal… (more)

Subjects/Keywords: Facility Location Problems; Bus Terminal Location Problem; Longterm Care Facility Location Problem; Combinatorial Optimization; Metaheuristics; Parallelization; Variable Neighborhood Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Đenić, A. D. (2018). Rešavanje diskretnih lokacijskih problema primenom metode promenljivih okolina. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:18332/bdef:Content/get

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):

Đenić, Aleksandar D. “Rešavanje diskretnih lokacijskih problema primenom metode promenljivih okolina.” 2018. Thesis, Univerzitet u Beogradu. Accessed June 19, 2019. https://fedorabg.bg.ac.rs/fedora/get/o:18332/bdef:Content/get.

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

MLA Handbook (7th Edition):

Đenić, Aleksandar D. “Rešavanje diskretnih lokacijskih problema primenom metode promenljivih okolina.” 2018. Web. 19 Jun 2019.

Vancouver:

Đenić AD. Rešavanje diskretnih lokacijskih problema primenom metode promenljivih okolina. [Internet] [Thesis]. Univerzitet u Beogradu; 2018. [cited 2019 Jun 19]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:18332/bdef:Content/get.

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

Council of Science Editors:

Đenić AD. Rešavanje diskretnih lokacijskih problema primenom metode promenljivih okolina. [Thesis]. Univerzitet u Beogradu; 2018. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:18332/bdef:Content/get

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

16. Orth, John. The Salmon Algorithm - A New Population Based Search Metaheuristic .

Degree: Department of Computer Science, 2012, Brock University

 This thesis introduces the Salmon Algorithm, a search meta-heuristic which can be used for a variety of combinatorial optimization problems. This algorithm is loosely based… (more)

Subjects/Keywords: combinatorial optimization; coding theory; search metaheuristics

…computer science today is the search for techniques to find approximate solutions to problems for… …see for example [28]), generalized search techniques such as Genetic… …x5B;41]. Thus, a wider variety of search techniques means a greater chance that one of… …search techniques. It will review some of the algorithms that have been used by previous… …Tabu Search. It will also detail two metaheuristics that the Salmon Algorithm borrows ideas… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Orth, J. (2012). The Salmon Algorithm - A New Population Based Search Metaheuristic . (Thesis). Brock University. Retrieved from http://hdl.handle.net/10464/3929

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):

Orth, John. “The Salmon Algorithm - A New Population Based Search Metaheuristic .” 2012. Thesis, Brock University. Accessed June 19, 2019. http://hdl.handle.net/10464/3929.

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

MLA Handbook (7th Edition):

Orth, John. “The Salmon Algorithm - A New Population Based Search Metaheuristic .” 2012. Web. 19 Jun 2019.

Vancouver:

Orth J. The Salmon Algorithm - A New Population Based Search Metaheuristic . [Internet] [Thesis]. Brock University; 2012. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/10464/3929.

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

Council of Science Editors:

Orth J. The Salmon Algorithm - A New Population Based Search Metaheuristic . [Thesis]. Brock University; 2012. Available from: http://hdl.handle.net/10464/3929

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


Univerzitet u Beogradu

17. Lazović, Bojana, 1979-. Примена метода комбинаторне оптимизације за решавање проблема формирања група у настави.

Degree: Matematički fakultet, 2018, Univerzitet u Beogradu

математика - методика наставе математике и рачунарства / Mathematics - Methodology of teaching of mathematics and computer science

The subject of this thesis is to… (more)

Subjects/Keywords: Combinatorial Optimization; Problems of Group Formation in Classes; Mathematical Modelling; Metaheuristics; Genetic Algorithms; Variable Neighborhood Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lazović, Bojana, 1. (2018). Примена метода комбинаторне оптимизације за решавање проблема формирања група у настави. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:18909/bdef:Content/get

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):

Lazović, Bojana, 1979-. “Примена метода комбинаторне оптимизације за решавање проблема формирања група у настави.” 2018. Thesis, Univerzitet u Beogradu. Accessed June 19, 2019. https://fedorabg.bg.ac.rs/fedora/get/o:18909/bdef:Content/get.

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

MLA Handbook (7th Edition):

Lazović, Bojana, 1979-. “Примена метода комбинаторне оптимизације за решавање проблема формирања група у настави.” 2018. Web. 19 Jun 2019.

Vancouver:

Lazović, Bojana 1. Примена метода комбинаторне оптимизације за решавање проблема формирања група у настави. [Internet] [Thesis]. Univerzitet u Beogradu; 2018. [cited 2019 Jun 19]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:18909/bdef:Content/get.

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

Council of Science Editors:

Lazović, Bojana 1. Примена метода комбинаторне оптимизације за решавање проблема формирања група у настави. [Thesis]. Univerzitet u Beogradu; 2018. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:18909/bdef:Content/get

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


Curtin University of Technology

18. Zhu, Dengya. Improving the relevance of web search results by combining web snippet categorization, clustering and personalization .

Degree: 2010, Curtin University of Technology

 Web search results are far from perfect due to the polysemous and synonymous characteristics of nature languages, information overload as the results of information explosion… (more)

Subjects/Keywords: text clustering; search users; personalization techniques; relevance; text categorization; web search results; web snippets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhu, D. (2010). Improving the relevance of web search results by combining web snippet categorization, clustering and personalization . (Thesis). Curtin University of Technology. Retrieved from http://hdl.handle.net/20.500.11937/326

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):

Zhu, Dengya. “Improving the relevance of web search results by combining web snippet categorization, clustering and personalization .” 2010. Thesis, Curtin University of Technology. Accessed June 19, 2019. http://hdl.handle.net/20.500.11937/326.

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

MLA Handbook (7th Edition):

Zhu, Dengya. “Improving the relevance of web search results by combining web snippet categorization, clustering and personalization .” 2010. Web. 19 Jun 2019.

Vancouver:

Zhu D. Improving the relevance of web search results by combining web snippet categorization, clustering and personalization . [Internet] [Thesis]. Curtin University of Technology; 2010. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/20.500.11937/326.

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

Council of Science Editors:

Zhu D. Improving the relevance of web search results by combining web snippet categorization, clustering and personalization . [Thesis]. Curtin University of Technology; 2010. Available from: http://hdl.handle.net/20.500.11937/326

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


Anna University

19. Karpaga selvi S. Soft Computing Techniques For Web Search Engines;.

Degree: Information Technology, 2013, Anna University

World Wide Web is the one of the largest repositories of newlineinformation Searching the relevant information from web is a challenging newlinetask for human Most… (more)

Subjects/Keywords: Bayesian Belief Networks; cloud computing; Data mining; nonlinear techniques; Soft Computing Techniques; Web Search Engines

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

S, K. s. (2013). Soft Computing Techniques For Web Search Engines;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/22970

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):

S, Karpaga selvi. “Soft Computing Techniques For Web Search Engines;.” 2013. Thesis, Anna University. Accessed June 19, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/22970.

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

MLA Handbook (7th Edition):

S, Karpaga selvi. “Soft Computing Techniques For Web Search Engines;.” 2013. Web. 19 Jun 2019.

Vancouver:

S Ks. Soft Computing Techniques For Web Search Engines;. [Internet] [Thesis]. Anna University; 2013. [cited 2019 Jun 19]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22970.

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

Council of Science Editors:

S Ks. Soft Computing Techniques For Web Search Engines;. [Thesis]. Anna University; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22970

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

20. Karray, Asma. Contribution à l’ordonnancement d’ateliers agroalimentaires utilisant des méthodes d’optimisation hybrides : Using hybrid optimization methods for the agro-food industry scheduling problem.

Degree: Docteur es, Automatique et informatique industrielle, 2011, Ecole centrale de Lille; École nationale d'ingénieurs de Tunis (Tunisie)

Nos travaux concernent la mise en œuvre de méthodologies pour la résolution de problèmes d’ordonnancement en industries agroalimentaires. Trois nouvelles approches basées sur les algorithmes… (more)

Subjects/Keywords: Ordonnancement; Optimisation; Métaheuristiques; Algorithmes génétiques; Recherche tabou; Recuit simulé; Hybridation; Ateliers à une machine; Scheduling; Optimization; Metaheuristics; Genetic algorithms; Tabu search; Simulated annealing; Hybridation; Single-machine workshop

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Karray, A. (2011). Contribution à l’ordonnancement d’ateliers agroalimentaires utilisant des méthodes d’optimisation hybrides : Using hybrid optimization methods for the agro-food industry scheduling problem. (Doctoral Dissertation). Ecole centrale de Lille; École nationale d'ingénieurs de Tunis (Tunisie). Retrieved from http://www.theses.fr/2011ECLI0024

Chicago Manual of Style (16th Edition):

Karray, Asma. “Contribution à l’ordonnancement d’ateliers agroalimentaires utilisant des méthodes d’optimisation hybrides : Using hybrid optimization methods for the agro-food industry scheduling problem.” 2011. Doctoral Dissertation, Ecole centrale de Lille; École nationale d'ingénieurs de Tunis (Tunisie). Accessed June 19, 2019. http://www.theses.fr/2011ECLI0024.

MLA Handbook (7th Edition):

Karray, Asma. “Contribution à l’ordonnancement d’ateliers agroalimentaires utilisant des méthodes d’optimisation hybrides : Using hybrid optimization methods for the agro-food industry scheduling problem.” 2011. Web. 19 Jun 2019.

Vancouver:

Karray A. Contribution à l’ordonnancement d’ateliers agroalimentaires utilisant des méthodes d’optimisation hybrides : Using hybrid optimization methods for the agro-food industry scheduling problem. [Internet] [Doctoral dissertation]. Ecole centrale de Lille; École nationale d'ingénieurs de Tunis (Tunisie); 2011. [cited 2019 Jun 19]. Available from: http://www.theses.fr/2011ECLI0024.

Council of Science Editors:

Karray A. Contribution à l’ordonnancement d’ateliers agroalimentaires utilisant des méthodes d’optimisation hybrides : Using hybrid optimization methods for the agro-food industry scheduling problem. [Doctoral Dissertation]. Ecole centrale de Lille; École nationale d'ingénieurs de Tunis (Tunisie); 2011. Available from: http://www.theses.fr/2011ECLI0024

21. Antonio Augusto Chaves. Uma meta-heurística híbrida com busca por agrupamentos aplicada a problemas de otimização combinatória.

Degree: 2009, Instituto Nacional de Pesquisas Espaciais

Esta tese apresenta um método híbrido, denominado Busca por Agrupamentos (CS, do inglês Clustering Search), que consiste em detectar dinamicamente regiões promissoras no espaço de… (more)

Subjects/Keywords: Otimização combinatória; meta-heurísticas; busca por agrupamentos; localização de facilidades; caixeiro viajante; linha de produção; combinatorial optimization; metaheuristics; clustering search; location of facilities; traveling salesman; assembly line

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chaves, A. A. (2009). Uma meta-heurística híbrida com busca por agrupamentos aplicada a problemas de otimização combinatória. (Thesis). Instituto Nacional de Pesquisas Espaciais. Retrieved from http://urlib.net/sid.inpe.br/[email protected]/2009/02.09.19.31

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):

Chaves, Antonio Augusto. “Uma meta-heurística híbrida com busca por agrupamentos aplicada a problemas de otimização combinatória.” 2009. Thesis, Instituto Nacional de Pesquisas Espaciais. Accessed June 19, 2019. http://urlib.net/sid.inpe.br/[email protected]/2009/02.09.19.31.

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

MLA Handbook (7th Edition):

Chaves, Antonio Augusto. “Uma meta-heurística híbrida com busca por agrupamentos aplicada a problemas de otimização combinatória.” 2009. Web. 19 Jun 2019.

Vancouver:

Chaves AA. Uma meta-heurística híbrida com busca por agrupamentos aplicada a problemas de otimização combinatória. [Internet] [Thesis]. Instituto Nacional de Pesquisas Espaciais; 2009. [cited 2019 Jun 19]. Available from: http://urlib.net/sid.inpe.br/[email protected]/2009/02.09.19.31.

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

Council of Science Editors:

Chaves AA. Uma meta-heurística híbrida com busca por agrupamentos aplicada a problemas de otimização combinatória. [Thesis]. Instituto Nacional de Pesquisas Espaciais; 2009. Available from: http://urlib.net/sid.inpe.br/[email protected]/2009/02.09.19.31

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

22. Cristiano Galafassi. Aplicação de metaheurísticas na abordagem do problema de roteamento de veículos capacitado com janelas de tempo.

Degree: 2011, Universidade do Vale do Rio do Sinos

This paper approaches the Capacitated Vehicle Routing Problem with Time Windows, which must obey the restrictions on vehicle capacity and time windows for customer service.… (more)

Subjects/Keywords: hibridização; problema de roteamento de veículos; algoritmo híbrido; busca tabu; algoritmos genéticos; metaheurísticas; metaheuristics; tabu search; genetic algorithm; hybrid algorithm; vehicle routing problem; hybridization; CIENCIA DA COMPUTACAO

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Galafassi, C. (2011). Aplicação de metaheurísticas na abordagem do problema de roteamento de veículos capacitado com janelas de tempo. (Thesis). Universidade do Vale do Rio do Sinos. Retrieved from http://bdtd.unisinos.br/tde_busca/arquivo.php?codArquivo=1811

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):

Galafassi, Cristiano. “Aplicação de metaheurísticas na abordagem do problema de roteamento de veículos capacitado com janelas de tempo.” 2011. Thesis, Universidade do Vale do Rio do Sinos. Accessed June 19, 2019. http://bdtd.unisinos.br/tde_busca/arquivo.php?codArquivo=1811.

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

MLA Handbook (7th Edition):

Galafassi, Cristiano. “Aplicação de metaheurísticas na abordagem do problema de roteamento de veículos capacitado com janelas de tempo.” 2011. Web. 19 Jun 2019.

Vancouver:

Galafassi C. Aplicação de metaheurísticas na abordagem do problema de roteamento de veículos capacitado com janelas de tempo. [Internet] [Thesis]. Universidade do Vale do Rio do Sinos; 2011. [cited 2019 Jun 19]. Available from: http://bdtd.unisinos.br/tde_busca/arquivo.php?codArquivo=1811.

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

Council of Science Editors:

Galafassi C. Aplicação de metaheurísticas na abordagem do problema de roteamento de veículos capacitado com janelas de tempo. [Thesis]. Universidade do Vale do Rio do Sinos; 2011. Available from: http://bdtd.unisinos.br/tde_busca/arquivo.php?codArquivo=1811

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

23. Zhou, Yi. Optimization Algorithms for Clique Problems : Algorithmes d’Optimisation pour quelques Problèmes de Clique.

Degree: Docteur es, Informatique, 2017, Angers

Cette thèse présente des algorithmes de résolution de quatre problèmes de clique : clique de poids maximum (MVWCP), s-plex maximum (MsPlex), clique maximum équilibrée dans… (more)

Subjects/Keywords: Problèmes de clique; Recherche locale; Réseaux complexes réels; Algorithmes exacts; Expérimentations; Clique problems; Local search; Large real-Life networks; Metaheuristics; Exact algorithms; Computational experiments; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, Y. (2017). Optimization Algorithms for Clique Problems : Algorithmes d’Optimisation pour quelques Problèmes de Clique. (Doctoral Dissertation). Angers. Retrieved from http://www.theses.fr/2017ANGE0013

Chicago Manual of Style (16th Edition):

Zhou, Yi. “Optimization Algorithms for Clique Problems : Algorithmes d’Optimisation pour quelques Problèmes de Clique.” 2017. Doctoral Dissertation, Angers. Accessed June 19, 2019. http://www.theses.fr/2017ANGE0013.

MLA Handbook (7th Edition):

Zhou, Yi. “Optimization Algorithms for Clique Problems : Algorithmes d’Optimisation pour quelques Problèmes de Clique.” 2017. Web. 19 Jun 2019.

Vancouver:

Zhou Y. Optimization Algorithms for Clique Problems : Algorithmes d’Optimisation pour quelques Problèmes de Clique. [Internet] [Doctoral dissertation]. Angers; 2017. [cited 2019 Jun 19]. Available from: http://www.theses.fr/2017ANGE0013.

Council of Science Editors:

Zhou Y. Optimization Algorithms for Clique Problems : Algorithmes d’Optimisation pour quelques Problèmes de Clique. [Doctoral Dissertation]. Angers; 2017. Available from: http://www.theses.fr/2017ANGE0013

24. Ayachi Hajjem, Imen. Techniques avancées d'optimisation pour la résolution du problème de stockage de conteneurs dans un port : Advanced optimization techniques for solving the containers storage problem.

Degree: Docteur es, Automatique, génie informatique, traitement du signal et image, 2012, Ecole centrale de Lille; École nationale d'ingénieurs de Tunis (Tunisie)

Le chargement/déchargement des conteneurs et leurs stockages provisoires dans le port est la plus importante et complexe tâche dans les terminaux portuaires. Elle est fortement… (more)

Subjects/Keywords: Problème de stockage des conteneurs; Statique; Dynamique; Algorithme génétique; Recherche harmonique; Optimisation; Mouvements de remaniements; Métaheuristiques; Container Stacking Problem; Static; Dynamic; Genetic algorithm; Harmony search; Optimization; Rehandling operations; Metaheuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ayachi Hajjem, I. (2012). Techniques avancées d'optimisation pour la résolution du problème de stockage de conteneurs dans un port : Advanced optimization techniques for solving the containers storage problem. (Doctoral Dissertation). Ecole centrale de Lille; École nationale d'ingénieurs de Tunis (Tunisie). Retrieved from http://www.theses.fr/2012ECLI0003

Chicago Manual of Style (16th Edition):

Ayachi Hajjem, Imen. “Techniques avancées d'optimisation pour la résolution du problème de stockage de conteneurs dans un port : Advanced optimization techniques for solving the containers storage problem.” 2012. Doctoral Dissertation, Ecole centrale de Lille; École nationale d'ingénieurs de Tunis (Tunisie). Accessed June 19, 2019. http://www.theses.fr/2012ECLI0003.

MLA Handbook (7th Edition):

Ayachi Hajjem, Imen. “Techniques avancées d'optimisation pour la résolution du problème de stockage de conteneurs dans un port : Advanced optimization techniques for solving the containers storage problem.” 2012. Web. 19 Jun 2019.

Vancouver:

Ayachi Hajjem I. Techniques avancées d'optimisation pour la résolution du problème de stockage de conteneurs dans un port : Advanced optimization techniques for solving the containers storage problem. [Internet] [Doctoral dissertation]. Ecole centrale de Lille; École nationale d'ingénieurs de Tunis (Tunisie); 2012. [cited 2019 Jun 19]. Available from: http://www.theses.fr/2012ECLI0003.

Council of Science Editors:

Ayachi Hajjem I. Techniques avancées d'optimisation pour la résolution du problème de stockage de conteneurs dans un port : Advanced optimization techniques for solving the containers storage problem. [Doctoral Dissertation]. Ecole centrale de Lille; École nationale d'ingénieurs de Tunis (Tunisie); 2012. Available from: http://www.theses.fr/2012ECLI0003

25. Delevacq, Audrey. Métaheuristiques pour l'optimisation combinatoire sur processeurs graphiques (GPU) : Metaheuristics for combinatorial optimization on Graphics Processing Unit (GPU).

Degree: Docteur es, Sciences - STS, 2013, Reims

Plusieurs problèmes d'optimisation combinatoire sont dits NP-difficiles et ne peuvent être résolus de façon optimale par des algorithmes exacts. Les métaheuristiques ont prouvé qu'elles pouvaient… (more)

Subjects/Keywords: Optimisation combinatoire; Problème du Voyageur de Commerce; Métaheuristiques; Recherche locale; Parallélisme; Gpu; Combinatorial optimization; Traveling Salesman Problem; Metaheuristics; Local search; Parallel computing; Gpu

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Delevacq, A. (2013). Métaheuristiques pour l'optimisation combinatoire sur processeurs graphiques (GPU) : Metaheuristics for combinatorial optimization on Graphics Processing Unit (GPU). (Doctoral Dissertation). Reims. Retrieved from http://www.theses.fr/2013REIMS011

Chicago Manual of Style (16th Edition):

Delevacq, Audrey. “Métaheuristiques pour l'optimisation combinatoire sur processeurs graphiques (GPU) : Metaheuristics for combinatorial optimization on Graphics Processing Unit (GPU).” 2013. Doctoral Dissertation, Reims. Accessed June 19, 2019. http://www.theses.fr/2013REIMS011.

MLA Handbook (7th Edition):

Delevacq, Audrey. “Métaheuristiques pour l'optimisation combinatoire sur processeurs graphiques (GPU) : Metaheuristics for combinatorial optimization on Graphics Processing Unit (GPU).” 2013. Web. 19 Jun 2019.

Vancouver:

Delevacq A. Métaheuristiques pour l'optimisation combinatoire sur processeurs graphiques (GPU) : Metaheuristics for combinatorial optimization on Graphics Processing Unit (GPU). [Internet] [Doctoral dissertation]. Reims; 2013. [cited 2019 Jun 19]. Available from: http://www.theses.fr/2013REIMS011.

Council of Science Editors:

Delevacq A. Métaheuristiques pour l'optimisation combinatoire sur processeurs graphiques (GPU) : Metaheuristics for combinatorial optimization on Graphics Processing Unit (GPU). [Doctoral Dissertation]. Reims; 2013. Available from: http://www.theses.fr/2013REIMS011

26. Gardeux, Vincent. Conception d'heuristiques d'optimisation pour les problèmes de grande dimension : application à l'analyse de données de puces à ADN : Heuristics implementation for high-dimensional problem optimization : application in microarray data analysis.

Degree: Docteur es, Informatique, 2011, Université Paris-Est

Cette thèse expose la problématique récente concernant la résolution de problèmes de grande dimension. Nous présentons les méthodes permettant de les résoudre ainsi que leurs… (more)

Subjects/Keywords: Métaheuristiques; Problèmes de grande dimension; Fouille de données; Génomique; Recherche linéaire; Analyse de puces à ADN; Metaheuristics; High dimensional problems; Data mining; Genomic; Line search; DNA microarray analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gardeux, V. (2011). Conception d'heuristiques d'optimisation pour les problèmes de grande dimension : application à l'analyse de données de puces à ADN : Heuristics implementation for high-dimensional problem optimization : application in microarray data analysis. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2011PEST1022

Chicago Manual of Style (16th Edition):

Gardeux, Vincent. “Conception d'heuristiques d'optimisation pour les problèmes de grande dimension : application à l'analyse de données de puces à ADN : Heuristics implementation for high-dimensional problem optimization : application in microarray data analysis.” 2011. Doctoral Dissertation, Université Paris-Est. Accessed June 19, 2019. http://www.theses.fr/2011PEST1022.

MLA Handbook (7th Edition):

Gardeux, Vincent. “Conception d'heuristiques d'optimisation pour les problèmes de grande dimension : application à l'analyse de données de puces à ADN : Heuristics implementation for high-dimensional problem optimization : application in microarray data analysis.” 2011. Web. 19 Jun 2019.

Vancouver:

Gardeux V. Conception d'heuristiques d'optimisation pour les problèmes de grande dimension : application à l'analyse de données de puces à ADN : Heuristics implementation for high-dimensional problem optimization : application in microarray data analysis. [Internet] [Doctoral dissertation]. Université Paris-Est; 2011. [cited 2019 Jun 19]. Available from: http://www.theses.fr/2011PEST1022.

Council of Science Editors:

Gardeux V. Conception d'heuristiques d'optimisation pour les problèmes de grande dimension : application à l'analyse de données de puces à ADN : Heuristics implementation for high-dimensional problem optimization : application in microarray data analysis. [Doctoral Dissertation]. Université Paris-Est; 2011. Available from: http://www.theses.fr/2011PEST1022

27. Ahmad, Maqsood. Mathematical models and methods based on metaheuristic approach for timetabling problem : Les modèles mathématiques et des méthodes fondées sur l'approche métaheuristique pour résoudre les problèmes d'établissement des horaires.

Degree: Docteur es, Informatique, 2013, Université Blaise-Pascale, Clermont-Ferrand II

Résumé indisponible.

In this thesis we have concerned ourselves with university timetabling problems both course timetabling and examination timetabling problems. Most of the timetabling problems… (more)

Subjects/Keywords: Timetabling; Optimisation combinatoire; Modélisation mathématique; Méta heuristiques; Algorithme mémétique; Recherche tabou; Timetabling problem; Combinatorial optimization; Mathematical modeling; Resource constrained project scheduling problem; Metaheuristics; Memetic algorithm; Tabu search; Honey bee mating

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ahmad, M. (2013). Mathematical models and methods based on metaheuristic approach for timetabling problem : Les modèles mathématiques et des méthodes fondées sur l'approche métaheuristique pour résoudre les problèmes d'établissement des horaires. (Doctoral Dissertation). Université Blaise-Pascale, Clermont-Ferrand II. Retrieved from http://www.theses.fr/2013CLF22393

Chicago Manual of Style (16th Edition):

Ahmad, Maqsood. “Mathematical models and methods based on metaheuristic approach for timetabling problem : Les modèles mathématiques et des méthodes fondées sur l'approche métaheuristique pour résoudre les problèmes d'établissement des horaires.” 2013. Doctoral Dissertation, Université Blaise-Pascale, Clermont-Ferrand II. Accessed June 19, 2019. http://www.theses.fr/2013CLF22393.

MLA Handbook (7th Edition):

Ahmad, Maqsood. “Mathematical models and methods based on metaheuristic approach for timetabling problem : Les modèles mathématiques et des méthodes fondées sur l'approche métaheuristique pour résoudre les problèmes d'établissement des horaires.” 2013. Web. 19 Jun 2019.

Vancouver:

Ahmad M. Mathematical models and methods based on metaheuristic approach for timetabling problem : Les modèles mathématiques et des méthodes fondées sur l'approche métaheuristique pour résoudre les problèmes d'établissement des horaires. [Internet] [Doctoral dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2013. [cited 2019 Jun 19]. Available from: http://www.theses.fr/2013CLF22393.

Council of Science Editors:

Ahmad M. Mathematical models and methods based on metaheuristic approach for timetabling problem : Les modèles mathématiques et des méthodes fondées sur l'approche métaheuristique pour résoudre les problèmes d'établissement des horaires. [Doctoral Dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2013. Available from: http://www.theses.fr/2013CLF22393

28. 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 19, 2019. 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. 19 Jun 2019.

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 2019 Jun 19]. 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

29. Gómez Cámara, José Rubén. Diseño de un sistema de recogida de residuos urbanos : enfoque multiobjetivo y uso de metaheurísticos.

Degree: Departamento de Ingeniería Civil, 2011, Universidad de Burgos

 En este trabajo se desarrolla un método para resolver el problema de diseño de rutas, a lo largo de un horizonte de planificación predeterminado, para… (more)

Subjects/Keywords: Residuos Urbanos; Metaheurísticos; Búsqueda Tabú; Problema Multiobjetivo; MOAMP; Urban Wastes; Metaheuristics; Tabu Search; Multiobjective Problem; Empresas-Gestión; Industrial management; 120704; 332907; 531107

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gómez Cámara, J. R. (2011). Diseño de un sistema de recogida de residuos urbanos : enfoque multiobjetivo y uso de metaheurísticos. (Thesis). Universidad de Burgos. Retrieved from http://hdl.handle.net/10259/105

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):

Gómez Cámara, José Rubén. “Diseño de un sistema de recogida de residuos urbanos : enfoque multiobjetivo y uso de metaheurísticos.” 2011. Thesis, Universidad de Burgos. Accessed June 19, 2019. http://hdl.handle.net/10259/105.

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

MLA Handbook (7th Edition):

Gómez Cámara, José Rubén. “Diseño de un sistema de recogida de residuos urbanos : enfoque multiobjetivo y uso de metaheurísticos.” 2011. Web. 19 Jun 2019.

Vancouver:

Gómez Cámara JR. Diseño de un sistema de recogida de residuos urbanos : enfoque multiobjetivo y uso de metaheurísticos. [Internet] [Thesis]. Universidad de Burgos; 2011. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/10259/105.

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

Council of Science Editors:

Gómez Cámara JR. Diseño de un sistema de recogida de residuos urbanos : enfoque multiobjetivo y uso de metaheurísticos. [Thesis]. Universidad de Burgos; 2011. Available from: http://hdl.handle.net/10259/105

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

30. Ma, Fuda. Multiple Operator Metaheuristics for Graph Partitioning Problems : Heuristiques à opérateurs multiples pour des problèmes de partitionnement de graphe.

Degree: Docteur es, Informatique, 2016, Angers

Les problèmes de partitionnement de graphique sont une classe bien connue des problèmes d'optimisation combinatoire NP-difficiles avec un large éventail d'applications, telles que la conception… (more)

Subjects/Keywords: Optimisation combinatoire; Stratégies de recherche à opérateur multiple; Problèmes de partitionnement de graphe; Multiple search strategies; Heuristics and metaheuristics; Graph partitioning problems; 510

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ma, F. (2016). Multiple Operator Metaheuristics for Graph Partitioning Problems : Heuristiques à opérateurs multiples pour des problèmes de partitionnement de graphe. (Doctoral Dissertation). Angers. Retrieved from http://www.theses.fr/2016ANGE0010

Chicago Manual of Style (16th Edition):

Ma, Fuda. “Multiple Operator Metaheuristics for Graph Partitioning Problems : Heuristiques à opérateurs multiples pour des problèmes de partitionnement de graphe.” 2016. Doctoral Dissertation, Angers. Accessed June 19, 2019. http://www.theses.fr/2016ANGE0010.

MLA Handbook (7th Edition):

Ma, Fuda. “Multiple Operator Metaheuristics for Graph Partitioning Problems : Heuristiques à opérateurs multiples pour des problèmes de partitionnement de graphe.” 2016. Web. 19 Jun 2019.

Vancouver:

Ma F. Multiple Operator Metaheuristics for Graph Partitioning Problems : Heuristiques à opérateurs multiples pour des problèmes de partitionnement de graphe. [Internet] [Doctoral dissertation]. Angers; 2016. [cited 2019 Jun 19]. Available from: http://www.theses.fr/2016ANGE0010.

Council of Science Editors:

Ma F. Multiple Operator Metaheuristics for Graph Partitioning Problems : Heuristiques à opérateurs multiples pour des problèmes de partitionnement de graphe. [Doctoral Dissertation]. Angers; 2016. Available from: http://www.theses.fr/2016ANGE0010

[1] [2] [3] [4] [5] … [353]

.