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:(combinatorial optimisation). Showing records 1 – 30 of 124 total matches.

[1] [2] [3] [4] [5]

Search Limiters

Last 2 Years | English Only

Languages

▼ Search Limiters

1. Tabia, Nourredine. Modèles et algorithmes pour l'optimisation robuste dans les Self-Organizing Network (SON) des réseaux mobiles 4G (LTE) : Models and algorithms for robust optimization in self-Organizing Networks (SON) of 4G mobile networks (LTE).

Degree: Docteur es, Informatique, 2013, Belfort-Montbéliard

La norme 3G/UMTS a permis de développer les premières applications multimédia pour téléphones et tablettes mobiles. Le nouveau standard 4G/LTE (Long Term Evolution) a pour… (more)

Subjects/Keywords: 4G/LTE; Optimisation de réseau; Optimisation combinatoire robuste; 4G/LTE; Network optimisation; Robust combinatorial optimisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tabia, N. (2013). Modèles et algorithmes pour l'optimisation robuste dans les Self-Organizing Network (SON) des réseaux mobiles 4G (LTE) : Models and algorithms for robust optimization in self-Organizing Networks (SON) of 4G mobile networks (LTE). (Doctoral Dissertation). Belfort-Montbéliard. Retrieved from http://www.theses.fr/2013BELF0222

Chicago Manual of Style (16th Edition):

Tabia, Nourredine. “Modèles et algorithmes pour l'optimisation robuste dans les Self-Organizing Network (SON) des réseaux mobiles 4G (LTE) : Models and algorithms for robust optimization in self-Organizing Networks (SON) of 4G mobile networks (LTE).” 2013. Doctoral Dissertation, Belfort-Montbéliard. Accessed September 23, 2020. http://www.theses.fr/2013BELF0222.

MLA Handbook (7th Edition):

Tabia, Nourredine. “Modèles et algorithmes pour l'optimisation robuste dans les Self-Organizing Network (SON) des réseaux mobiles 4G (LTE) : Models and algorithms for robust optimization in self-Organizing Networks (SON) of 4G mobile networks (LTE).” 2013. Web. 23 Sep 2020.

Vancouver:

Tabia N. Modèles et algorithmes pour l'optimisation robuste dans les Self-Organizing Network (SON) des réseaux mobiles 4G (LTE) : Models and algorithms for robust optimization in self-Organizing Networks (SON) of 4G mobile networks (LTE). [Internet] [Doctoral dissertation]. Belfort-Montbéliard; 2013. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2013BELF0222.

Council of Science Editors:

Tabia N. Modèles et algorithmes pour l'optimisation robuste dans les Self-Organizing Network (SON) des réseaux mobiles 4G (LTE) : Models and algorithms for robust optimization in self-Organizing Networks (SON) of 4G mobile networks (LTE). [Doctoral Dissertation]. Belfort-Montbéliard; 2013. Available from: http://www.theses.fr/2013BELF0222


University of Melbourne

2. Jayasundara, Demuni Duleepa Lasith. Uncovering genetic heterogeneity in clinical and environmental viral metagenomes using next generation sequencing.

Degree: 2015, University of Melbourne

 The focus of this thesis is understanding the genetic heterogeneity of clinically important viral populations that behave as quasispecies inside infected host organisms and environmental… (more)

Subjects/Keywords: viral metagenomics; viral quasispecies; estimation; combinatorial optimisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jayasundara, D. D. L. (2015). Uncovering genetic heterogeneity in clinical and environmental viral metagenomes using next generation sequencing. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/56596

Chicago Manual of Style (16th Edition):

Jayasundara, Demuni Duleepa Lasith. “Uncovering genetic heterogeneity in clinical and environmental viral metagenomes using next generation sequencing.” 2015. Doctoral Dissertation, University of Melbourne. Accessed September 23, 2020. http://hdl.handle.net/11343/56596.

MLA Handbook (7th Edition):

Jayasundara, Demuni Duleepa Lasith. “Uncovering genetic heterogeneity in clinical and environmental viral metagenomes using next generation sequencing.” 2015. Web. 23 Sep 2020.

Vancouver:

Jayasundara DDL. Uncovering genetic heterogeneity in clinical and environmental viral metagenomes using next generation sequencing. [Internet] [Doctoral dissertation]. University of Melbourne; 2015. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/11343/56596.

Council of Science Editors:

Jayasundara DDL. Uncovering genetic heterogeneity in clinical and environmental viral metagenomes using next generation sequencing. [Doctoral Dissertation]. University of Melbourne; 2015. Available from: http://hdl.handle.net/11343/56596

3. Derrien, Alban. Ordonnancement cumulatif en programmation par contraintes : caractérisation énergétique des raisonnements et solutions robustes : Cumulative scheduling in constraint programming : energetic characterization of reasoning and robust solutions.

Degree: Docteur es, Informatique et applications, 2015, Nantes, Ecole des Mines

La programmation par contraintes est une approche régulièrement utilisée pour traiter des problèmes d’ordonnancement variés. Les problèmes d’ordonnancement cumulatifs représentent une classe de problèmes dans… (more)

Subjects/Keywords: Ordonnancement; Programmation par Contraintes; Cumulatif; Optimisation Combinatoire; Robustesse; Scheduling; Constraint Programming; Cumulative; Combinatorial Optimisation; Robustess

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Derrien, A. (2015). Ordonnancement cumulatif en programmation par contraintes : caractérisation énergétique des raisonnements et solutions robustes : Cumulative scheduling in constraint programming : energetic characterization of reasoning and robust solutions. (Doctoral Dissertation). Nantes, Ecole des Mines. Retrieved from http://www.theses.fr/2015EMNA0230

Chicago Manual of Style (16th Edition):

Derrien, Alban. “Ordonnancement cumulatif en programmation par contraintes : caractérisation énergétique des raisonnements et solutions robustes : Cumulative scheduling in constraint programming : energetic characterization of reasoning and robust solutions.” 2015. Doctoral Dissertation, Nantes, Ecole des Mines. Accessed September 23, 2020. http://www.theses.fr/2015EMNA0230.

MLA Handbook (7th Edition):

Derrien, Alban. “Ordonnancement cumulatif en programmation par contraintes : caractérisation énergétique des raisonnements et solutions robustes : Cumulative scheduling in constraint programming : energetic characterization of reasoning and robust solutions.” 2015. Web. 23 Sep 2020.

Vancouver:

Derrien A. Ordonnancement cumulatif en programmation par contraintes : caractérisation énergétique des raisonnements et solutions robustes : Cumulative scheduling in constraint programming : energetic characterization of reasoning and robust solutions. [Internet] [Doctoral dissertation]. Nantes, Ecole des Mines; 2015. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2015EMNA0230.

