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:(local search algorithms). Showing records 1 – 30 of 42 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


Delft University of Technology

1. Villa Acuña, Paloma (author). An enhanced Genetic Algorithm and its application on two non-linear geophysical problems.

Degree: 2018, Delft University of Technology

 Since its inception in 1975, Genetics Algorithms (GAs) have been successfully used as a tool for global optimization on non-convex problems in a wide range… (more)

Subjects/Keywords: Genetic Algorithms; Global search; Local search; Convergence speed

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Villa Acuña, P. (. (2018). An enhanced Genetic Algorithm and its application on two non-linear geophysical problems. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:cf4bf7ed-222f-4248-aa0e-f8d085125e4d

Chicago Manual of Style (16th Edition):

Villa Acuña, Paloma (author). “An enhanced Genetic Algorithm and its application on two non-linear geophysical problems.” 2018. Masters Thesis, Delft University of Technology. Accessed February 28, 2021. http://resolver.tudelft.nl/uuid:cf4bf7ed-222f-4248-aa0e-f8d085125e4d.

MLA Handbook (7th Edition):

Villa Acuña, Paloma (author). “An enhanced Genetic Algorithm and its application on two non-linear geophysical problems.” 2018. Web. 28 Feb 2021.

Vancouver:

Villa Acuña P(. An enhanced Genetic Algorithm and its application on two non-linear geophysical problems. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Feb 28]. Available from: http://resolver.tudelft.nl/uuid:cf4bf7ed-222f-4248-aa0e-f8d085125e4d.

Council of Science Editors:

Villa Acuña P(. An enhanced Genetic Algorithm and its application on two non-linear geophysical problems. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:cf4bf7ed-222f-4248-aa0e-f8d085125e4d


Colorado State University

2. Hains, Douglas R. Generalized partition crossover for the traveling salesman problem.

Degree: MS(M.S.), Computer Science, 2011, Colorado State University

 The Traveling Salesman Problem (TSP) is a well-studied combinatorial optimization problem with a wide spectrum of applications and theoretical value. We have designed a new… (more)

Subjects/Keywords: genetic algorithms; Traveling Salesman Problem; search space; local search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hains, D. R. (2011). Generalized partition crossover for the traveling salesman problem. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/47314

Chicago Manual of Style (16th Edition):

Hains, Douglas R. “Generalized partition crossover for the traveling salesman problem.” 2011. Masters Thesis, Colorado State University. Accessed February 28, 2021. http://hdl.handle.net/10217/47314.

MLA Handbook (7th Edition):

Hains, Douglas R. “Generalized partition crossover for the traveling salesman problem.” 2011. Web. 28 Feb 2021.

Vancouver:

Hains DR. Generalized partition crossover for the traveling salesman problem. [Internet] [Masters thesis]. Colorado State University; 2011. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10217/47314.

Council of Science Editors:

Hains DR. Generalized partition crossover for the traveling salesman problem. [Masters Thesis]. Colorado State University; 2011. Available from: http://hdl.handle.net/10217/47314


Brunel University

3. Alkandari, Abdulaziz. 3D packing of balls in different containers by VNS.

Degree: PhD, 2013, Brunel University

 In real world applications such as the transporting of goods products, packing is a major issue. Goods products need to be packed such that the… (more)

Subjects/Keywords: Packing spheres; Optimization; VNS algorithms; Parallel VNS; Schittkowski's local search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alkandari, A. (2013). 3D packing of balls in different containers by VNS. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/8052 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.589988

Chicago Manual of Style (16th Edition):

Alkandari, Abdulaziz. “3D packing of balls in different containers by VNS.” 2013. Doctoral Dissertation, Brunel University. Accessed February 28, 2021. http://bura.brunel.ac.uk/handle/2438/8052 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.589988.

MLA Handbook (7th Edition):

Alkandari, Abdulaziz. “3D packing of balls in different containers by VNS.” 2013. Web. 28 Feb 2021.

Vancouver:

Alkandari A. 3D packing of balls in different containers by VNS. [Internet] [Doctoral dissertation]. Brunel University; 2013. [cited 2021 Feb 28]. Available from: http://bura.brunel.ac.uk/handle/2438/8052 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.589988.

Council of Science Editors:

Alkandari A. 3D packing of balls in different containers by VNS. [Doctoral Dissertation]. Brunel University; 2013. Available from: http://bura.brunel.ac.uk/handle/2438/8052 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.589988


Robert Gordon University

4. Magaji, Amina Sambo-Muhammad. Combining search strategies for distributed constraint satisfaction.

Degree: PhD, 2015, Robert Gordon University

 Many real-life problems such as distributed meeting scheduling, mobile frequency allocation and resource allocation can be solved using multi-agent paradigms. Distributed constraint satisfaction problems (DisCSPs)… (more)

Subjects/Keywords: 005.1; Distributed constraint satisfaction; Distributed problem solving; Local search; Algorithms; Local optima; Heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Magaji, A. S. (2015). Combining search strategies for distributed constraint satisfaction. (Doctoral Dissertation). Robert Gordon University. Retrieved from http://hdl.handle.net/10059/1374

Chicago Manual of Style (16th Edition):

Magaji, Amina Sambo-Muhammad. “Combining search strategies for distributed constraint satisfaction.” 2015. Doctoral Dissertation, Robert Gordon University. Accessed February 28, 2021. http://hdl.handle.net/10059/1374.

MLA Handbook (7th Edition):

Magaji, Amina Sambo-Muhammad. “Combining search strategies for distributed constraint satisfaction.” 2015. Web. 28 Feb 2021.

Vancouver:

Magaji AS. Combining search strategies for distributed constraint satisfaction. [Internet] [Doctoral dissertation]. Robert Gordon University; 2015. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10059/1374.

Council of Science Editors:

Magaji AS. Combining search strategies for distributed constraint satisfaction. [Doctoral Dissertation]. Robert Gordon University; 2015. Available from: http://hdl.handle.net/10059/1374


North Carolina State University

5. Partheepan, Rajasooriyar. Hybrid Genetic Algorithms.

Degree: MS, Civil Engineering, 2004, North Carolina State University

 Genetic algorithms (GAs), a class of evolutionary algorithms, emerging to be a promising procedure for solving engineering optimization problems. As GAs are able to conduct… (more)

Subjects/Keywords: Hybrid Genetic Algorithms; Genetic Algorithms; Local Search; Evolutionary Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Partheepan, R. (2004). Hybrid Genetic Algorithms. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/205

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

Partheepan, Rajasooriyar. “Hybrid Genetic Algorithms.” 2004. Thesis, North Carolina State University. Accessed February 28, 2021. http://www.lib.ncsu.edu/resolver/1840.16/205.

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

MLA Handbook (7th Edition):

Partheepan, Rajasooriyar. “Hybrid Genetic Algorithms.” 2004. Web. 28 Feb 2021.

Vancouver:

Partheepan R. Hybrid Genetic Algorithms. [Internet] [Thesis]. North Carolina State University; 2004. [cited 2021 Feb 28]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/205.

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

Council of Science Editors:

Partheepan R. Hybrid Genetic Algorithms. [Thesis]. North Carolina State University; 2004. Available from: http://www.lib.ncsu.edu/resolver/1840.16/205

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


Delft University of Technology

6. Dai, Lu (author). A machine learning approach for optimisation in railway planning.

Degree: 2018, Delft University of Technology

Planning and scheduling problem is a hard problem, especially in real life cases. The time and space complexity increase quickly along with the increase of… (more)

Subjects/Keywords: Planning & scheduling algorithms; Machine learning; Local search algorithm; Imbalanced learning; Feature extraction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dai, L. (. (2018). A machine learning approach for optimisation in railway planning. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:20170a8c-7e1e-434f-b5d6-9ba933e2ab6e

Chicago Manual of Style (16th Edition):

Dai, Lu (author). “A machine learning approach for optimisation in railway planning.” 2018. Masters Thesis, Delft University of Technology. Accessed February 28, 2021. http://resolver.tudelft.nl/uuid:20170a8c-7e1e-434f-b5d6-9ba933e2ab6e.

MLA Handbook (7th Edition):

Dai, Lu (author). “A machine learning approach for optimisation in railway planning.” 2018. Web. 28 Feb 2021.

Vancouver:

Dai L(. A machine learning approach for optimisation in railway planning. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Feb 28]. Available from: http://resolver.tudelft.nl/uuid:20170a8c-7e1e-434f-b5d6-9ba933e2ab6e.

Council of Science Editors:

Dai L(. A machine learning approach for optimisation in railway planning. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:20170a8c-7e1e-434f-b5d6-9ba933e2ab6e

7. Samei, Nasim. Local Search Approximation Algorithms for Clustering Problems.

Degree: 2019, University of Western Ontario

 In this research we study the use of local search in the design of approximation algorithms for NP-hard optimization problems. For our study we have… (more)

Subjects/Keywords: Combinatorial Optimization; Approximation Algorithms; Local Search; Facility Location; Multiway Cut; k-Cut; Computer Sciences; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Samei, N. (2019). Local Search Approximation Algorithms for Clustering Problems. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/6138

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

Samei, Nasim. “Local Search Approximation Algorithms for Clustering Problems.” 2019. Thesis, University of Western Ontario. Accessed February 28, 2021. https://ir.lib.uwo.ca/etd/6138.

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

MLA Handbook (7th Edition):

Samei, Nasim. “Local Search Approximation Algorithms for Clustering Problems.” 2019. Web. 28 Feb 2021.

Vancouver:

Samei N. Local Search Approximation Algorithms for Clustering Problems. [Internet] [Thesis]. University of Western Ontario; 2019. [cited 2021 Feb 28]. Available from: https://ir.lib.uwo.ca/etd/6138.

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

Council of Science Editors:

Samei N. Local Search Approximation Algorithms for Clustering Problems. [Thesis]. University of Western Ontario; 2019. Available from: https://ir.lib.uwo.ca/etd/6138

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


Penn State University

8. Thadakamalla, Hari Prasad. Decentralized algorithms for search and routing in large-scale networks.

Degree: 2008, Penn State University

 During the past decade, advances in technology and science have led to many large-scale distributed systems which can be characterized as networks. Some examples include… (more)

Subjects/Keywords: decentralized search; localized algorithms; complex networks; networks; local search; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Thadakamalla, H. P. (2008). Decentralized algorithms for search and routing in large-scale networks. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/8079

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

Thadakamalla, Hari Prasad. “Decentralized algorithms for search and routing in large-scale networks.” 2008. Thesis, Penn State University. Accessed February 28, 2021. https://submit-etda.libraries.psu.edu/catalog/8079.

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

MLA Handbook (7th Edition):

Thadakamalla, Hari Prasad. “Decentralized algorithms for search and routing in large-scale networks.” 2008. Web. 28 Feb 2021.

Vancouver:

Thadakamalla HP. Decentralized algorithms for search and routing in large-scale networks. [Internet] [Thesis]. Penn State University; 2008. [cited 2021 Feb 28]. Available from: https://submit-etda.libraries.psu.edu/catalog/8079.

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

Council of Science Editors:

Thadakamalla HP. Decentralized algorithms for search and routing in large-scale networks. [Thesis]. Penn State University; 2008. Available from: https://submit-etda.libraries.psu.edu/catalog/8079

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

9. WU LIPENG. Large-scale structural identification by multi-civilization genetic algorithm approach.

Degree: 2004, National University of Singapore

Subjects/Keywords: System Identification; Genetic Algorithms; Local Search; Parallel Genetic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

LIPENG, W. (2004). Large-scale structural identification by multi-civilization genetic algorithm approach. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/13876

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

LIPENG, WU. “Large-scale structural identification by multi-civilization genetic algorithm approach.” 2004. Thesis, National University of Singapore. Accessed February 28, 2021. http://scholarbank.nus.edu.sg/handle/10635/13876.

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

MLA Handbook (7th Edition):

LIPENG, WU. “Large-scale structural identification by multi-civilization genetic algorithm approach.” 2004. Web. 28 Feb 2021.

Vancouver:

LIPENG W. Large-scale structural identification by multi-civilization genetic algorithm approach. [Internet] [Thesis]. National University of Singapore; 2004. [cited 2021 Feb 28]. Available from: http://scholarbank.nus.edu.sg/handle/10635/13876.

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

Council of Science Editors:

LIPENG W. Large-scale structural identification by multi-civilization genetic algorithm approach. [Thesis]. National University of Singapore; 2004. Available from: http://scholarbank.nus.edu.sg/handle/10635/13876

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


University of Michigan

10. Sukhapesna, Sanphet. Generalized annealing algorithms for discrete optimization problems.

Degree: PhD, Operations research, 2005, University of Michigan

 Despite the success of simulated annealing to find near-optimal solutions of intractable discrete optimization problems, there have been attempts to enhance the algorithm by modifying… (more)

Subjects/Keywords: Algorithms; Annealing; Discrete Optimization; Generalized; Local Search; Problems; Stochastic Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sukhapesna, S. (2005). Generalized annealing algorithms for discrete optimization problems. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/125513

Chicago Manual of Style (16th Edition):

Sukhapesna, Sanphet. “Generalized annealing algorithms for discrete optimization problems.” 2005. Doctoral Dissertation, University of Michigan. Accessed February 28, 2021. http://hdl.handle.net/2027.42/125513.

MLA Handbook (7th Edition):

Sukhapesna, Sanphet. “Generalized annealing algorithms for discrete optimization problems.” 2005. Web. 28 Feb 2021.

Vancouver:

Sukhapesna S. Generalized annealing algorithms for discrete optimization problems. [Internet] [Doctoral dissertation]. University of Michigan; 2005. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/2027.42/125513.

Council of Science Editors:

Sukhapesna S. Generalized annealing algorithms for discrete optimization problems. [Doctoral Dissertation]. University of Michigan; 2005. Available from: http://hdl.handle.net/2027.42/125513

11. Petikas, Isidoros. Υβριδικοί εξελικτικοί αλγόριθμοι βελτιστοποίησης και εφαρμογές σε προβλήματα συνδυαστικής βελτιστοποίησης.

Degree: 2012, University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς

The objective of this thesis is the study and research of effective algorithmic approaches for addressing computationally hard optimization problems, through the analysis and the… (more)

Subjects/Keywords: Εξελικτικοί αλγόριθμοι; Αλγόριθμοι τοπικής αναζήτησης; Υβριδικές εξελικτικές προσεγγίσεις; Προβλήματα βελτιστοποίησης; Συνδυαστική βελτιστοποίηση; Evolutionary algorithms; Local search algorithms; Hybrid evolutionary approaches; Optimization problems; Combinational optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Petikas, I. (2012). Υβριδικοί εξελικτικοί αλγόριθμοι βελτιστοποίησης και εφαρμογές σε προβλήματα συνδυαστικής βελτιστοποίησης. (Thesis). University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς. Retrieved from http://hdl.handle.net/10442/hedi/34591

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

Petikas, Isidoros. “Υβριδικοί εξελικτικοί αλγόριθμοι βελτιστοποίησης και εφαρμογές σε προβλήματα συνδυαστικής βελτιστοποίησης.” 2012. Thesis, University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς. Accessed February 28, 2021. http://hdl.handle.net/10442/hedi/34591.

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

MLA Handbook (7th Edition):

Petikas, Isidoros. “Υβριδικοί εξελικτικοί αλγόριθμοι βελτιστοποίησης και εφαρμογές σε προβλήματα συνδυαστικής βελτιστοποίησης.” 2012. Web. 28 Feb 2021.

Vancouver:

Petikas I. Υβριδικοί εξελικτικοί αλγόριθμοι βελτιστοποίησης και εφαρμογές σε προβλήματα συνδυαστικής βελτιστοποίησης. [Internet] [Thesis]. University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς; 2012. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10442/hedi/34591.

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

Council of Science Editors:

Petikas I. Υβριδικοί εξελικτικοί αλγόριθμοι βελτιστοποίησης και εφαρμογές σε προβλήματα συνδυαστικής βελτιστοποίησης. [Thesis]. University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς; 2012. Available from: http://hdl.handle.net/10442/hedi/34591

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

12. Duh, Martin. Hibridni algoritmi za barvanje grafov.

Degree: 2016, Univerza v Mariboru

Tema magistrskega dela je barvanje grafov s pomoˇcjo hibridnih algoritmov. V magistrskem delu predstavimo algoritem za barvanje grafa z variabilnim lokalnim iskanjem in hibridni algoritem… (more)

Subjects/Keywords: algoritmi; grafi; barvanje grafa; lokalno iskanje; variabilno lokalno iskanje, evolucijski algoritmi; hibridni algoritmi; algorithms; graphs; graph coloring; local search; variable neighborhood search, evolutionary algorithms; hybrid algorithms; info:eu-repo/classification/udc/004.421.2:519.174.7(043.2)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duh, M. (2016). Hibridni algoritmi za barvanje grafov. (Masters Thesis). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=57048 ; https://dk.um.si/Dokument.php?id=85316&dn= ; https://plus.si.cobiss.net/opac7/bib/21896456?lang=sl

Chicago Manual of Style (16th Edition):

Duh, Martin. “Hibridni algoritmi za barvanje grafov.” 2016. Masters Thesis, Univerza v Mariboru. Accessed February 28, 2021. https://dk.um.si/IzpisGradiva.php?id=57048 ; https://dk.um.si/Dokument.php?id=85316&dn= ; https://plus.si.cobiss.net/opac7/bib/21896456?lang=sl.

MLA Handbook (7th Edition):

Duh, Martin. “Hibridni algoritmi za barvanje grafov.” 2016. Web. 28 Feb 2021.

Vancouver:

Duh M. Hibridni algoritmi za barvanje grafov. [Internet] [Masters thesis]. Univerza v Mariboru; 2016. [cited 2021 Feb 28]. Available from: https://dk.um.si/IzpisGradiva.php?id=57048 ; https://dk.um.si/Dokument.php?id=85316&dn= ; https://plus.si.cobiss.net/opac7/bib/21896456?lang=sl.

Council of Science Editors:

Duh M. Hibridni algoritmi za barvanje grafov. [Masters Thesis]. Univerza v Mariboru; 2016. Available from: https://dk.um.si/IzpisGradiva.php?id=57048 ; https://dk.um.si/Dokument.php?id=85316&dn= ; https://plus.si.cobiss.net/opac7/bib/21896456?lang=sl


University of Pretoria

13. [No author]. A memetic genetic program for knowledge discovery .

Degree: 2006, University of Pretoria

Local search algorithms have been proved to be effective in refining solutions that have been found by other algorithms. Evolutionary algorithms, in particular global search(more)

Subjects/Keywords: Global search; Classification problems; Optimisation; Local search; Genetic program; Decision trees; Bgp; Mbgp.; Building block hypothesis; Memetic algorithms; Evolutionary algorithms; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2006). A memetic genetic program for knowledge discovery . (Masters Thesis). University of Pretoria. Retrieved from http://upetd.up.ac.za/thesis/available/etd-06092005-091517/

Chicago Manual of Style (16th Edition):

author], [No. “A memetic genetic program for knowledge discovery .” 2006. Masters Thesis, University of Pretoria. Accessed February 28, 2021. http://upetd.up.ac.za/thesis/available/etd-06092005-091517/.

MLA Handbook (7th Edition):

author], [No. “A memetic genetic program for knowledge discovery .” 2006. Web. 28 Feb 2021.

Vancouver:

author] [. A memetic genetic program for knowledge discovery . [Internet] [Masters thesis]. University of Pretoria; 2006. [cited 2021 Feb 28]. Available from: http://upetd.up.ac.za/thesis/available/etd-06092005-091517/.

Council of Science Editors:

author] [. A memetic genetic program for knowledge discovery . [Masters Thesis]. University of Pretoria; 2006. Available from: http://upetd.up.ac.za/thesis/available/etd-06092005-091517/


University of Pretoria

14. Nel, Gert M. A memetic genetic program for knowledge discovery.

Degree: Computer Science, 2006, University of Pretoria

Local search algorithms have been proved to be effective in refining solutions that have been found by other algorithms. Evolutionary algorithms, in particular global search(more)

Subjects/Keywords: Global search; Classification problems; Optimisation; Local search; Genetic program; Decision trees; Bgp; Mbgp.; Building block hypothesis; Memetic algorithms; Evolutionary algorithms; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nel, G. M. (2006). A memetic genetic program for knowledge discovery. (Masters Thesis). University of Pretoria. Retrieved from http://hdl.handle.net/2263/25350

Chicago Manual of Style (16th Edition):

Nel, Gert M. “A memetic genetic program for knowledge discovery.” 2006. Masters Thesis, University of Pretoria. Accessed February 28, 2021. http://hdl.handle.net/2263/25350.

MLA Handbook (7th Edition):

Nel, Gert M. “A memetic genetic program for knowledge discovery.” 2006. Web. 28 Feb 2021.

Vancouver:

Nel GM. A memetic genetic program for knowledge discovery. [Internet] [Masters thesis]. University of Pretoria; 2006. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/2263/25350.

Council of Science Editors:

Nel GM. A memetic genetic program for knowledge discovery. [Masters Thesis]. University of Pretoria; 2006. Available from: http://hdl.handle.net/2263/25350


University of Florida

15. Short, Erika J. Local Search Algorithms for the Maximum k-Plex Problem.

Degree: MS, Industrial and Systems Engineering, 2008, University of Florida

 The maximum k-plex problem is one of many ways to classify a cohesive subgroup in social network analysis. Considered to be a type of relaxed… (more)

Subjects/Keywords: Algorithms; Greedy algorithms; Heuristics; Information search; Operations research; Optimal solutions; Social network analysis; Social networking; Taboos; Vertices; kplex, local, search, tabu

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Short, E. J. (2008). Local Search Algorithms for the Maximum k-Plex Problem. (Masters Thesis). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0022261

Chicago Manual of Style (16th Edition):

Short, Erika J. “Local Search Algorithms for the Maximum k-Plex Problem.” 2008. Masters Thesis, University of Florida. Accessed February 28, 2021. https://ufdc.ufl.edu/UFE0022261.

MLA Handbook (7th Edition):

Short, Erika J. “Local Search Algorithms for the Maximum k-Plex Problem.” 2008. Web. 28 Feb 2021.

Vancouver:

Short EJ. Local Search Algorithms for the Maximum k-Plex Problem. [Internet] [Masters thesis]. University of Florida; 2008. [cited 2021 Feb 28]. Available from: https://ufdc.ufl.edu/UFE0022261.

Council of Science Editors:

Short EJ. Local Search Algorithms for the Maximum k-Plex Problem. [Masters Thesis]. University of Florida; 2008. Available from: https://ufdc.ufl.edu/UFE0022261


Universidade do Rio Grande do Sul

16. Dorn, Márcio. MOIRAE : a computational strategy to predict 3-D structures of polypeptides.

Degree: 2012, Universidade do Rio Grande do Sul

 Currently, one of the main research problems in Structural Bioinformatics is associated to the study and prediction of the 3-D structure of proteins. The 1990’s… (more)

Subjects/Keywords: Bioinformática; 3-D protein structure prediction; Structural bioinformatics; Biologia molecular; Algoritmos; GA local-search operator; Genetic algorithms; 3D; Algoritmos geneticos; Artificial neural networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dorn, M. (2012). MOIRAE : a computational strategy to predict 3-D structures of polypeptides. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/142870

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

Dorn, Márcio. “MOIRAE : a computational strategy to predict 3-D structures of polypeptides.” 2012. Thesis, Universidade do Rio Grande do Sul. Accessed February 28, 2021. http://hdl.handle.net/10183/142870.

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

MLA Handbook (7th Edition):

Dorn, Márcio. “MOIRAE : a computational strategy to predict 3-D structures of polypeptides.” 2012. Web. 28 Feb 2021.

Vancouver:

Dorn M. MOIRAE : a computational strategy to predict 3-D structures of polypeptides. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2012. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10183/142870.

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

Council of Science Editors:

Dorn M. MOIRAE : a computational strategy to predict 3-D structures of polypeptides. [Thesis]. Universidade do Rio Grande do Sul; 2012. Available from: http://hdl.handle.net/10183/142870

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

17. 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 February 28, 2021. 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. 28 Feb 2021.

Vancouver:

Zhou Y. Optimization Algorithms for Clique Problems : Algorithmes d’Optimisation pour quelques Problèmes de Clique. [Internet] [Doctoral dissertation]. Angers; 2017. [cited 2021 Feb 28]. 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


Mississippi State University

18. Vural, Arif Volkan. THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS PICK-UP AND DELIVERIES AND A GRASP-GA BASED SOLUTION HEURISTIC.

Degree: PhD, Industrial Engineering, 2007, Mississippi State University

 In this dissertation, the vehicle routing problem and one of its variants, the vehicle routing problem with simultaneous pick up and deliveries (VRPSPD) are studied.… (more)

Subjects/Keywords: meta-heuristic; local search; GRASP; combinatorial optimization; genetic algorithms; vehicle routing problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vural, A. V. (2007). THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS PICK-UP AND DELIVERIES AND A GRASP-GA BASED SOLUTION HEURISTIC. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-09242007-083608/ ;

Chicago Manual of Style (16th Edition):

Vural, Arif Volkan. “THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS PICK-UP AND DELIVERIES AND A GRASP-GA BASED SOLUTION HEURISTIC.” 2007. Doctoral Dissertation, Mississippi State University. Accessed February 28, 2021. http://sun.library.msstate.edu/ETD-db/theses/available/etd-09242007-083608/ ;.

MLA Handbook (7th Edition):

Vural, Arif Volkan. “THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS PICK-UP AND DELIVERIES AND A GRASP-GA BASED SOLUTION HEURISTIC.” 2007. Web. 28 Feb 2021.

Vancouver:

Vural AV. THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS PICK-UP AND DELIVERIES AND A GRASP-GA BASED SOLUTION HEURISTIC. [Internet] [Doctoral dissertation]. Mississippi State University; 2007. [cited 2021 Feb 28]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-09242007-083608/ ;.

Council of Science Editors:

Vural AV. THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS PICK-UP AND DELIVERIES AND A GRASP-GA BASED SOLUTION HEURISTIC. [Doctoral Dissertation]. Mississippi State University; 2007. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-09242007-083608/ ;


ETH Zürich

19. Annamalai, Chidambaram. Algorithmic Advances in Allocation and Scheduling.

Degree: 2017, ETH Zürich

 We design new and improved approximation algorithms for classical problems in machine scheduling and resource allocation. In the machine scheduling problem we consider, we are… (more)

Subjects/Keywords: approximation algorithms; hypergraph matchings; machine scheduling; resource allocation; configuration linear programs; local search; info:eu-repo/classification/ddc/510; info:eu-repo/classification/ddc/004; Mathematics; Data processing, computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Annamalai, C. (2017). Algorithmic Advances in Allocation and Scheduling. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/70

Chicago Manual of Style (16th Edition):

Annamalai, Chidambaram. “Algorithmic Advances in Allocation and Scheduling.” 2017. Doctoral Dissertation, ETH Zürich. Accessed February 28, 2021. http://hdl.handle.net/20.500.11850/70.

MLA Handbook (7th Edition):

Annamalai, Chidambaram. “Algorithmic Advances in Allocation and Scheduling.” 2017. Web. 28 Feb 2021.

Vancouver:

Annamalai C. Algorithmic Advances in Allocation and Scheduling. [Internet] [Doctoral dissertation]. ETH Zürich; 2017. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/20.500.11850/70.

Council of Science Editors:

Annamalai C. Algorithmic Advances in Allocation and Scheduling. [Doctoral Dissertation]. ETH Zürich; 2017. Available from: http://hdl.handle.net/20.500.11850/70

20. 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 February 28, 2021. 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. 28 Feb 2021.

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 2021 Feb 28]. 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

21. MA SICONG. ENHANCING SIMULATION OPTIMIZATION METHODS USING SMOOTHING AND METAMODELING TECHNIQUES.

Degree: 2013, National University of Singapore

Subjects/Keywords: Simulation optimization; direct search methods; probability optimization; local metamodels; smoothing; retrospective-approximation algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

SICONG, M. (2013). ENHANCING SIMULATION OPTIMIZATION METHODS USING SMOOTHING AND METAMODELING TECHNIQUES. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/49285

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

SICONG, MA. “ENHANCING SIMULATION OPTIMIZATION METHODS USING SMOOTHING AND METAMODELING TECHNIQUES.” 2013. Thesis, National University of Singapore. Accessed February 28, 2021. http://scholarbank.nus.edu.sg/handle/10635/49285.

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

MLA Handbook (7th Edition):

SICONG, MA. “ENHANCING SIMULATION OPTIMIZATION METHODS USING SMOOTHING AND METAMODELING TECHNIQUES.” 2013. Web. 28 Feb 2021.

Vancouver:

SICONG M. ENHANCING SIMULATION OPTIMIZATION METHODS USING SMOOTHING AND METAMODELING TECHNIQUES. [Internet] [Thesis]. National University of Singapore; 2013. [cited 2021 Feb 28]. Available from: http://scholarbank.nus.edu.sg/handle/10635/49285.

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

Council of Science Editors:

SICONG M. ENHANCING SIMULATION OPTIMIZATION METHODS USING SMOOTHING AND METAMODELING TECHNIQUES. [Thesis]. National University of Singapore; 2013. Available from: http://scholarbank.nus.edu.sg/handle/10635/49285

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

22. ZENG ZHEN. Coordinated rescheduling of precast production.

Degree: 2007, National University of Singapore

Subjects/Keywords: rescheduling; schedule coordination; multiobjective optimization; genetic algorithms; local search; precast production

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

ZHEN, Z. (2007). Coordinated rescheduling of precast production. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/15701

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

ZHEN, ZENG. “Coordinated rescheduling of precast production.” 2007. Thesis, National University of Singapore. Accessed February 28, 2021. http://scholarbank.nus.edu.sg/handle/10635/15701.

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

MLA Handbook (7th Edition):

ZHEN, ZENG. “Coordinated rescheduling of precast production.” 2007. Web. 28 Feb 2021.

Vancouver:

ZHEN Z. Coordinated rescheduling of precast production. [Internet] [Thesis]. National University of Singapore; 2007. [cited 2021 Feb 28]. Available from: http://scholarbank.nus.edu.sg/handle/10635/15701.

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

Council of Science Editors:

ZHEN Z. Coordinated rescheduling of precast production. [Thesis]. National University of Singapore; 2007. Available from: http://scholarbank.nus.edu.sg/handle/10635/15701

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

23. STEVEN HALIM. An integrated White+Black box approach for designing and tuning stochastic local search algorithms.

Degree: 2009, National University of Singapore

Subjects/Keywords: AN INTEGRATED WHITE+BLACK BOX APPROACH; DESIGNING; TUNING; STOCHASTIC LOCAL SEARCH; ALGORITHMS; VISUALIZATION

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

HALIM, S. (2009). An integrated White+Black box approach for designing and tuning stochastic local search algorithms. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/18062

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

HALIM, STEVEN. “An integrated White+Black box approach for designing and tuning stochastic local search algorithms.” 2009. Thesis, National University of Singapore. Accessed February 28, 2021. http://scholarbank.nus.edu.sg/handle/10635/18062.

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

MLA Handbook (7th Edition):

HALIM, STEVEN. “An integrated White+Black box approach for designing and tuning stochastic local search algorithms.” 2009. Web. 28 Feb 2021.

Vancouver:

HALIM S. An integrated White+Black box approach for designing and tuning stochastic local search algorithms. [Internet] [Thesis]. National University of Singapore; 2009. [cited 2021 Feb 28]. Available from: http://scholarbank.nus.edu.sg/handle/10635/18062.

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

Council of Science Editors:

HALIM S. An integrated White+Black box approach for designing and tuning stochastic local search algorithms. [Thesis]. National University of Singapore; 2009. Available from: http://scholarbank.nus.edu.sg/handle/10635/18062

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

24. Ward, Justin. Oblivious and Non-oblivious Local Search for Combinatorial Optimization.

Degree: 2012, University of Toronto

Standard local search algorithms for combinatorial optimization problems repeatedly apply small changes to a current solution to improve the problem's given objective function. In contrast,… (more)

Subjects/Keywords: Approximation Algorithms; Local Search; Submodular Maximization; Independence Systems; 0984

…there are local search algorithms that consider infeasible solutions during the search process… …and various local search algorithms for MaxCut. In practice, we can eschew the difficulties… …local search Chapter 1. Introduction 5 algorithms. A variant for linear objective… …analyses of particular local search algorithms are based on the algorithms’ locality ratios. One… …search in which g = f oblivious local search algorithms). They show that non-oblivious… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ward, J. (2012). Oblivious and Non-oblivious Local Search for Combinatorial Optimization. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/34957

Chicago Manual of Style (16th Edition):

Ward, Justin. “Oblivious and Non-oblivious Local Search for Combinatorial Optimization.” 2012. Doctoral Dissertation, University of Toronto. Accessed February 28, 2021. http://hdl.handle.net/1807/34957.

MLA Handbook (7th Edition):

Ward, Justin. “Oblivious and Non-oblivious Local Search for Combinatorial Optimization.” 2012. Web. 28 Feb 2021.

Vancouver:

Ward J. Oblivious and Non-oblivious Local Search for Combinatorial Optimization. [Internet] [Doctoral dissertation]. University of Toronto; 2012. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/1807/34957.

Council of Science Editors:

Ward J. Oblivious and Non-oblivious Local Search for Combinatorial Optimization. [Doctoral Dissertation]. University of Toronto; 2012. Available from: http://hdl.handle.net/1807/34957


Colorado State University

25. Watson, Jean-Paul. Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem.

Degree: PhD, Computer Science, 2003, Colorado State University

Local search algorithms are among the most effective approaches for locating high-quality solutions to a wide range of combinatorial optimization problems. However, our theoretical understanding… (more)

Subjects/Keywords: random walk; tabu search; job-shop scheduling problem; empirical methods; local search algorithms; iterated local search; simulated annealing; Production scheduling  – Computer simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Watson, J. (2003). Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/26811

Chicago Manual of Style (16th Edition):

Watson, Jean-Paul. “Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem.” 2003. Doctoral Dissertation, Colorado State University. Accessed February 28, 2021. http://hdl.handle.net/10217/26811.

MLA Handbook (7th Edition):

Watson, Jean-Paul. “Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem.” 2003. Web. 28 Feb 2021.

Vancouver:

Watson J. Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem. [Internet] [Doctoral dissertation]. Colorado State University; 2003. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10217/26811.

Council of Science Editors:

Watson J. Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem. [Doctoral Dissertation]. Colorado State University; 2003. Available from: http://hdl.handle.net/10217/26811


Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

26. Rigas, Emmanouil. Artificial intelligence methods for the management of electric vehicles in the smart grid.

Degree: 2018, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

 The electrification of transport, via the extensive use of Electric Vehicles (EVs) is seen as one of the main pathways to achieve significant reductions in… (more)

Subjects/Keywords: Ηλεκτρικό όχημα; Τεχνητή νοημοσύνη; Βελτιστοποίηση; Αλγόριθμοι αναζήτησης; Αλγόριθμοι τοπικής αναζήτησης; Συστήματα πολλαπλών πρακτόρων; Σχεδιασμός Μηχανισμών; Ευφυή δίκτυα ηλεκτροδότησης; Electric vehicle; Artificial intelligence; Optimization; Search algorithms; Local search; Multi agent systems; Mechanism design; Smart grid

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rigas, E. (2018). Artificial intelligence methods for the management of electric vehicles in the smart grid. (Thesis). Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Retrieved from http://hdl.handle.net/10442/hedi/44843

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

Rigas, Emmanouil. “Artificial intelligence methods for the management of electric vehicles in the smart grid.” 2018. Thesis, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Accessed February 28, 2021. http://hdl.handle.net/10442/hedi/44843.

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

MLA Handbook (7th Edition):

Rigas, Emmanouil. “Artificial intelligence methods for the management of electric vehicles in the smart grid.” 2018. Web. 28 Feb 2021.

Vancouver:

Rigas E. Artificial intelligence methods for the management of electric vehicles in the smart grid. [Internet] [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2018. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10442/hedi/44843.

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

Council of Science Editors:

Rigas E. Artificial intelligence methods for the management of electric vehicles in the smart grid. [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2018. Available from: http://hdl.handle.net/10442/hedi/44843

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


Virginia Tech

27. McInvale, Howard D. Land Leveling Using Optimal Earthmoving Vehicle Routing.

Degree: MS, Industrial and Systems Engineering, 2002, Virginia Tech

 This thesis presents new solution approaches for land leveling, using optimal earthmoving vehicle routing. It addresses the Shortest Route Cut and Fill Problem (SRCFP) developed… (more)

Subjects/Keywords: Discrete Optimization; Traveling Salesman Problem; Heuristics; Vehicle Routing Problems; Local Search Algorithms; Shortest Route Cut-Fill Problem; Generalized Hill Climbing Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McInvale, H. D. (2002). Land Leveling Using Optimal Earthmoving Vehicle Routing. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/42356

Chicago Manual of Style (16th Edition):

McInvale, Howard D. “Land Leveling Using Optimal Earthmoving Vehicle Routing.” 2002. Masters Thesis, Virginia Tech. Accessed February 28, 2021. http://hdl.handle.net/10919/42356.

MLA Handbook (7th Edition):

McInvale, Howard D. “Land Leveling Using Optimal Earthmoving Vehicle Routing.” 2002. Web. 28 Feb 2021.

Vancouver:

McInvale HD. Land Leveling Using Optimal Earthmoving Vehicle Routing. [Internet] [Masters thesis]. Virginia Tech; 2002. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10919/42356.

Council of Science Editors:

McInvale HD. Land Leveling Using Optimal Earthmoving Vehicle Routing. [Masters Thesis]. Virginia Tech; 2002. Available from: http://hdl.handle.net/10919/42356


Université de Lorraine

28. Kadri, Ahmed Abdelmoumene. Simulation and optimization models for scheduling and balancing the public bicycle-sharing systems : Modéles de simulation et d'optimisation pour l'ordonnancement et l'équilibrage des systèmes de vélos en libre-service.

Degree: Docteur es, Informatique, 2015, Université de Lorraine

Les enjeux du développement durable, le réchauffement climatique, la pollution dans les grandes villes, la congestion et les nuisances sonores, l'augmentation des prix de carburants,… (more)

Subjects/Keywords: Systèmes de vélos en libre-Service; Rééquilibrage des stations; Ordonnancement; Optimisation de performances; Optimisation via la simulation; Réseaux de Petri; Algorithmes génétiques; Algorithmes gloutons; Algorithmes de recherche par voisinage; Méthode de séparation et évaluation; Bornes inférieures; Bornes supérieures; Bicycle-Sharing systems; Scheduling problems; Balancing problems; Performance optimization; Optimization-Simulation; Genetic algorithms; Petri nets; Greedy search algorithms; Local search algorithms; Branch-And-Bound algorithms; Lower and upper bounds; 004.3; 388.4

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kadri, A. A. (2015). Simulation and optimization models for scheduling and balancing the public bicycle-sharing systems : Modéles de simulation et d'optimisation pour l'ordonnancement et l'équilibrage des systèmes de vélos en libre-service. (Doctoral Dissertation). Université de Lorraine. Retrieved from http://www.theses.fr/2015LORR0268

Chicago Manual of Style (16th Edition):

Kadri, Ahmed Abdelmoumene. “Simulation and optimization models for scheduling and balancing the public bicycle-sharing systems : Modéles de simulation et d'optimisation pour l'ordonnancement et l'équilibrage des systèmes de vélos en libre-service.” 2015. Doctoral Dissertation, Université de Lorraine. Accessed February 28, 2021. http://www.theses.fr/2015LORR0268.

MLA Handbook (7th Edition):

Kadri, Ahmed Abdelmoumene. “Simulation and optimization models for scheduling and balancing the public bicycle-sharing systems : Modéles de simulation et d'optimisation pour l'ordonnancement et l'équilibrage des systèmes de vélos en libre-service.” 2015. Web. 28 Feb 2021.

Vancouver:

Kadri AA. Simulation and optimization models for scheduling and balancing the public bicycle-sharing systems : Modéles de simulation et d'optimisation pour l'ordonnancement et l'équilibrage des systèmes de vélos en libre-service. [Internet] [Doctoral dissertation]. Université de Lorraine; 2015. [cited 2021 Feb 28]. Available from: http://www.theses.fr/2015LORR0268.

Council of Science Editors:

Kadri AA. Simulation and optimization models for scheduling and balancing the public bicycle-sharing systems : Modéles de simulation et d'optimisation pour l'ordonnancement et l'équilibrage des systèmes de vélos en libre-service. [Doctoral Dissertation]. Université de Lorraine; 2015. Available from: http://www.theses.fr/2015LORR0268


Université Paris-Sud – Paris XI

29. Arbelaez Rodriguez, Alejandro. Learning during search : Apprendre durant la recherche combinatoire.

Degree: Docteur es, Informatique, 2011, Université Paris-Sud – Paris XI

La recherche autonome est un nouveau domaine d'intérêt de la programmation par contraintes, motivé par l'importance reconnue de l'utilisation de l'apprentissage automatique pour le problème… (more)

Subjects/Keywords: Portfolio d'algorithmes; Apprentissage Automatique; Apprentissage Supervisée; Problèmes de satisfaction de contraintes; Problèmes d'optimisation de combinatoire; SAT; Recherche locale; Portfolio Algorithms; Machine Learning; Supervised Learning; Constraint Satisfaction Problems; Constraint Optimization Problems; SAT; Local Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arbelaez Rodriguez, A. (2011). Learning during search : Apprendre durant la recherche combinatoire. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2011PA112063

Chicago Manual of Style (16th Edition):

Arbelaez Rodriguez, Alejandro. “Learning during search : Apprendre durant la recherche combinatoire.” 2011. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed February 28, 2021. http://www.theses.fr/2011PA112063.

MLA Handbook (7th Edition):

Arbelaez Rodriguez, Alejandro. “Learning during search : Apprendre durant la recherche combinatoire.” 2011. Web. 28 Feb 2021.

Vancouver:

Arbelaez Rodriguez A. Learning during search : Apprendre durant la recherche combinatoire. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2011. [cited 2021 Feb 28]. Available from: http://www.theses.fr/2011PA112063.

Council of Science Editors:

Arbelaez Rodriguez A. Learning during search : Apprendre durant la recherche combinatoire. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2011. Available from: http://www.theses.fr/2011PA112063


University of Technology, Sydney

30. Khosoussi, Kasra. Exploiting the intrinsic structures of simultaneous localization and mapping.

Degree: 2017, University of Technology, Sydney

 Imagine a robot which is assigned a complex task that requires it to navigate in an unknown environment. This situation frequently arises in a wide… (more)

Subjects/Keywords: Simultaneous localization and mapping (SLAM); Mobile robotics.; Intrinsic structure of SLAM.; Conventional local search algorithms.; Estimation error covariance.; Fast and stable convergence.; Graphical structure of SLAM.; Sparse near-D-optimal (determinant-optimal) SLAM.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khosoussi, K. (2017). Exploiting the intrinsic structures of simultaneous localization and mapping. (Thesis). University of Technology, Sydney. Retrieved from http://hdl.handle.net/10453/102697

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

Khosoussi, Kasra. “Exploiting the intrinsic structures of simultaneous localization and mapping.” 2017. Thesis, University of Technology, Sydney. Accessed February 28, 2021. http://hdl.handle.net/10453/102697.

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

MLA Handbook (7th Edition):

Khosoussi, Kasra. “Exploiting the intrinsic structures of simultaneous localization and mapping.” 2017. Web. 28 Feb 2021.

Vancouver:

Khosoussi K. Exploiting the intrinsic structures of simultaneous localization and mapping. [Internet] [Thesis]. University of Technology, Sydney; 2017. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10453/102697.

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

Council of Science Editors:

Khosoussi K. Exploiting the intrinsic structures of simultaneous localization and mapping. [Thesis]. University of Technology, Sydney; 2017. Available from: http://hdl.handle.net/10453/102697

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

[1] [2]

.