Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(combinatorial search)`

.
Showing records 1 – 30 of
76 total matches.

Search Limiters

Dates

- 2017 – 2021 (23)
- 2012 – 2016 (28)
- 2007 – 2011 (20)

Degrees

- PhD (18)
- Docteur es (17)

▼ Search Limiters

Colorado State University

1.
Hains, Doug.
Structure in *combinatorial* optimization and its effect on heuristic performance.

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

URL: http://hdl.handle.net/10217/80944

► The goal in *combinatorial* optimization is to find a good solution among a finite set of solutions. In many *combinatorial* problems, the set of solutions…
(more)

Subjects/Keywords: combinatorial optimization; satisfiability; local search

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hains, D. (2013). Structure in combinatorial optimization and its effect on heuristic performance. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/80944

Chicago Manual of Style (16^{th} Edition):

Hains, Doug. “Structure in combinatorial optimization and its effect on heuristic performance.” 2013. Doctoral Dissertation, Colorado State University. Accessed March 09, 2021. http://hdl.handle.net/10217/80944.

MLA Handbook (7^{th} Edition):

Hains, Doug. “Structure in combinatorial optimization and its effect on heuristic performance.” 2013. Web. 09 Mar 2021.

Vancouver:

Hains D. Structure in combinatorial optimization and its effect on heuristic performance. [Internet] [Doctoral dissertation]. Colorado State University; 2013. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10217/80944.

Council of Science Editors:

Hains D. Structure in combinatorial optimization and its effect on heuristic performance. [Doctoral Dissertation]. Colorado State University; 2013. Available from: http://hdl.handle.net/10217/80944

Colorado State University

2.
Sutton, Andrew M.
Analysis of *combinatorial* *search* spaces for a class of NP-hard problems, An.

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

URL: http://hdl.handle.net/10217/50161

► Given a finite but very large set of states X and a real-valued objective function ƒ defined on X, *combinatorial* optimization refers to the problem…
(more)

Subjects/Keywords: combinatorial optimization; combinatorial search; local search; pseudo-Boolean functions; search space analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sutton, A. M. (2011). Analysis of combinatorial search spaces for a class of NP-hard problems, An. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/50161

Chicago Manual of Style (16^{th} Edition):

Sutton, Andrew M. “Analysis of combinatorial search spaces for a class of NP-hard problems, An.” 2011. Doctoral Dissertation, Colorado State University. Accessed March 09, 2021. http://hdl.handle.net/10217/50161.

MLA Handbook (7^{th} Edition):

Sutton, Andrew M. “Analysis of combinatorial search spaces for a class of NP-hard problems, An.” 2011. Web. 09 Mar 2021.

Vancouver:

Sutton AM. Analysis of combinatorial search spaces for a class of NP-hard problems, An. [Internet] [Doctoral dissertation]. Colorado State University; 2011. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10217/50161.

Council of Science Editors:

Sutton AM. Analysis of combinatorial search spaces for a class of NP-hard problems, An. [Doctoral Dissertation]. Colorado State University; 2011. Available from: http://hdl.handle.net/10217/50161

Queensland University of Technology

3. Browne, Cameron Bolitho. Automatic generation and evaluation of recombination games.

Degree: 2008, Queensland University of Technology

URL: https://eprints.qut.edu.au/17025/

► Many new board games are designed each year, ranging from the unplayable to the truly exceptional. For each successful design there are untold numbers of…
(more)

Subjects/Keywords: combinatorial; games; design; aesthetics; evolutionary; search

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Browne, C. B. (2008). Automatic generation and evaluation of recombination games. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/17025/

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Browne, Cameron Bolitho. “Automatic generation and evaluation of recombination games.” 2008. Thesis, Queensland University of Technology. Accessed March 09, 2021. https://eprints.qut.edu.au/17025/.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Browne, Cameron Bolitho. “Automatic generation and evaluation of recombination games.” 2008. Web. 09 Mar 2021.

Vancouver:

Browne CB. Automatic generation and evaluation of recombination games. [Internet] [Thesis]. Queensland University of Technology; 2008. [cited 2021 Mar 09]. Available from: https://eprints.qut.edu.au/17025/.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Browne CB. Automatic generation and evaluation of recombination games. [Thesis]. Queensland University of Technology; 2008. Available from: https://eprints.qut.edu.au/17025/

Not specified: Masters Thesis or Doctoral Dissertation

University of Alberta

4.
Zhang, Yeqin.
TDS+: Improving Temperature Discovery * Search*.

Degree: MS, Department of Computing Science, 2015, University of Alberta

URL: https://era.library.ualberta.ca/files/mw22v792c

► Temperature Discovery *Search* (TDS) is a forward *search* method for computing or approximating the temperature of a *combinatorial* game. Temperature and mean are important concepts…
(more)

Subjects/Keywords: game tree search; TDS+; Amazons; combinatorial game theory; Temperature Discovery Search

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, Y. (2015). TDS+: Improving Temperature Discovery Search. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/mw22v792c

Chicago Manual of Style (16^{th} Edition):

Zhang, Yeqin. “TDS+: Improving Temperature Discovery Search.” 2015. Masters Thesis, University of Alberta. Accessed March 09, 2021. https://era.library.ualberta.ca/files/mw22v792c.

MLA Handbook (7^{th} Edition):

Zhang, Yeqin. “TDS+: Improving Temperature Discovery Search.” 2015. Web. 09 Mar 2021.

Vancouver:

Zhang Y. TDS+: Improving Temperature Discovery Search. [Internet] [Masters thesis]. University of Alberta; 2015. [cited 2021 Mar 09]. Available from: https://era.library.ualberta.ca/files/mw22v792c.

Council of Science Editors:

Zhang Y. TDS+: Improving Temperature Discovery Search. [Masters Thesis]. University of Alberta; 2015. Available from: https://era.library.ualberta.ca/files/mw22v792c

University of Illinois – Urbana-Champaign

5.
Zhang, Wenda.
Cyclic best first *search* in branch-and-bound algorithms.

Degree: PhD, Industrial Engineering, 2020, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/108464

► In this dissertation, we study the application of a *search* strategy called cyclic best first *search* (CBFS) in branch-and-bound (B&B) algorithms. First, we solve a…
(more)

Subjects/Keywords: Branch-and-bound; Search Strategy; Cyclic Best First Search; Combinatorial Optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, W. (2020). Cyclic best first search in branch-and-bound algorithms. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/108464

Chicago Manual of Style (16^{th} Edition):

Zhang, Wenda. “Cyclic best first search in branch-and-bound algorithms.” 2020. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 09, 2021. http://hdl.handle.net/2142/108464.

MLA Handbook (7^{th} Edition):

Zhang, Wenda. “Cyclic best first search in branch-and-bound algorithms.” 2020. Web. 09 Mar 2021.

Vancouver:

Zhang W. Cyclic best first search in branch-and-bound algorithms. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2020. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/2142/108464.

Council of Science Editors:

Zhang W. Cyclic best first search in branch-and-bound algorithms. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2020. Available from: http://hdl.handle.net/2142/108464

University of Georgia

6. Meyerson, Seth. Finding longest paths in hypercubes.

Degree: 2015, University of Georgia

URL: http://hdl.handle.net/10724/33343

► Since the problem's formulation by Kautz in 1958 as an error detection tool, diverse applications for long snakes and coils have been found. These include…
(more)

Subjects/Keywords: stochastic beam search; snake-in-the-box; combinatorial optimization; graph search; hypercube; heuristic search

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Meyerson, S. (2015). Finding longest paths in hypercubes. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/33343

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Meyerson, Seth. “Finding longest paths in hypercubes.” 2015. Thesis, University of Georgia. Accessed March 09, 2021. http://hdl.handle.net/10724/33343.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Meyerson, Seth. “Finding longest paths in hypercubes.” 2015. Web. 09 Mar 2021.

Vancouver:

Meyerson S. Finding longest paths in hypercubes. [Internet] [Thesis]. University of Georgia; 2015. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10724/33343.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Meyerson S. Finding longest paths in hypercubes. [Thesis]. University of Georgia; 2015. Available from: http://hdl.handle.net/10724/33343

Not specified: Masters Thesis or Doctoral Dissertation

Univerzitet u Beogradu

7. 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

URL: https://fedorabg.bg.ac.rs/fedora/get/o:15561/bdef:Content/get

►

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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} 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 March 09, 2021. https://fedorabg.bg.ac.rs/fedora/get/o:15561/bdef:Content/get.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

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 2021 Mar 09]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15561/bdef:Content/get.

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

Not specified: Masters Thesis or Doctoral Dissertation

University of St. Andrews

8.
Kotthoff, Lars.
On algorithm selection, with an application to *combinatorial* *search* problems
.

Degree: 2012, University of St. Andrews

URL: http://hdl.handle.net/10023/2841

► The Algorithm Selection Problem is to select the most appropriate way for solving a problem given a choice of different ways. Some of the most…
(more)

Subjects/Keywords: Algorithm selection; Combinatorial search; Constraint programming; Satisfiability; Machine learning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kotthoff, L. (2012). On algorithm selection, with an application to combinatorial search problems . (Thesis). University of St. Andrews. Retrieved from http://hdl.handle.net/10023/2841

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Kotthoff, Lars. “On algorithm selection, with an application to combinatorial search problems .” 2012. Thesis, University of St. Andrews. Accessed March 09, 2021. http://hdl.handle.net/10023/2841.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kotthoff, Lars. “On algorithm selection, with an application to combinatorial search problems .” 2012. Web. 09 Mar 2021.

Vancouver:

Kotthoff L. On algorithm selection, with an application to combinatorial search problems . [Internet] [Thesis]. University of St. Andrews; 2012. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10023/2841.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kotthoff L. On algorithm selection, with an application to combinatorial search problems . [Thesis]. University of St. Andrews; 2012. Available from: http://hdl.handle.net/10023/2841

Not specified: Masters Thesis or Doctoral Dissertation

University of Edinburgh

9.
Hamid, Mona.
New local *search* in the space of infeasible solutions framework for the routing of vehicles.

Degree: PhD, 2018, University of Edinburgh

URL: http://hdl.handle.net/1842/33177

► *Combinatorial* optimisation problems (COPs) have been at the origin of the design of many optimal and heuristic solution frameworks such as branch-and-bound algorithms, branch-and-cut algorithms,…
(more)

Subjects/Keywords: 519.6; combinatorial optimisation problems; metaheuristic; hyperheuristic; dual local search; learning mechanism

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hamid, M. (2018). New local search in the space of infeasible solutions framework for the routing of vehicles. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/33177

Chicago Manual of Style (16^{th} Edition):

Hamid, Mona. “New local search in the space of infeasible solutions framework for the routing of vehicles.” 2018. Doctoral Dissertation, University of Edinburgh. Accessed March 09, 2021. http://hdl.handle.net/1842/33177.

MLA Handbook (7^{th} Edition):

Hamid, Mona. “New local search in the space of infeasible solutions framework for the routing of vehicles.” 2018. Web. 09 Mar 2021.

Vancouver:

Hamid M. New local search in the space of infeasible solutions framework for the routing of vehicles. [Internet] [Doctoral dissertation]. University of Edinburgh; 2018. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/1842/33177.

Council of Science Editors:

Hamid M. New local search in the space of infeasible solutions framework for the routing of vehicles. [Doctoral Dissertation]. University of Edinburgh; 2018. Available from: http://hdl.handle.net/1842/33177

University of Alberta

10. Henderson, Philip. Playing and solving the game of Hex.

Degree: PhD, Department of Computing Science, 2010, University of Alberta

URL: https://era.library.ualberta.ca/files/b8515n53c

► The game of Hex is of interest to the mathematics, algorithms, and artificial intelligence communities. It is a classical PSPACE-complete problem, and its invention is…
(more)

Subjects/Keywords: algorithms; games; combinatorial game theory; automated solver; Monte Carlo tree search; Hex; proof number search; PSPACE-complete; artificial intelligence

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Henderson, P. (2010). Playing and solving the game of Hex. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/b8515n53c

Chicago Manual of Style (16^{th} Edition):

Henderson, Philip. “Playing and solving the game of Hex.” 2010. Doctoral Dissertation, University of Alberta. Accessed March 09, 2021. https://era.library.ualberta.ca/files/b8515n53c.

MLA Handbook (7^{th} Edition):

Henderson, Philip. “Playing and solving the game of Hex.” 2010. Web. 09 Mar 2021.

Vancouver:

Henderson P. Playing and solving the game of Hex. [Internet] [Doctoral dissertation]. University of Alberta; 2010. [cited 2021 Mar 09]. Available from: https://era.library.ualberta.ca/files/b8515n53c.

Council of Science Editors:

Henderson P. Playing and solving the game of Hex. [Doctoral Dissertation]. University of Alberta; 2010. Available from: https://era.library.ualberta.ca/files/b8515n53c

North Carolina State University

11.
Sureka, Ashish.
Techniques For Finding Nash Equilibria In *Combinatorial* Auctions.

Degree: PhD, Computer Science, 2005, North Carolina State University

URL: http://www.lib.ncsu.edu/resolver/1840.16/5368

► Auctions that allow participants to bid on a combination of items rather than just the individual items are called *combinatorial* auctions. For items that exhibit…
(more)

Subjects/Keywords: Combinatorial Auctions; Game Theory; Metaheuristic Search

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sureka, A. (2005). Techniques For Finding Nash Equilibria In Combinatorial Auctions. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/5368

Chicago Manual of Style (16^{th} Edition):

Sureka, Ashish. “Techniques For Finding Nash Equilibria In Combinatorial Auctions.” 2005. Doctoral Dissertation, North Carolina State University. Accessed March 09, 2021. http://www.lib.ncsu.edu/resolver/1840.16/5368.

MLA Handbook (7^{th} Edition):

Sureka, Ashish. “Techniques For Finding Nash Equilibria In Combinatorial Auctions.” 2005. Web. 09 Mar 2021.

Vancouver:

Sureka A. Techniques For Finding Nash Equilibria In Combinatorial Auctions. [Internet] [Doctoral dissertation]. North Carolina State University; 2005. [cited 2021 Mar 09]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/5368.

Council of Science Editors:

Sureka A. Techniques For Finding Nash Equilibria In Combinatorial Auctions. [Doctoral Dissertation]. North Carolina State University; 2005. Available from: http://www.lib.ncsu.edu/resolver/1840.16/5368

Univerzitet u Beogradu

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

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

URL: https://fedorabg.bg.ac.rs/fedora/get/o:7097/bdef:Content/get

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...

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

Record Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Matić, Dragan 1977-. “Rješavanje nekih problema u nastavi primjenom metoda kombinatorne optimizacije.” 2015. Web. 09 Mar 2021.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

13.
Lassiter, William Bowers.
Investigations in time-dependent *combinatorial* optimization problems and their applications.

Degree: PhD, Industrial and Systems Engineering, 2020, Georgia Tech

URL: http://hdl.handle.net/1853/63602

► We explore three distinct but related *combinatorial* optimization problems involving time. Chapter 2 focuses on a time-indexed integer programming (IP) formulation for solving the Traveling…
(more)

Subjects/Keywords: Combinatorial optimization; Optimization; Local search; Traveling salesman problem; Machine scheduling; Mixed-initiative planning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lassiter, W. B. (2020). Investigations in time-dependent combinatorial optimization problems and their applications. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/63602

Chicago Manual of Style (16^{th} Edition):

Lassiter, William Bowers. “Investigations in time-dependent combinatorial optimization problems and their applications.” 2020. Doctoral Dissertation, Georgia Tech. Accessed March 09, 2021. http://hdl.handle.net/1853/63602.

MLA Handbook (7^{th} Edition):

Lassiter, William Bowers. “Investigations in time-dependent combinatorial optimization problems and their applications.” 2020. Web. 09 Mar 2021.

Vancouver:

Lassiter WB. Investigations in time-dependent combinatorial optimization problems and their applications. [Internet] [Doctoral dissertation]. Georgia Tech; 2020. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/1853/63602.

Council of Science Editors:

Lassiter WB. Investigations in time-dependent combinatorial optimization problems and their applications. [Doctoral Dissertation]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/63602

14.
Buljubasic, Mirsad.
Efficient local *search* for several *combinatorial* optimization problems : Recherche locale performante pour la résolution de plusieurs problèmes combinatoires.

Degree: Docteur es, Informatique, 2015, Montpellier

URL: http://www.theses.fr/2015MONTS010

►

Cette thèse porte sur la conception et l'implémentation d'algorithmes approchés pour l'optimisation en variables discrètes. Plus particulièrement, dans cette étude nous nous intéressons à la… (more)

Subjects/Keywords: Recherche locale; Optimisation combinatoire; Recherche opérationnelle; Local Search; Combinatorial Optimization; Operations research

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Buljubasic, M. (2015). Efficient local search for several combinatorial optimization problems : Recherche locale performante pour la résolution de plusieurs problèmes combinatoires. (Doctoral Dissertation). Montpellier. Retrieved from http://www.theses.fr/2015MONTS010

Chicago Manual of Style (16^{th} Edition):

Buljubasic, Mirsad. “Efficient local search for several combinatorial optimization problems : Recherche locale performante pour la résolution de plusieurs problèmes combinatoires.” 2015. Doctoral Dissertation, Montpellier. Accessed March 09, 2021. http://www.theses.fr/2015MONTS010.

MLA Handbook (7^{th} Edition):

Buljubasic, Mirsad. “Efficient local search for several combinatorial optimization problems : Recherche locale performante pour la résolution de plusieurs problèmes combinatoires.” 2015. Web. 09 Mar 2021.

Vancouver:

Buljubasic M. Efficient local search for several combinatorial optimization problems : Recherche locale performante pour la résolution de plusieurs problèmes combinatoires. [Internet] [Doctoral dissertation]. Montpellier; 2015. [cited 2021 Mar 09]. Available from: http://www.theses.fr/2015MONTS010.

Council of Science Editors:

Buljubasic M. Efficient local search for several combinatorial optimization problems : Recherche locale performante pour la résolution de plusieurs problèmes combinatoires. [Doctoral Dissertation]. Montpellier; 2015. Available from: http://www.theses.fr/2015MONTS010

15.
Tari, Sara.
Stratégies d'exploration de paysages de fitness : application à la résolution approchée de problèmes d'optimisation combinatoire : Fitness landscape exploration strategies : application of *combinatorial* optimization problems to the approximate solution of *combinatorial* optimization problems.

Degree: Docteur es, Informatique, 2019, Angers

URL: http://www.theses.fr/2019ANGE0013

►

De nombreux problèmes d'optimisation combinatoire sont difficiles à résoudre et mettent en échec les méthodes de résolution exactes. Parmi les algorithmes de résolution approchée, les… (more)

Subjects/Keywords: Recherche locale; Paysage de fitness; Local search; Fitness landscape; Combinatorial optimization; 004

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tari, S. (2019). Stratégies d'exploration de paysages de fitness : application à la résolution approchée de problèmes d'optimisation combinatoire : Fitness landscape exploration strategies : application of combinatorial optimization problems to the approximate solution of combinatorial optimization problems. (Doctoral Dissertation). Angers. Retrieved from http://www.theses.fr/2019ANGE0013

Chicago Manual of Style (16^{th} Edition):

Tari, Sara. “Stratégies d'exploration de paysages de fitness : application à la résolution approchée de problèmes d'optimisation combinatoire : Fitness landscape exploration strategies : application of combinatorial optimization problems to the approximate solution of combinatorial optimization problems.” 2019. Doctoral Dissertation, Angers. Accessed March 09, 2021. http://www.theses.fr/2019ANGE0013.

MLA Handbook (7^{th} Edition):

Tari, Sara. “Stratégies d'exploration de paysages de fitness : application à la résolution approchée de problèmes d'optimisation combinatoire : Fitness landscape exploration strategies : application of combinatorial optimization problems to the approximate solution of combinatorial optimization problems.” 2019. Web. 09 Mar 2021.

Vancouver:

Tari S. Stratégies d'exploration de paysages de fitness : application à la résolution approchée de problèmes d'optimisation combinatoire : Fitness landscape exploration strategies : application of combinatorial optimization problems to the approximate solution of combinatorial optimization problems. [Internet] [Doctoral dissertation]. Angers; 2019. [cited 2021 Mar 09]. Available from: http://www.theses.fr/2019ANGE0013.

Council of Science Editors:

Tari S. Stratégies d'exploration de paysages de fitness : application à la résolution approchée de problèmes d'optimisation combinatoire : Fitness landscape exploration strategies : application of combinatorial optimization problems to the approximate solution of combinatorial optimization problems. [Doctoral Dissertation]. Angers; 2019. Available from: http://www.theses.fr/2019ANGE0013

16.
Libralesso, Luc.
Recherches arborescentes anytime pour l'optimisation combinatoire : Anytime tree *search* for *combinatorial* optimization.

Degree: Docteur es, Mathématiques et Informatique, 2020, Université Grenoble Alpes

URL: http://www.theses.fr/2020GRALM026

►

Les recherches arborescentes sont utilisées dans un grand nombre d'applications (MIP, CP, SAT, metaheuristiques avec Ant Colony Optimization et GRASP) et également dans des communautés… (more)

Subjects/Keywords: Recherches arborescentes; Metaheuristiques; Optimisation combinatoire; Tree search algorithms; Metaheuristics; Combinatorial optimization; 004

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Libralesso, L. (2020). Recherches arborescentes anytime pour l'optimisation combinatoire : Anytime tree search for combinatorial optimization. (Doctoral Dissertation). Université Grenoble Alpes. Retrieved from http://www.theses.fr/2020GRALM026

Chicago Manual of Style (16^{th} Edition):

Libralesso, Luc. “Recherches arborescentes anytime pour l'optimisation combinatoire : Anytime tree search for combinatorial optimization.” 2020. Doctoral Dissertation, Université Grenoble Alpes. Accessed March 09, 2021. http://www.theses.fr/2020GRALM026.

MLA Handbook (7^{th} Edition):

Libralesso, Luc. “Recherches arborescentes anytime pour l'optimisation combinatoire : Anytime tree search for combinatorial optimization.” 2020. Web. 09 Mar 2021.

Vancouver:

Libralesso L. Recherches arborescentes anytime pour l'optimisation combinatoire : Anytime tree search for combinatorial optimization. [Internet] [Doctoral dissertation]. Université Grenoble Alpes; 2020. [cited 2021 Mar 09]. Available from: http://www.theses.fr/2020GRALM026.

Council of Science Editors:

Libralesso L. Recherches arborescentes anytime pour l'optimisation combinatoire : Anytime tree search for combinatorial optimization. [Doctoral Dissertation]. Université Grenoble Alpes; 2020. Available from: http://www.theses.fr/2020GRALM026

UCLA

17. Schreiber, Ethan L. Optimal Multi-Way Number Partitioning.

Degree: Computer Science, 2014, UCLA

URL: http://www.escholarship.org/uc/item/30g6n09q

► The NP-hard number-partitioning problem is to separate a multiset S ofn positive integers into k subsets, such that the largest sum of theintegers assigned to…
(more)

Subjects/Keywords: Computer science; Artificial intelligence; Artificial Intelligence; Combinatorial Optimization; Constraint Satisfaction; Heuristic Search; NP-Complete; Number Partitioning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Schreiber, E. L. (2014). Optimal Multi-Way Number Partitioning. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/30g6n09q

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Schreiber, Ethan L. “Optimal Multi-Way Number Partitioning.” 2014. Thesis, UCLA. Accessed March 09, 2021. http://www.escholarship.org/uc/item/30g6n09q.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Schreiber, Ethan L. “Optimal Multi-Way Number Partitioning.” 2014. Web. 09 Mar 2021.

Vancouver:

Schreiber EL. Optimal Multi-Way Number Partitioning. [Internet] [Thesis]. UCLA; 2014. [cited 2021 Mar 09]. Available from: http://www.escholarship.org/uc/item/30g6n09q.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schreiber EL. Optimal Multi-Way Number Partitioning. [Thesis]. UCLA; 2014. Available from: http://www.escholarship.org/uc/item/30g6n09q

Not specified: Masters Thesis or Doctoral Dissertation

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

18. Karakostas, Panagiotis. Solution methods for complex supply chain network optimization problems.

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

URL: http://hdl.handle.net/10442/hedi/47622

►

The intertemporal integration of supply chain activities is crucial in developing sustained competitive advantage in the modern entrepreneurial environment. This integration refer to the simultaneous… (more)

Subjects/Keywords: Εφοδιαστική αλυσίδα; Συνδυαστική βελτιστοποίηση; Αναζήτηση μεταβλητής γειτνίασης; Μεθευρετικοί αλγόριθμοι; Supply chain; COMBINATORIAL OPTIMIZATION; Variable neighborhood search; Metaheuristic algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Karakostas, P. (2020). Solution methods for complex supply chain network optimization problems. (Thesis). Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Retrieved from http://hdl.handle.net/10442/hedi/47622

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Karakostas, Panagiotis. “Solution methods for complex supply chain network optimization problems.” 2020. Thesis, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Accessed March 09, 2021. http://hdl.handle.net/10442/hedi/47622.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Karakostas, Panagiotis. “Solution methods for complex supply chain network optimization problems.” 2020. Web. 09 Mar 2021.

Vancouver:

Karakostas P. Solution methods for complex supply chain network optimization problems. [Internet] [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2020. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10442/hedi/47622.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Karakostas P. Solution methods for complex supply chain network optimization problems. [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2020. Available from: http://hdl.handle.net/10442/hedi/47622

Not specified: Masters Thesis or Doctoral Dissertation

19. Juliana Maria Rangel Barbosa. Aplicação de uma abordagem adaptativa de busca tabu a problemas de roteirização e programação de veículos.

Degree: 2005, Universidade Federal de São Carlos

URL: http://www.bdtd.ufscar.br/htdocs/tedeSimplificado//tde_busca/arquivo.php?codArquivo=807

►

This project consists in the refinement of the tabu *search* adaptive approach HTSA (PUREZA, 1996) and the analysis of its performance when applied to the…
(more)

Subjects/Keywords: Logística empresarial; Roteirização; Busca - tabu; ENGENHARIA DE PRODUCAO; Heuristics; Otimização combinatória; Vehicle routing and scheduling; Combinatorial optimization; Tabu search

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Barbosa, J. M. R. (2005). Aplicação de uma abordagem adaptativa de busca tabu a problemas de roteirização e programação de veículos. (Thesis). Universidade Federal de São Carlos. Retrieved from http://www.bdtd.ufscar.br/htdocs/tedeSimplificado//tde_busca/arquivo.php?codArquivo=807

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Barbosa, Juliana Maria Rangel. “Aplicação de uma abordagem adaptativa de busca tabu a problemas de roteirização e programação de veículos.” 2005. Thesis, Universidade Federal de São Carlos. Accessed March 09, 2021. http://www.bdtd.ufscar.br/htdocs/tedeSimplificado//tde_busca/arquivo.php?codArquivo=807.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Barbosa, Juliana Maria Rangel. “Aplicação de uma abordagem adaptativa de busca tabu a problemas de roteirização e programação de veículos.” 2005. Web. 09 Mar 2021.

Vancouver:

Barbosa JMR. Aplicação de uma abordagem adaptativa de busca tabu a problemas de roteirização e programação de veículos. [Internet] [Thesis]. Universidade Federal de São Carlos; 2005. [cited 2021 Mar 09]. Available from: http://www.bdtd.ufscar.br/htdocs/tedeSimplificado//tde_busca/arquivo.php?codArquivo=807.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Barbosa JMR. Aplicação de uma abordagem adaptativa de busca tabu a problemas de roteirização e programação de veículos. [Thesis]. Universidade Federal de São Carlos; 2005. Available from: http://www.bdtd.ufscar.br/htdocs/tedeSimplificado//tde_busca/arquivo.php?codArquivo=807

Not specified: Masters Thesis or Doctoral Dissertation

20.
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

URL: http://www.theses.fr/2016ANGE0009

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} 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 March 09, 2021. http://www.theses.fr/2016ANGE0009.

MLA Handbook (7^{th} 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. 09 Mar 2021.

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 2021 Mar 09]. 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

University of Connecticut

21. nadella, bala kishore. Proactive Decision Support for Intelligent Routing of Unmanned Aerial Systems in Dynamic and Uncertain Mission Environments.

Degree: M. Eng., Electrical Engineering, 2015, University of Connecticut

URL: https://opencommons.uconn.edu/gs_theses/870

► Unmanned Aerial System (UAS) missions are executed by teams of operators with highly specialized training and roles; however, the task demands on each operator…
(more)

Subjects/Keywords: UAV; combinatorial optimization; machine sequencing problem; open vehicle routing; traveling salesman problem; adaptive search; unmanned aerial systems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

nadella, b. k. (2015). Proactive Decision Support for Intelligent Routing of Unmanned Aerial Systems in Dynamic and Uncertain Mission Environments. (Masters Thesis). University of Connecticut. Retrieved from https://opencommons.uconn.edu/gs_theses/870

Chicago Manual of Style (16^{th} Edition):

nadella, bala kishore. “Proactive Decision Support for Intelligent Routing of Unmanned Aerial Systems in Dynamic and Uncertain Mission Environments.” 2015. Masters Thesis, University of Connecticut. Accessed March 09, 2021. https://opencommons.uconn.edu/gs_theses/870.

MLA Handbook (7^{th} Edition):

nadella, bala kishore. “Proactive Decision Support for Intelligent Routing of Unmanned Aerial Systems in Dynamic and Uncertain Mission Environments.” 2015. Web. 09 Mar 2021.

Vancouver:

nadella bk. Proactive Decision Support for Intelligent Routing of Unmanned Aerial Systems in Dynamic and Uncertain Mission Environments. [Internet] [Masters thesis]. University of Connecticut; 2015. [cited 2021 Mar 09]. Available from: https://opencommons.uconn.edu/gs_theses/870.

Council of Science Editors:

nadella bk. Proactive Decision Support for Intelligent Routing of Unmanned Aerial Systems in Dynamic and Uncertain Mission Environments. [Masters Thesis]. University of Connecticut; 2015. Available from: https://opencommons.uconn.edu/gs_theses/870

Univerzitet u Beogradu

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

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

URL: https://fedorabg.bg.ac.rs/fedora/get/o:18332/bdef:Content/get

►

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

Predmet ovog rada je analiza i re²avanje dva diskretna lokacijska problema: problema odreivanja 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Đenić, Aleksandar D. “Rešavanje diskretnih lokacijskih problema primenom metode promenljivih okolina.” 2018. Web. 09 Mar 2021.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Univerzitet u Beogradu

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

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

URL: https://fedorabg.bg.ac.rs/fedora/get/o:18909/bdef:Content/get

►

математика - методика наставе математике и рачунарства / 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

24.
Samei, Nasim.
Local *Search* Approximation Algorithms for Clustering Problems.

Degree: 2019, University of Western Ontario

URL: https://ir.lib.uwo.ca/etd/6138

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Bradford

25.
Bibiks, Kirils.
Scheduling and resource efficiency balancing : discrete species conserving cuckoo *search* for scheduling in an uncertain execution environment.

Degree: PhD, 2017, University of Bradford

URL: http://hdl.handle.net/10454/17439

► The main goal of a scheduling process is to decide when and how to execute each of the project's activities. Despite large variety of researched…
(more)

Subjects/Keywords: 006.3; Project scheduling; Cuckoo search; Species conservation; Combinatorial optimisation; Evolutionary computation; Resource-constrained project scheduling problem (RCPSP)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bibiks, K. (2017). Scheduling and resource efficiency balancing : discrete species conserving cuckoo search for scheduling in an uncertain execution environment. (Doctoral Dissertation). University of Bradford. Retrieved from http://hdl.handle.net/10454/17439

Chicago Manual of Style (16^{th} Edition):

Bibiks, Kirils. “Scheduling and resource efficiency balancing : discrete species conserving cuckoo search for scheduling in an uncertain execution environment.” 2017. Doctoral Dissertation, University of Bradford. Accessed March 09, 2021. http://hdl.handle.net/10454/17439.

MLA Handbook (7^{th} Edition):

Bibiks, Kirils. “Scheduling and resource efficiency balancing : discrete species conserving cuckoo search for scheduling in an uncertain execution environment.” 2017. Web. 09 Mar 2021.

Vancouver:

Bibiks K. Scheduling and resource efficiency balancing : discrete species conserving cuckoo search for scheduling in an uncertain execution environment. [Internet] [Doctoral dissertation]. University of Bradford; 2017. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10454/17439.

Council of Science Editors:

Bibiks K. Scheduling and resource efficiency balancing : discrete species conserving cuckoo search for scheduling in an uncertain execution environment. [Doctoral Dissertation]. University of Bradford; 2017. Available from: http://hdl.handle.net/10454/17439

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

Degree: Department of Computer Science, 2012, Brock University

URL: http://hdl.handle.net/10464/3929

► 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

…OVERVIEW OF *SEARCH* TECHNIQUES
6
for use on *combinatorial* optimization problems, but a different… …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… …them may perform well in a given *search* space.
1
CHAPTER 1. INTRODUCTION
1.2
2
Problem…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Orth, John. “The Salmon Algorithm - A New Population Based Search Metaheuristic .” 2012. Web. 09 Mar 2021.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Maryland

27. Li, Feiyue. Modeling and Solving Variants of the Vehicle Routing Problem: Algorithms, Test Problems, and Computational Results.

Degree: Applied Mathematics and Scientific Computation, 2005, University of Maryland

URL: http://hdl.handle.net/1903/2824

► In the standard version of the capacitated vehicle routing problem (VRP), a sequence of deliveries is generated for each vehicle in a homogeneous fleet based…
(more)

Subjects/Keywords: Operations Research; vehicle routing; combinatorial optimization; heuristic search

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, F. (2005). Modeling and Solving Variants of the Vehicle Routing Problem: Algorithms, Test Problems, and Computational Results. (Thesis). University of Maryland. Retrieved from http://hdl.handle.net/1903/2824

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Li, Feiyue. “Modeling and Solving Variants of the Vehicle Routing Problem: Algorithms, Test Problems, and Computational Results.” 2005. Thesis, University of Maryland. Accessed March 09, 2021. http://hdl.handle.net/1903/2824.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Li, Feiyue. “Modeling and Solving Variants of the Vehicle Routing Problem: Algorithms, Test Problems, and Computational Results.” 2005. Web. 09 Mar 2021.

Vancouver:

Li F. Modeling and Solving Variants of the Vehicle Routing Problem: Algorithms, Test Problems, and Computational Results. [Internet] [Thesis]. University of Maryland; 2005. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/1903/2824.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li F. Modeling and Solving Variants of the Vehicle Routing Problem: Algorithms, Test Problems, and Computational Results. [Thesis]. University of Maryland; 2005. Available from: http://hdl.handle.net/1903/2824

Not specified: Masters Thesis or Doctoral Dissertation

University of Kentucky

28. Allen, Thomas E. CP-nets: From Theory to Practice.

Degree: 2016, University of Kentucky

URL: https://uknowledge.uky.edu/cs_etds/42

► Conditional preference networks (CP-nets) exploit the power of ceteris paribus rules to represent preferences over *combinatorial* decision domains compactly. CP-nets have much appeal. However, their…
(more)

Subjects/Keywords: artificial intelligence; combinatorial preferences; decision making; applications of local search; conditional preference networks; Artificial Intelligence and Robotics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Allen, T. E. (2016). CP-nets: From Theory to Practice. (Doctoral Dissertation). University of Kentucky. Retrieved from https://uknowledge.uky.edu/cs_etds/42

Chicago Manual of Style (16^{th} Edition):

Allen, Thomas E. “CP-nets: From Theory to Practice.” 2016. Doctoral Dissertation, University of Kentucky. Accessed March 09, 2021. https://uknowledge.uky.edu/cs_etds/42.

MLA Handbook (7^{th} Edition):

Allen, Thomas E. “CP-nets: From Theory to Practice.” 2016. Web. 09 Mar 2021.

Vancouver:

Allen TE. CP-nets: From Theory to Practice. [Internet] [Doctoral dissertation]. University of Kentucky; 2016. [cited 2021 Mar 09]. Available from: https://uknowledge.uky.edu/cs_etds/42.

Council of Science Editors:

Allen TE. CP-nets: From Theory to Practice. [Doctoral Dissertation]. University of Kentucky; 2016. Available from: https://uknowledge.uky.edu/cs_etds/42

Univerzitet u Beogradu

29. Grbić, Milana, 1989-, 57188105. Računarske metode particionisanja i grupisanja u biološkim mrežama.

Degree: 2020, Univerzitet u Beogradu

URL: https://fedorabg.bg.ac.rs/fedora/get/o:22534/bdef:Content/get

Računarstvo- Bioinformatika / Computer Science- Bioinformatics

U ovoj disertaciji se istražuju aktuelni problemi bioinformatike i računarske biologije i metode za njihovo rješavanje...

Subjects/Keywords: combinatorial optimization; variable neighborhood search; conditional random fields; biological networks; protein-protein interaction k-plex; highly connected components

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Grbić, Milana, 1989-, 5. (2020). Računarske metode particionisanja i grupisanja u biološkim mrežama. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:22534/bdef:Content/get

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Grbić, Milana, 1989-, 57188105. “Računarske metode particionisanja i grupisanja u biološkim mrežama.” 2020. Thesis, Univerzitet u Beogradu. Accessed March 09, 2021. https://fedorabg.bg.ac.rs/fedora/get/o:22534/bdef:Content/get.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Grbić, Milana, 1989-, 57188105. “Računarske metode particionisanja i grupisanja u biološkim mrežama.” 2020. Web. 09 Mar 2021.

Vancouver:

Grbić, Milana, 1989- 5. Računarske metode particionisanja i grupisanja u biološkim mrežama. [Internet] [Thesis]. Univerzitet u Beogradu; 2020. [cited 2021 Mar 09]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:22534/bdef:Content/get.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Grbić, Milana, 1989- 5. Računarske metode particionisanja i grupisanja u biološkim mrežama. [Thesis]. Univerzitet u Beogradu; 2020. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:22534/bdef:Content/get

Not specified: Masters Thesis or Doctoral Dissertation

Florida International University

30. Xu, Shuai. A New Study of Applying Complexity Theoretical Tools in Algorithm Design.

Degree: PhD, Computer Science, 2019, Florida International University

URL: https://digitalcommons.fiu.edu/etd/4242 ; FIDC007791

► Given n vectors with dimension m in Boolean domain, how to find two vectors whose pairwise Hamming distance is minimum? This problem is known…
(more)

Subjects/Keywords: Algorithm Design; Randomized Algorithm; Combinatorial Search; Error Correction Code; Fast Matrix Multiplication; Discrete Mathematics and Combinatorics; Theory and Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xu, S. (2019). A New Study of Applying Complexity Theoretical Tools in Algorithm Design. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/4242 ; FIDC007791

Chicago Manual of Style (16^{th} Edition):

Xu, Shuai. “A New Study of Applying Complexity Theoretical Tools in Algorithm Design.” 2019. Doctoral Dissertation, Florida International University. Accessed March 09, 2021. https://digitalcommons.fiu.edu/etd/4242 ; FIDC007791.

MLA Handbook (7^{th} Edition):

Xu, Shuai. “A New Study of Applying Complexity Theoretical Tools in Algorithm Design.” 2019. Web. 09 Mar 2021.

Vancouver:

Xu S. A New Study of Applying Complexity Theoretical Tools in Algorithm Design. [Internet] [Doctoral dissertation]. Florida International University; 2019. [cited 2021 Mar 09]. Available from: https://digitalcommons.fiu.edu/etd/4242 ; FIDC007791.

Council of Science Editors:

Xu S. A New Study of Applying Complexity Theoretical Tools in Algorithm Design. [Doctoral Dissertation]. Florida International University; 2019. Available from: https://digitalcommons.fiu.edu/etd/4242 ; FIDC007791