Council of Science Editors:

Derrien A. Ordonnancement cumulatif en programmation par contraintes : caractérisation énergétique des raisonnements et solutions robustes : Cumulative scheduling in constraint programming : energetic characterization of reasoning and robust solutions. [Doctoral Dissertation]. Nantes, Ecole des Mines; 2015. Available from: http://www.theses.fr/2015EMNA0230

4. Hamaz, Idir. Méthodes d'optimisation robuste pour les problèmes d'ordonnancement cyclique : Robust optimization methods for cyclics scheduling problems.

Degree: Docteur es, Génie industriel, 2018, Université Toulouse III – Paul Sabatier

Plusieurs problèmes d'ordonnancement cyclique ont été étudiés dans la littérature. Cependant, la plupart de ces travaux considèrent que les paramètres sont connus avec certitude et… (more)

Subjects/Keywords: Ordonnancement cyclique; Optimisation robuste; Optimisation combinatoire; Cyclic scheduling; Robust optimization; Combinatorial optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hamaz, I. (2018). Méthodes d'optimisation robuste pour les problèmes d'ordonnancement cyclique : Robust optimization methods for cyclics scheduling problems. (Doctoral Dissertation). Université Toulouse III – Paul Sabatier. Retrieved from http://www.theses.fr/2018TOU30205

Chicago Manual of Style (16th Edition):

Hamaz, Idir. “Méthodes d'optimisation robuste pour les problèmes d'ordonnancement cyclique : Robust optimization methods for cyclics scheduling problems.” 2018. Doctoral Dissertation, Université Toulouse III – Paul Sabatier. Accessed September 23, 2020. http://www.theses.fr/2018TOU30205.

MLA Handbook (7th Edition):

Hamaz, Idir. “Méthodes d'optimisation robuste pour les problèmes d'ordonnancement cyclique : Robust optimization methods for cyclics scheduling problems.” 2018. Web. 23 Sep 2020.

Vancouver:

Hamaz I. Méthodes d'optimisation robuste pour les problèmes d'ordonnancement cyclique : Robust optimization methods for cyclics scheduling problems. [Internet] [Doctoral dissertation]. Université Toulouse III – Paul Sabatier; 2018. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2018TOU30205.

Council of Science Editors:

Hamaz I. Méthodes d'optimisation robuste pour les problèmes d'ordonnancement cyclique : Robust optimization methods for cyclics scheduling problems. [Doctoral Dissertation]. Université Toulouse III – Paul Sabatier; 2018. Available from: http://www.theses.fr/2018TOU30205

5. Jartoux, Bruno. On combinatorial approximation algorithms in geometry : Sur les algorithmes d'approximation combinatoires en géométrie.

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

L'analyse des techniques d'approximation est centrale en géométrie algorithmique, pour des raisons pratiques comme théoriques. Dans cette thèse nous traitons de l'échantillonnage des structures géométriques… (more)

Subjects/Keywords: Algorithme d'approximation; Optimisation combinatoire; Géométrie algorithmique; Approximation algorithm; Combinatorial optimisation; Computational geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jartoux, B. (2018). On combinatorial approximation algorithms in geometry : Sur les algorithmes d'approximation combinatoires en géométrie. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2018PESC1078

Chicago Manual of Style (16th Edition):

Jartoux, Bruno. “On combinatorial approximation algorithms in geometry : Sur les algorithmes d'approximation combinatoires en géométrie.” 2018. Doctoral Dissertation, Université Paris-Est. Accessed September 23, 2020. http://www.theses.fr/2018PESC1078.

MLA Handbook (7th Edition):

Jartoux, Bruno. “On combinatorial approximation algorithms in geometry : Sur les algorithmes d'approximation combinatoires en géométrie.” 2018. Web. 23 Sep 2020.

Vancouver:

Jartoux B. On combinatorial approximation algorithms in geometry : Sur les algorithmes d'approximation combinatoires en géométrie. [Internet] [Doctoral dissertation]. Université Paris-Est; 2018. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2018PESC1078.

Council of Science Editors:

Jartoux B. On combinatorial approximation algorithms in geometry : Sur les algorithmes d'approximation combinatoires en géométrie. [Doctoral Dissertation]. Université Paris-Est; 2018. Available from: http://www.theses.fr/2018PESC1078

6. Bus, Norbert. The use of geometric structures in graphics and optimization : L'utilisation des structures géométriques pour synthèse d'image et optimisation.

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

 Les données du monde réel ont manifestement une composante géométrique importante et suggère les patterns géométriques signifiants. Les méthodes qui utilisent la nature géométrique des… (more)

Subjects/Keywords: Géométrie algorithmique; Modélisation; Synthèse d'image; Combinatorial optimisation; Computational geometry; Modelling; Computer graphics; Optimisation combinatoire

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bus, N. (2015). The use of geometric structures in graphics and optimization : L'utilisation des structures géométriques pour synthèse d'image et optimisation. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2015PESC1117

Chicago Manual of Style (16th Edition):

Bus, Norbert. “The use of geometric structures in graphics and optimization : L'utilisation des structures géométriques pour synthèse d'image et optimisation.” 2015. Doctoral Dissertation, Université Paris-Est. Accessed September 23, 2020. http://www.theses.fr/2015PESC1117.

MLA Handbook (7th Edition):

Bus, Norbert. “The use of geometric structures in graphics and optimization : L'utilisation des structures géométriques pour synthèse d'image et optimisation.” 2015. Web. 23 Sep 2020.

Vancouver:

Bus N. The use of geometric structures in graphics and optimization : L'utilisation des structures géométriques pour synthèse d'image et optimisation. [Internet] [Doctoral dissertation]. Université Paris-Est; 2015. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2015PESC1117.

Council of Science Editors:

Bus N. The use of geometric structures in graphics and optimization : L'utilisation des structures géométriques pour synthèse d'image et optimisation. [Doctoral Dissertation]. Université Paris-Est; 2015. Available from: http://www.theses.fr/2015PESC1117


University of Melbourne

7. Belin Castellucci, Pedro. Consolidation problems in freight transportation systems: mathematical models and algorithms.

Degree: 2019, University of Melbourne

 Freight distribution systems are under stress. With the world population growing, the migration of people to urban areas and technologies that allow purchases from virtually… (more)

Subjects/Keywords: freight transportation; optimisation; container loading; cross-docking; collaborative logistics; integer programming; linear programming; combinatorial optimisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Belin Castellucci, P. (2019). Consolidation problems in freight transportation systems: mathematical models and algorithms. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/227683

Chicago Manual of Style (16th Edition):

Belin Castellucci, Pedro. “Consolidation problems in freight transportation systems: mathematical models and algorithms.” 2019. Doctoral Dissertation, University of Melbourne. Accessed September 23, 2020. http://hdl.handle.net/11343/227683.

MLA Handbook (7th Edition):

Belin Castellucci, Pedro. “Consolidation problems in freight transportation systems: mathematical models and algorithms.” 2019. Web. 23 Sep 2020.

Vancouver:

Belin Castellucci P. Consolidation problems in freight transportation systems: mathematical models and algorithms. [Internet] [Doctoral dissertation]. University of Melbourne; 2019. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/11343/227683.

Council of Science Editors:

Belin Castellucci P. Consolidation problems in freight transportation systems: mathematical models and algorithms. [Doctoral Dissertation]. University of Melbourne; 2019. Available from: http://hdl.handle.net/11343/227683


University of Newcastle

8. Puthiyedth, Nisha. A novel feature selection approach for data integration analysis: applications to transcriptomics study.

Degree: PhD, 2016, University of Newcastle

Research Doctorate - Doctor of Philosophy (PhD)

Meta-analysis has become a popular method for identifying novel biomarkers in the field of medical research. Meta-analysis has… (more)

Subjects/Keywords: meta-analysis; biomarkers; combinatorial optimisation; prostate cancer; Alzheimer's disease

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Puthiyedth, N. (2016). A novel feature selection approach for data integration analysis: applications to transcriptomics study. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1322449

Chicago Manual of Style (16th Edition):

Puthiyedth, Nisha. “A novel feature selection approach for data integration analysis: applications to transcriptomics study.” 2016. Doctoral Dissertation, University of Newcastle. Accessed September 23, 2020. http://hdl.handle.net/1959.13/1322449.

MLA Handbook (7th Edition):

Puthiyedth, Nisha. “A novel feature selection approach for data integration analysis: applications to transcriptomics study.” 2016. Web. 23 Sep 2020.

Vancouver:

Puthiyedth N. A novel feature selection approach for data integration analysis: applications to transcriptomics study. [Internet] [Doctoral dissertation]. University of Newcastle; 2016. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/1959.13/1322449.

Council of Science Editors:

Puthiyedth N. A novel feature selection approach for data integration analysis: applications to transcriptomics study. [Doctoral Dissertation]. University of Newcastle; 2016. Available from: http://hdl.handle.net/1959.13/1322449

9. Wang, Chen. Comprehensive Quality-Aware Automated Semantic Web Service Composition.

Degree: 2020, Victoria U of Wellington : Dissertations

 Automated web service composition is one of the ultimate goals of service-oriented computing. It loosely couples web services to accommodate users' complex requirements. Evolutionary Computation… (more)

Subjects/Keywords: Web service composition; Combinatorial optimisation; Evolutionary computation; Estimation of distribution algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, C. (2020). Comprehensive Quality-Aware Automated Semantic Web Service Composition. (Doctoral Dissertation). Victoria U of Wellington : Dissertations. Retrieved from http://hdl.handle.net/10063/9054

Chicago Manual of Style (16th Edition):

Wang, Chen. “Comprehensive Quality-Aware Automated Semantic Web Service Composition.” 2020. Doctoral Dissertation, Victoria U of Wellington : Dissertations. Accessed September 23, 2020. http://hdl.handle.net/10063/9054.

MLA Handbook (7th Edition):

Wang, Chen. “Comprehensive Quality-Aware Automated Semantic Web Service Composition.” 2020. Web. 23 Sep 2020.

Vancouver:

Wang C. Comprehensive Quality-Aware Automated Semantic Web Service Composition. [Internet] [Doctoral dissertation]. Victoria U of Wellington : Dissertations; 2020. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/10063/9054.

Council of Science Editors:

Wang C. Comprehensive Quality-Aware Automated Semantic Web Service Composition. [Doctoral Dissertation]. Victoria U of Wellington : Dissertations; 2020. Available from: http://hdl.handle.net/10063/9054


University of Adelaide

10. Gibbons, Daniel Steve. Deep Learning for Bipartite Assignment Problems.

Degree: 2019, University of Adelaide

 A recurring problem in autonomy is the optimal assignment of agents to tasks. Often, such assignments cannot be computed efficiently. Therefore, the existing literature tends… (more)

Subjects/Keywords: Deep learning; combinatorial optimisation; neural networks; reinforcement learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gibbons, D. S. (2019). Deep Learning for Bipartite Assignment Problems. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/121335

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

Gibbons, Daniel Steve. “Deep Learning for Bipartite Assignment Problems.” 2019. Thesis, University of Adelaide. Accessed September 23, 2020. http://hdl.handle.net/2440/121335.

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

MLA Handbook (7th Edition):

Gibbons, Daniel Steve. “Deep Learning for Bipartite Assignment Problems.” 2019. Web. 23 Sep 2020.

Vancouver:

Gibbons DS. Deep Learning for Bipartite Assignment Problems. [Internet] [Thesis]. University of Adelaide; 2019. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/2440/121335.

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

Council of Science Editors:

Gibbons DS. Deep Learning for Bipartite Assignment Problems. [Thesis]. University of Adelaide; 2019. Available from: http://hdl.handle.net/2440/121335

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


University College Cork

11. Hurley, Barry. Exploiting machine learning for combinatorial problem solving and optimisation.

Degree: 2016, University College Cork

 This dissertation presents a number of contributions to the field of solver portfolios, in particular for combinatorial search problems. We propose a novel hierarchical portfolio… (more)

Subjects/Keywords: Constraint programming; Combinatorial optimisation; Machine learning; Artificial intelligence; Solver portfolio; Encoding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hurley, B. (2016). Exploiting machine learning for combinatorial problem solving and optimisation. (Thesis). University College Cork. Retrieved from http://hdl.handle.net/10468/5374

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

Hurley, Barry. “Exploiting machine learning for combinatorial problem solving and optimisation.” 2016. Thesis, University College Cork. Accessed September 23, 2020. http://hdl.handle.net/10468/5374.

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

MLA Handbook (7th Edition):

Hurley, Barry. “Exploiting machine learning for combinatorial problem solving and optimisation.” 2016. Web. 23 Sep 2020.

Vancouver:

Hurley B. Exploiting machine learning for combinatorial problem solving and optimisation. [Internet] [Thesis]. University College Cork; 2016. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/10468/5374.

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

Council of Science Editors:

Hurley B. Exploiting machine learning for combinatorial problem solving and optimisation. [Thesis]. University College Cork; 2016. Available from: http://hdl.handle.net/10468/5374

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


University College Cork

12. De Cauwer, Milan. Combinatorial optimisation for sustainable cloud computing.

Degree: 2018, University College Cork

 Enabled by both software and hardware advances, cloud computing has emerged as an efficient way to leverage economies of scale for building large computational infrastructures… (more)

Subjects/Keywords: Combinatorial optimisation; Cloud computing; Workload consolidation; Bin packing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

De Cauwer, M. (2018). Combinatorial optimisation for sustainable cloud computing. (Thesis). University College Cork. Retrieved from http://hdl.handle.net/10468/6903

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

De Cauwer, Milan. “Combinatorial optimisation for sustainable cloud computing.” 2018. Thesis, University College Cork. Accessed September 23, 2020. http://hdl.handle.net/10468/6903.

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

MLA Handbook (7th Edition):

De Cauwer, Milan. “Combinatorial optimisation for sustainable cloud computing.” 2018. Web. 23 Sep 2020.

Vancouver:

De Cauwer M. Combinatorial optimisation for sustainable cloud computing. [Internet] [Thesis]. University College Cork; 2018. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/10468/6903.

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

Council of Science Editors:

De Cauwer M. Combinatorial optimisation for sustainable cloud computing. [Thesis]. University College Cork; 2018. Available from: http://hdl.handle.net/10468/6903

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


University of Melbourne

13. Francis, Kathryn Glenn. Natural optimisation modelling for software developers.

Degree: 2016, University of Melbourne

 Constraint solving technology has been successfully applied to large industrial combinatorial optimisation problems with high impact, but is not widely applied to smaller problems. Unfortunately,… (more)

Subjects/Keywords: combinatorial optimisation; modelling; symbolic execution; native interface; constraint programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Francis, K. G. (2016). Natural optimisation modelling for software developers. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/128081

Chicago Manual of Style (16th Edition):

Francis, Kathryn Glenn. “Natural optimisation modelling for software developers.” 2016. Doctoral Dissertation, University of Melbourne. Accessed September 23, 2020. http://hdl.handle.net/11343/128081.

MLA Handbook (7th Edition):

Francis, Kathryn Glenn. “Natural optimisation modelling for software developers.” 2016. Web. 23 Sep 2020.

Vancouver:

Francis KG. Natural optimisation modelling for software developers. [Internet] [Doctoral dissertation]. University of Melbourne; 2016. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/11343/128081.

Council of Science Editors:

Francis KG. Natural optimisation modelling for software developers. [Doctoral Dissertation]. University of Melbourne; 2016. Available from: http://hdl.handle.net/11343/128081


Delft University of Technology

14. Doole, M.M. (author). Multi-Stage Formation Flight Planning.

Degree: 2016, Delft University of Technology

This thesis investigates the concept of fuel-reduction via formation flight of long-haul commercial aircraft on a network-wide scale, particularly addressing the issue of combinatorial complexity… (more)

Subjects/Keywords: Formation Flight; Centralised Formation Flight Planning; Flight Operations Optimisation; Airline Fuel Saving Strategy; Combinatorial Complexity; Combinatorial Explosions; NP-hard

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Doole, M. M. (. (2016). Multi-Stage Formation Flight Planning. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:44cb036b-51b8-4b1e-ba1e-a7d59936caa1

Chicago Manual of Style (16th Edition):

Doole, M M (author). “Multi-Stage Formation Flight Planning.” 2016. Masters Thesis, Delft University of Technology. Accessed September 23, 2020. http://resolver.tudelft.nl/uuid:44cb036b-51b8-4b1e-ba1e-a7d59936caa1.

MLA Handbook (7th Edition):

Doole, M M (author). “Multi-Stage Formation Flight Planning.” 2016. Web. 23 Sep 2020.

Vancouver:

Doole MM(. Multi-Stage Formation Flight Planning. [Internet] [Masters thesis]. Delft University of Technology; 2016. [cited 2020 Sep 23]. Available from: http://resolver.tudelft.nl/uuid:44cb036b-51b8-4b1e-ba1e-a7d59936caa1.

Council of Science Editors:

Doole MM(. Multi-Stage Formation Flight Planning. [Masters Thesis]. Delft University of Technology; 2016. Available from: http://resolver.tudelft.nl/uuid:44cb036b-51b8-4b1e-ba1e-a7d59936caa1

15. Maziere, Florian. Modèles de parallélisme pour les métaheuristiques multi-objectifs : Parallelism models for multi-objective metaheuristics.

Degree: Docteur es, Info - Informatique, 2019, Reims; Université du Québec à Chicoutimi

L’objectif de ce projet de trois ans est de proposer des avancées conceptuelles et technologiques dans la résolution de problèmes d’ordonnancement du personnel. L’atteinte de… (more)

Subjects/Keywords: Métaheuristiques; Multi-Objectifs; Modèles parallèles; Algorithmes évolutionnaires; Optimisation Combinatoire; Problèmes combinatoires; Metaheuristics; Multiobjective; Parallel; Evolutionary algorithms; Combinatorial optimization; Combinatorial problems; 004.35

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maziere, F. (2019). Modèles de parallélisme pour les métaheuristiques multi-objectifs : Parallelism models for multi-objective metaheuristics. (Doctoral Dissertation). Reims; Université du Québec à Chicoutimi. Retrieved from http://www.theses.fr/2019REIMS002

Chicago Manual of Style (16th Edition):

Maziere, Florian. “Modèles de parallélisme pour les métaheuristiques multi-objectifs : Parallelism models for multi-objective metaheuristics.” 2019. Doctoral Dissertation, Reims; Université du Québec à Chicoutimi. Accessed September 23, 2020. http://www.theses.fr/2019REIMS002.

MLA Handbook (7th Edition):

Maziere, Florian. “Modèles de parallélisme pour les métaheuristiques multi-objectifs : Parallelism models for multi-objective metaheuristics.” 2019. Web. 23 Sep 2020.

Vancouver:

Maziere F. Modèles de parallélisme pour les métaheuristiques multi-objectifs : Parallelism models for multi-objective metaheuristics. [Internet] [Doctoral dissertation]. Reims; Université du Québec à Chicoutimi; 2019. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2019REIMS002.

Council of Science Editors:

Maziere F. Modèles de parallélisme pour les métaheuristiques multi-objectifs : Parallelism models for multi-objective metaheuristics. [Doctoral Dissertation]. Reims; Université du Québec à Chicoutimi; 2019. Available from: http://www.theses.fr/2019REIMS002


Univerzitet u Beogradu

16. Kordić, Stevan Lj., 1969-. Метод седиментације и његове примјене у проблемима дискретне математике.

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

Математика - Дискретна математика / Mathematics - Discrete mathematics

Проблеми задовољења ограничења, којима припадају и проблеми оптимизације, спадају у веома значајне проблеме дискретне математике са… (more)

Subjects/Keywords: constrain satisfaction problem; optimisation problem; discrete mathematics; combinatorial optimisation; exact solution; algorithm; Boolean satisfiability; Whitehead minimisation problem; berth Allocation problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kordić, Stevan Lj., 1. (2018). Метод седиментације и његове примјене у проблемима дискретне математике. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:15359/bdef:Content/get

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

Chicago Manual of Style (16th Edition):

Kordić, Stevan Lj., 1969-. “Метод седиментације и његове примјене у проблемима дискретне математике.” 2018. Thesis, Univerzitet u Beogradu. Accessed September 23, 2020. https://fedorabg.bg.ac.rs/fedora/get/o:15359/bdef:Content/get.

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

MLA Handbook (7th Edition):

Kordić, Stevan Lj., 1969-. “Метод седиментације и његове примјене у проблемима дискретне математике.” 2018. Web. 23 Sep 2020.

Vancouver:

Kordić, Stevan Lj. 1. Метод седиментације и његове примјене у проблемима дискретне математике. [Internet] [Thesis]. Univerzitet u Beogradu; 2018. [cited 2020 Sep 23]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15359/bdef:Content/get.

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

Council of Science Editors:

Kordić, Stevan Lj. 1. Метод седиментације и његове примјене у проблемима дискретне математике. [Thesis]. Univerzitet u Beogradu; 2018. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15359/bdef:Content/get

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


Université de Grenoble

17. Nguyen, Viet Hang. Constructive approaches to the rigidity of frameworks : Constructive approaches to the rigidity of frameworks.

Degree: Docteur es, Mathématique et Informatique, 2013, Université de Grenoble

La théorie de la rigidité étudie l'unicité des réalisations des graphes, i.e., des charpentes. Initialement motivée par l'ingénierie des structures, la théorie de la rigidité… (more)

Subjects/Keywords: Optimisation combinatoire; Rigidité; Graphes; Matroïde; Construction inductive; Décomposition; Combinatorial optimisation; Rigidity; Graphs; Matroid; Inductive construction; Decomposition; 510; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nguyen, V. H. (2013). Constructive approaches to the rigidity of frameworks : Constructive approaches to the rigidity of frameworks. (Doctoral Dissertation). Université de Grenoble. Retrieved from http://www.theses.fr/2013GRENM052

Chicago Manual of Style (16th Edition):

Nguyen, Viet Hang. “Constructive approaches to the rigidity of frameworks : Constructive approaches to the rigidity of frameworks.” 2013. Doctoral Dissertation, Université de Grenoble. Accessed September 23, 2020. http://www.theses.fr/2013GRENM052.

MLA Handbook (7th Edition):

Nguyen, Viet Hang. “Constructive approaches to the rigidity of frameworks : Constructive approaches to the rigidity of frameworks.” 2013. Web. 23 Sep 2020.

Vancouver:

Nguyen VH. Constructive approaches to the rigidity of frameworks : Constructive approaches to the rigidity of frameworks. [Internet] [Doctoral dissertation]. Université de Grenoble; 2013. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2013GRENM052.

Council of Science Editors:

Nguyen VH. Constructive approaches to the rigidity of frameworks : Constructive approaches to the rigidity of frameworks. [Doctoral Dissertation]. Université de Grenoble; 2013. Available from: http://www.theses.fr/2013GRENM052

18. Desport, Pierre. Planification tactique de chaîne d'approvisionnement en boucle fermée : modélisation, résolution, évaluation : Tactical Planning Of Closed-Loop Supply Chains : modeling, Resolution, Evaluation.

Degree: Docteur es, Informatique, 2017, Angers

La gestion de chaîne d’approvisionnement est un élément essentiel à la performance des entreprises et fait l’objet d’une attention particulière depuis plusieurs décennies. Dans le… (more)

Subjects/Keywords: Chaîne d’approvisionnement; Planification tactique; Supply chain; Combinatorial optimisation; Tactical planning; Decision support; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Desport, P. (2017). Planification tactique de chaîne d'approvisionnement en boucle fermée : modélisation, résolution, évaluation : Tactical Planning Of Closed-Loop Supply Chains : modeling, Resolution, Evaluation. (Doctoral Dissertation). Angers. Retrieved from http://www.theses.fr/2017ANGE0012

Chicago Manual of Style (16th Edition):

Desport, Pierre. “Planification tactique de chaîne d'approvisionnement en boucle fermée : modélisation, résolution, évaluation : Tactical Planning Of Closed-Loop Supply Chains : modeling, Resolution, Evaluation.” 2017. Doctoral Dissertation, Angers. Accessed September 23, 2020. http://www.theses.fr/2017ANGE0012.

MLA Handbook (7th Edition):

Desport, Pierre. “Planification tactique de chaîne d'approvisionnement en boucle fermée : modélisation, résolution, évaluation : Tactical Planning Of Closed-Loop Supply Chains : modeling, Resolution, Evaluation.” 2017. Web. 23 Sep 2020.

Vancouver:

Desport P. Planification tactique de chaîne d'approvisionnement en boucle fermée : modélisation, résolution, évaluation : Tactical Planning Of Closed-Loop Supply Chains : modeling, Resolution, Evaluation. [Internet] [Doctoral dissertation]. Angers; 2017. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2017ANGE0012.

Council of Science Editors:

Desport P. Planification tactique de chaîne d'approvisionnement en boucle fermée : modélisation, résolution, évaluation : Tactical Planning Of Closed-Loop Supply Chains : modeling, Resolution, Evaluation. [Doctoral Dissertation]. Angers; 2017. Available from: http://www.theses.fr/2017ANGE0012

19. Nakache, Elie. Chemin optimal, conception et amélioration de réseaux sous contrainte de distance : Optimal path, design and improvement of networks with distance constraint.

Degree: Docteur es, Informatique, 2016, Aix Marseille Université

Cette thèse porte sur différents problèmes d'optimisation combinatoire dont nous avons caractérisé la difficulté en décrivant des réductions et des algorithmes polynomiaux exacts ou approchés.En… (more)

Subjects/Keywords: Réseaux; Optimisation combinatoire; Complexité; Chemins; Arbres couvrant; Networks; Combinatorial optimization; Complexity; Paths; Spanning trees; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nakache, E. (2016). Chemin optimal, conception et amélioration de réseaux sous contrainte de distance : Optimal path, design and improvement of networks with distance constraint. (Doctoral Dissertation). Aix Marseille Université. Retrieved from http://www.theses.fr/2016AIXM4023

Chicago Manual of Style (16th Edition):

Nakache, Elie. “Chemin optimal, conception et amélioration de réseaux sous contrainte de distance : Optimal path, design and improvement of networks with distance constraint.” 2016. Doctoral Dissertation, Aix Marseille Université. Accessed September 23, 2020. http://www.theses.fr/2016AIXM4023.

MLA Handbook (7th Edition):

Nakache, Elie. “Chemin optimal, conception et amélioration de réseaux sous contrainte de distance : Optimal path, design and improvement of networks with distance constraint.” 2016. Web. 23 Sep 2020.

Vancouver:

Nakache E. Chemin optimal, conception et amélioration de réseaux sous contrainte de distance : Optimal path, design and improvement of networks with distance constraint. [Internet] [Doctoral dissertation]. Aix Marseille Université 2016. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2016AIXM4023.

Council of Science Editors:

Nakache E. Chemin optimal, conception et amélioration de réseaux sous contrainte de distance : Optimal path, design and improvement of networks with distance constraint. [Doctoral Dissertation]. Aix Marseille Université 2016. Available from: http://www.theses.fr/2016AIXM4023

20. Autuori, Julien. Energie, coopération méta-heuristiques et logique floue pour l'optimisation difficile : Energy, Cooperation Meta-heuristics and Fuzzy Logic for NP-hard Optimization.

Degree: Docteur es, Optimisation et Sûreté des Systèmes, 2014, Troyes

Au cours de cette thèse, l'exploration de l'espace de solutions par des métaheuristiques est abordée. Les métaheuristiques sont des méthodes d'optimisation utilisées pour résoudre des… (more)

Subjects/Keywords: Optimisation combinatoire; Algorithmes d'approximation; Ordonnancement (gestion); Combinatorial optimization; Approximation algorithms; Production scheduling; 658.403 3

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Autuori, J. (2014). Energie, coopération méta-heuristiques et logique floue pour l'optimisation difficile : Energy, Cooperation Meta-heuristics and Fuzzy Logic for NP-hard Optimization. (Doctoral Dissertation). Troyes. Retrieved from http://www.theses.fr/2014TROY0036

Chicago Manual of Style (16th Edition):

Autuori, Julien. “Energie, coopération méta-heuristiques et logique floue pour l'optimisation difficile : Energy, Cooperation Meta-heuristics and Fuzzy Logic for NP-hard Optimization.” 2014. Doctoral Dissertation, Troyes. Accessed September 23, 2020. http://www.theses.fr/2014TROY0036.

MLA Handbook (7th Edition):

Autuori, Julien. “Energie, coopération méta-heuristiques et logique floue pour l'optimisation difficile : Energy, Cooperation Meta-heuristics and Fuzzy Logic for NP-hard Optimization.” 2014. Web. 23 Sep 2020.

Vancouver:

Autuori J. Energie, coopération méta-heuristiques et logique floue pour l'optimisation difficile : Energy, Cooperation Meta-heuristics and Fuzzy Logic for NP-hard Optimization. [Internet] [Doctoral dissertation]. Troyes; 2014. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2014TROY0036.

Council of Science Editors:

Autuori J. Energie, coopération méta-heuristiques et logique floue pour l'optimisation difficile : Energy, Cooperation Meta-heuristics and Fuzzy Logic for NP-hard Optimization. [Doctoral Dissertation]. Troyes; 2014. Available from: http://www.theses.fr/2014TROY0036


Université Montpellier II

21. Watrigant, Rémi. Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs.

Degree: Docteur es, Informatique, 2014, Université Montpellier II

La théorie de la NP-complétude nous apprend que pour un certain nombre de problèmes d'optimisation, il est vain d'espérer un algorithme efficace calculant une solution… (more)

Subjects/Keywords: Optimisation combinatoire; Approximation; Complexité paramétrée; Problèmes de graphes; Combinatorial optimization; Approximation; Parameterized complexity; Graph problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Watrigant, R. (2014). Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs. (Doctoral Dissertation). Université Montpellier II. Retrieved from http://www.theses.fr/2014MON20100

Chicago Manual of Style (16th Edition):

Watrigant, Rémi. “Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs.” 2014. Doctoral Dissertation, Université Montpellier II. Accessed September 23, 2020. http://www.theses.fr/2014MON20100.

MLA Handbook (7th Edition):

Watrigant, Rémi. “Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs.” 2014. Web. 23 Sep 2020.

Vancouver:

Watrigant R. Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs. [Internet] [Doctoral dissertation]. Université Montpellier II; 2014. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2014MON20100.

Council of Science Editors:

Watrigant R. Approximation et complexité paramétrée de problèmes d’optimisation dans les graphes : partitions et sous-graphes : Approximation and parameterized complexity of graph optimisation problems : partitions and subgraphs. [Doctoral Dissertation]. Université Montpellier II; 2014. Available from: http://www.theses.fr/2014MON20100

22. Barat, Remi. Load Balancing of Multi-physics Simulation by Multi-criteria Graph Partitioning : Equilibrage de charge pour des simulations multi-physiques par partitionnement multcritères de graphes.

Degree: Docteur es, Informatique, 2017, Bordeaux

 Les simulations dites multi-physiques couplent plusieurs phases de calcul. Lorsqu’elles sont exécutées en parallèle sur des architectures à mémoire distribuée, la minimisation du temps de… (more)

Subjects/Keywords: Partitionnement; Optimisation combinatoire; Multi-niveaux; Multi-critères; Graphe; Partitioning; Combinatorial optimization; Multilevel; Multi-criteria; Graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Barat, R. (2017). Load Balancing of Multi-physics Simulation by Multi-criteria Graph Partitioning : Equilibrage de charge pour des simulations multi-physiques par partitionnement multcritères de graphes. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2017BORD0961

Chicago Manual of Style (16th Edition):

Barat, Remi. “Load Balancing of Multi-physics Simulation by Multi-criteria Graph Partitioning : Equilibrage de charge pour des simulations multi-physiques par partitionnement multcritères de graphes.” 2017. Doctoral Dissertation, Bordeaux. Accessed September 23, 2020. http://www.theses.fr/2017BORD0961.

MLA Handbook (7th Edition):

Barat, Remi. “Load Balancing of Multi-physics Simulation by Multi-criteria Graph Partitioning : Equilibrage de charge pour des simulations multi-physiques par partitionnement multcritères de graphes.” 2017. Web. 23 Sep 2020.

Vancouver:

Barat R. Load Balancing of Multi-physics Simulation by Multi-criteria Graph Partitioning : Equilibrage de charge pour des simulations multi-physiques par partitionnement multcritères de graphes. [Internet] [Doctoral dissertation]. Bordeaux; 2017. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2017BORD0961.

Council of Science Editors:

Barat R. Load Balancing of Multi-physics Simulation by Multi-criteria Graph Partitioning : Equilibrage de charge pour des simulations multi-physiques par partitionnement multcritères de graphes. [Doctoral Dissertation]. Bordeaux; 2017. Available from: http://www.theses.fr/2017BORD0961

23. Albarello, Nicolas. Model-based trade studies in systems architectures design phases : Etudes comparatives basées sur les modèles en phase de conception d’architectures de systèmes.

Degree: Docteur es, Sciences pour l'ingénieur, 2012, Châtenay-Malabry, Ecole centrale de Paris

La conception d'architectures de systèmes est une tâche complexe qui implique des enjeux majeurs. Au cours de cette activité, les concepteurs du système doivent créer… (more)

Subjects/Keywords: Architecture de système; Optimisation combinatoire; Synthèse d’alternatives; Systems architecture; Combinatorial optimization; Alternative synthesis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Albarello, N. (2012). Model-based trade studies in systems architectures design phases : Etudes comparatives basées sur les modèles en phase de conception d’architectures de systèmes. (Doctoral Dissertation). Châtenay-Malabry, Ecole centrale de Paris. Retrieved from http://www.theses.fr/2012ECAP0052

Chicago Manual of Style (16th Edition):

Albarello, Nicolas. “Model-based trade studies in systems architectures design phases : Etudes comparatives basées sur les modèles en phase de conception d’architectures de systèmes.” 2012. Doctoral Dissertation, Châtenay-Malabry, Ecole centrale de Paris. Accessed September 23, 2020. http://www.theses.fr/2012ECAP0052.

MLA Handbook (7th Edition):

Albarello, Nicolas. “Model-based trade studies in systems architectures design phases : Etudes comparatives basées sur les modèles en phase de conception d’architectures de systèmes.” 2012. Web. 23 Sep 2020.

Vancouver:

Albarello N. Model-based trade studies in systems architectures design phases : Etudes comparatives basées sur les modèles en phase de conception d’architectures de systèmes. [Internet] [Doctoral dissertation]. Châtenay-Malabry, Ecole centrale de Paris; 2012. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2012ECAP0052.

Council of Science Editors:

Albarello N. Model-based trade studies in systems architectures design phases : Etudes comparatives basées sur les modèles en phase de conception d’architectures de systèmes. [Doctoral Dissertation]. Châtenay-Malabry, Ecole centrale de Paris; 2012. Available from: http://www.theses.fr/2012ECAP0052

24. Marshall, Richard J. Adapting a Hyper-heuristic to Respond to Scalability Issues in Combinatorial Optimisation.

Degree: 2015, Victoria University of Wellington

 The development of a heuristic to solve an optimisation problem in a new domain, or a specific variation of an existing problem domain, is often… (more)

Subjects/Keywords: Hyper-heuristic; Scalability; Combinatorial optimisation

…beginning. Traditional methods of solving combinatorial optimisation problems use algorithms and… …meaningless output. A hyper-heuristic should be suitable for use on any combinatorial optimisation… …combinatorial optimisation problems. There are potential benefits to industry if an efficient and… …develop and compare the relative performance, on seven combinatorial optimisation problem… …but is nevertheless a NP-hard [46] combinatorial optimisation problem. 1.4… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Marshall, R. J. (2015). Adapting a Hyper-heuristic to Respond to Scalability Issues in Combinatorial Optimisation. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/4242

Chicago Manual of Style (16th Edition):

Marshall, Richard J. “Adapting a Hyper-heuristic to Respond to Scalability Issues in Combinatorial Optimisation.” 2015. Masters Thesis, Victoria University of Wellington. Accessed September 23, 2020. http://hdl.handle.net/10063/4242.

MLA Handbook (7th Edition):

Marshall, Richard J. “Adapting a Hyper-heuristic to Respond to Scalability Issues in Combinatorial Optimisation.” 2015. Web. 23 Sep 2020.

Vancouver:

Marshall RJ. Adapting a Hyper-heuristic to Respond to Scalability Issues in Combinatorial Optimisation. [Internet] [Masters thesis]. Victoria University of Wellington; 2015. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/10063/4242.

Council of Science Editors:

Marshall RJ. Adapting a Hyper-heuristic to Respond to Scalability Issues in Combinatorial Optimisation. [Masters Thesis]. Victoria University of Wellington; 2015. Available from: http://hdl.handle.net/10063/4242

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

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 September 23, 2020. http://www.theses.fr/2015MONTS010.

MLA Handbook (7th 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. 23 Sep 2020.

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 2020 Sep 23]. 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

26. Almeida Coco, Amadeu. Robust covering problems : formulations, algorithms and an application : Problème de couverture robuste : formulations, algorithmes et une application.

Degree: Docteur es, Optimisation et Sûreté des Systèmes, 2017, Troyes; Universidade federal de Minas Gerais

Deux problèmes robustes d'optimisation NP-difficiles sont étudiés dans cette thèse: le problème min-max regret de couverture pondérée (min-max regret WSCP) et le problème min-max regret… (more)

Subjects/Keywords: Optimisation combinatoire; Métaheuristiques; Algorithmes; Recherche opérationnelle; Logistique; Combinatorial optimization; Metaheuristics; Algorithms; Operations research; Logistics; 658.403

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Almeida Coco, A. (2017). Robust covering problems : formulations, algorithms and an application : Problème de couverture robuste : formulations, algorithmes et une application. (Doctoral Dissertation). Troyes; Universidade federal de Minas Gerais. Retrieved from http://www.theses.fr/2017TROY0026

Chicago Manual of Style (16th Edition):

Almeida Coco, Amadeu. “Robust covering problems : formulations, algorithms and an application : Problème de couverture robuste : formulations, algorithmes et une application.” 2017. Doctoral Dissertation, Troyes; Universidade federal de Minas Gerais. Accessed September 23, 2020. http://www.theses.fr/2017TROY0026.

MLA Handbook (7th Edition):

Almeida Coco, Amadeu. “Robust covering problems : formulations, algorithms and an application : Problème de couverture robuste : formulations, algorithmes et une application.” 2017. Web. 23 Sep 2020.

Vancouver:

Almeida Coco A. Robust covering problems : formulations, algorithms and an application : Problème de couverture robuste : formulations, algorithmes et une application. [Internet] [Doctoral dissertation]. Troyes; Universidade federal de Minas Gerais; 2017. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2017TROY0026.

Council of Science Editors:

Almeida Coco A. Robust covering problems : formulations, algorithms and an application : Problème de couverture robuste : formulations, algorithmes et une application. [Doctoral Dissertation]. Troyes; Universidade federal de Minas Gerais; 2017. Available from: http://www.theses.fr/2017TROY0026

27. Mharsi, Niezi. Cloud-Radio Access Networks : design, optimization and algorithms : Cloud-Radio Access Networks : Conception, optimisation et algorithmes.

Degree: Docteur es, Réseaux, information et communications, 2019, Université Paris-Saclay (ComUE)

 Cloud-Radio Access Network (C-RAN) est une architecture prometteuse pour faire face à l’augmentation exponentielle des demandes de trafic de données et surmonter les défis des… (more)

Subjects/Keywords: C-RAN; 5G; Optimisation combinatoire; Allocation des ressources; C-RAN; 5G; Combinatorial optimization; Resource allocation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mharsi, N. (2019). Cloud-Radio Access Networks : design, optimization and algorithms : Cloud-Radio Access Networks : Conception, optimisation et algorithmes. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2019SACLT043

Chicago Manual of Style (16th Edition):

Mharsi, Niezi. “Cloud-Radio Access Networks : design, optimization and algorithms : Cloud-Radio Access Networks : Conception, optimisation et algorithmes.” 2019. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed September 23, 2020. http://www.theses.fr/2019SACLT043.

MLA Handbook (7th Edition):

Mharsi, Niezi. “Cloud-Radio Access Networks : design, optimization and algorithms : Cloud-Radio Access Networks : Conception, optimisation et algorithmes.” 2019. Web. 23 Sep 2020.

Vancouver:

Mharsi N. Cloud-Radio Access Networks : design, optimization and algorithms : Cloud-Radio Access Networks : Conception, optimisation et algorithmes. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2019. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2019SACLT043.

Council of Science Editors:

Mharsi N. Cloud-Radio Access Networks : design, optimization and algorithms : Cloud-Radio Access Networks : Conception, optimisation et algorithmes. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2019. Available from: http://www.theses.fr/2019SACLT043


University of Melbourne

28. Andersen, Patrick. Degree bounded geometric spanning trees with a bottleneck objective function.

Degree: 2019, University of Melbourne

 We introduce the geometric δ-minimum bottleneck spanning tree problem (δ-MBST), which is the problem of finding a spanning tree for a set of points in… (more)

Subjects/Keywords: minimum spanning trees; bottleneck objective; approximation algorithms; discrete geometry; bounded degree; combinatorial optimisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Andersen, P. (2019). Degree bounded geometric spanning trees with a bottleneck objective function. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/221999

Chicago Manual of Style (16th Edition):

Andersen, Patrick. “Degree bounded geometric spanning trees with a bottleneck objective function.” 2019. Doctoral Dissertation, University of Melbourne. Accessed September 23, 2020. http://hdl.handle.net/11343/221999.

MLA Handbook (7th Edition):

Andersen, Patrick. “Degree bounded geometric spanning trees with a bottleneck objective function.” 2019. Web. 23 Sep 2020.

Vancouver:

Andersen P. Degree bounded geometric spanning trees with a bottleneck objective function. [Internet] [Doctoral dissertation]. University of Melbourne; 2019. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/11343/221999.

Council of Science Editors:

Andersen P. Degree bounded geometric spanning trees with a bottleneck objective function. [Doctoral Dissertation]. University of Melbourne; 2019. Available from: http://hdl.handle.net/11343/221999


De Montfort University

29. Kang, Parminder. Improving manufacturing systems using integrated discrete event simulation and evolutionary algorithms.

Degree: PhD, 2012, De Montfort University

 High variety and low volume manufacturing environment always been a challenge for organisations to maintain their overall performance especially because of the high level of… (more)

Subjects/Keywords: 620; Manufacturing Systems; Process Improvement; Combinatorial Optimisation; Job Sequencing; Buffer Sizing; Drum-Buffer-Rope

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kang, P. (2012). Improving manufacturing systems using integrated discrete event simulation and evolutionary algorithms. (Doctoral Dissertation). De Montfort University. Retrieved from http://hdl.handle.net/2086/7975

Chicago Manual of Style (16th Edition):

Kang, Parminder. “Improving manufacturing systems using integrated discrete event simulation and evolutionary algorithms.” 2012. Doctoral Dissertation, De Montfort University. Accessed September 23, 2020. http://hdl.handle.net/2086/7975.

MLA Handbook (7th Edition):

Kang, Parminder. “Improving manufacturing systems using integrated discrete event simulation and evolutionary algorithms.” 2012. Web. 23 Sep 2020.

Vancouver:

Kang P. Improving manufacturing systems using integrated discrete event simulation and evolutionary algorithms. [Internet] [Doctoral dissertation]. De Montfort University; 2012. [cited 2020 Sep 23]. Available from: http://hdl.handle.net/2086/7975.

Council of Science Editors:

Kang P. Improving manufacturing systems using integrated discrete event simulation and evolutionary algorithms. [Doctoral Dissertation]. De Montfort University; 2012. Available from: http://hdl.handle.net/2086/7975

30. Duvillié, Guillerme. Approximation, complexité paramétrée et stratégies de résolution de problèmes d'affectation multidimensionnelle : Approximability, parameterized complexity and solving strategies of some multidimensional assignment problems.

Degree: Docteur es, Informatique, 2016, Montpellier

 Au cours de la thèse, nous nous sommes intéressés aux problèmes d'empilement de wafers. Ces problèmes apparaissent lors de la fabrication de processeurs en 3… (more)

Subjects/Keywords: Optimisation; Test; Combinatoire; Approximation; Complexité paramétrée; Optimization; Test; Combinatorial; Approximability; Parameterized complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duvillié, G. (2016). Approximation, complexité paramétrée et stratégies de résolution de problèmes d'affectation multidimensionnelle : Approximability, parameterized complexity and solving strategies of some multidimensional assignment problems. (Doctoral Dissertation). Montpellier. Retrieved from http://www.theses.fr/2016MONTT321

Chicago Manual of Style (16th Edition):

Duvillié, Guillerme. “Approximation, complexité paramétrée et stratégies de résolution de problèmes d'affectation multidimensionnelle : Approximability, parameterized complexity and solving strategies of some multidimensional assignment problems.” 2016. Doctoral Dissertation, Montpellier. Accessed September 23, 2020. http://www.theses.fr/2016MONTT321.

MLA Handbook (7th Edition):

Duvillié, Guillerme. “Approximation, complexité paramétrée et stratégies de résolution de problèmes d'affectation multidimensionnelle : Approximability, parameterized complexity and solving strategies of some multidimensional assignment problems.” 2016. Web. 23 Sep 2020.

Vancouver:

Duvillié G. Approximation, complexité paramétrée et stratégies de résolution de problèmes d'affectation multidimensionnelle : Approximability, parameterized complexity and solving strategies of some multidimensional assignment problems. [Internet] [Doctoral dissertation]. Montpellier; 2016. [cited 2020 Sep 23]. Available from: http://www.theses.fr/2016MONTT321.

Council of Science Editors:

Duvillié G. Approximation, complexité paramétrée et stratégies de résolution de problèmes d'affectation multidimensionnelle : Approximability, parameterized complexity and solving strategies of some multidimensional assignment problems. [Doctoral Dissertation]. Montpellier; 2016. Available from: http://www.theses.fr/2016MONTT321

[1] [2] [3] [4] [5]

.