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 optimization). Showing records 1 – 30 of 493 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Hong Kong

1. Zhao, Qiulan. Ranking tournaments with no errors.

Degree: PhD, 2017, University of Hong Kong

As various combinatorial optimization problems can be formulated as integer linear programs, polyhedral and linear programming approaches have turned out to be essential and powerful… (more)

Subjects/Keywords: Combinatorial optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, Q. (2017). Ranking tournaments with no errors. (Doctoral Dissertation). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/249816

Chicago Manual of Style (16th Edition):

Zhao, Qiulan. “Ranking tournaments with no errors.” 2017. Doctoral Dissertation, University of Hong Kong. Accessed February 18, 2020. http://hdl.handle.net/10722/249816.

MLA Handbook (7th Edition):

Zhao, Qiulan. “Ranking tournaments with no errors.” 2017. Web. 18 Feb 2020.

Vancouver:

Zhao Q. Ranking tournaments with no errors. [Internet] [Doctoral dissertation]. University of Hong Kong; 2017. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/10722/249816.

Council of Science Editors:

Zhao Q. Ranking tournaments with no errors. [Doctoral Dissertation]. University of Hong Kong; 2017. Available from: http://hdl.handle.net/10722/249816


University of Hong Kong

2. 肖汉; Xiao, Han. Some polyhedral results in combinatorial optimization.

Degree: PhD, 2016, University of Hong Kong

Many combinatorial optimization problems can be conceived of as optimizing a linear function over a polyhedron. Investigating properties of the associated polyhedron has been evidenced… (more)

Subjects/Keywords: Combinatorial optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

肖汉; Xiao, H. (2016). Some polyhedral results in combinatorial optimization. (Doctoral Dissertation). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/233945

Chicago Manual of Style (16th Edition):

肖汉; Xiao, Han. “Some polyhedral results in combinatorial optimization.” 2016. Doctoral Dissertation, University of Hong Kong. Accessed February 18, 2020. http://hdl.handle.net/10722/233945.

MLA Handbook (7th Edition):

肖汉; Xiao, Han. “Some polyhedral results in combinatorial optimization.” 2016. Web. 18 Feb 2020.

Vancouver:

肖汉; Xiao H. Some polyhedral results in combinatorial optimization. [Internet] [Doctoral dissertation]. University of Hong Kong; 2016. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/10722/233945.

Council of Science Editors:

肖汉; Xiao H. Some polyhedral results in combinatorial optimization. [Doctoral Dissertation]. University of Hong Kong; 2016. Available from: http://hdl.handle.net/10722/233945


University of Waterloo

3. de Carli Silva, Marcel Kenji. Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality.

Degree: 2013, University of Waterloo

 The Lovasz theta function and the associated convex sets known as theta bodies are fundamental objects in combinatorial and semidefinite optimization. They are accompanied by… (more)

Subjects/Keywords: combinatorial optimization; semidefinite optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

de Carli Silva, M. K. (2013). Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7812

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 Carli Silva, Marcel Kenji. “Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality.” 2013. Thesis, University of Waterloo. Accessed February 18, 2020. http://hdl.handle.net/10012/7812.

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

MLA Handbook (7th Edition):

de Carli Silva, Marcel Kenji. “Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality.” 2013. Web. 18 Feb 2020.

Vancouver:

de Carli Silva MK. Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/10012/7812.

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

Council of Science Editors:

de Carli Silva MK. Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/7812

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


University of Hong Kong

4. Sang, Jiajun. Min-max relations on two packing problems.

Degree: PhD, 2017, University of Hong Kong

Min-max relations appear widely among various combinatorial optimization problems. Packing problems also have an essential position among all topics of graph theory. This thesis aims… (more)

Subjects/Keywords: Graph theory; Combinatorial optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sang, J. (2017). Min-max relations on two packing problems. (Doctoral Dissertation). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/249866

Chicago Manual of Style (16th Edition):

Sang, Jiajun. “Min-max relations on two packing problems.” 2017. Doctoral Dissertation, University of Hong Kong. Accessed February 18, 2020. http://hdl.handle.net/10722/249866.

MLA Handbook (7th Edition):

Sang, Jiajun. “Min-max relations on two packing problems.” 2017. Web. 18 Feb 2020.

Vancouver:

Sang J. Min-max relations on two packing problems. [Internet] [Doctoral dissertation]. University of Hong Kong; 2017. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/10722/249866.

Council of Science Editors:

Sang J. Min-max relations on two packing problems. [Doctoral Dissertation]. University of Hong Kong; 2017. Available from: http://hdl.handle.net/10722/249866


University of Hong Kong

5. Chen, Cheng. Multicommodity flows : integrality, duality, and feasibility.

Degree: M. Phil., 2016, University of Hong Kong

published_or_final_version

Mathematics

Master

Master of Philosophy

Subjects/Keywords: Combinatorial optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, C. (2016). Multicommodity flows : integrality, duality, and feasibility. (Masters Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/235912

Chicago Manual of Style (16th Edition):

Chen, Cheng. “Multicommodity flows : integrality, duality, and feasibility.” 2016. Masters Thesis, University of Hong Kong. Accessed February 18, 2020. http://hdl.handle.net/10722/235912.

MLA Handbook (7th Edition):

Chen, Cheng. “Multicommodity flows : integrality, duality, and feasibility.” 2016. Web. 18 Feb 2020.

Vancouver:

Chen C. Multicommodity flows : integrality, duality, and feasibility. [Internet] [Masters thesis]. University of Hong Kong; 2016. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/10722/235912.

Council of Science Editors:

Chen C. Multicommodity flows : integrality, duality, and feasibility. [Masters Thesis]. University of Hong Kong; 2016. Available from: http://hdl.handle.net/10722/235912


University of Stirling

6. Hinxman, Anthony Ian. The use of geometric information in heuristic optimization.

Degree: PhD, School of Natural Sciences, 1978, University of Stirling

 The trim-loss, or cutting stock, problem arises whenever material manufactured continuously or in large pieces has to be cut into pieces of sizes ordered by… (more)

Subjects/Keywords: Combinatorial optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hinxman, A. I. (1978). The use of geometric information in heuristic optimization. (Doctoral Dissertation). University of Stirling. Retrieved from http://hdl.handle.net/1893/3453

Chicago Manual of Style (16th Edition):

Hinxman, Anthony Ian. “The use of geometric information in heuristic optimization.” 1978. Doctoral Dissertation, University of Stirling. Accessed February 18, 2020. http://hdl.handle.net/1893/3453.

MLA Handbook (7th Edition):

Hinxman, Anthony Ian. “The use of geometric information in heuristic optimization.” 1978. Web. 18 Feb 2020.

Vancouver:

Hinxman AI. The use of geometric information in heuristic optimization. [Internet] [Doctoral dissertation]. University of Stirling; 1978. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/1893/3453.

Council of Science Editors:

Hinxman AI. The use of geometric information in heuristic optimization. [Doctoral Dissertation]. University of Stirling; 1978. Available from: http://hdl.handle.net/1893/3453


Brock University

7. Comte, Pascal. Bio-inspired optimization & sampling technique for side-chain packing in MCCE .

Degree: Department of Computer Science, 2010, Brock University

 The prediction of proteins' conformation helps to understand their exhibited functions, allows for modeling and allows for the possible synthesis of the studied protein. Our… (more)

Subjects/Keywords: Proteins  – Synthesis; Combinatorial optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Comte, P. (2010). Bio-inspired optimization & sampling technique for side-chain packing in MCCE . (Thesis). Brock University. Retrieved from http://hdl.handle.net/10464/3059

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

Comte, Pascal. “Bio-inspired optimization & sampling technique for side-chain packing in MCCE .” 2010. Thesis, Brock University. Accessed February 18, 2020. http://hdl.handle.net/10464/3059.

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

MLA Handbook (7th Edition):

Comte, Pascal. “Bio-inspired optimization & sampling technique for side-chain packing in MCCE .” 2010. Web. 18 Feb 2020.

Vancouver:

Comte P. Bio-inspired optimization & sampling technique for side-chain packing in MCCE . [Internet] [Thesis]. Brock University; 2010. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/10464/3059.

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

Council of Science Editors:

Comte P. Bio-inspired optimization & sampling technique for side-chain packing in MCCE . [Thesis]. Brock University; 2010. Available from: http://hdl.handle.net/10464/3059

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

8. Saleh, Sagvan Ali. Contribution à la résolution des problèmes combinatoires : optimisation séquentielle et parallèle : Contribution for solving combinatorial problems : sequential and parallel optimization.

Degree: Docteur es, Informatique, 2015, Amiens

Les problèmes d’optimisation combinatoire sont d’un grand intérêt à la fois pour le monde scientifique et le monde industriel. La communauté scientifique a oeuvré pour… (more)

Subjects/Keywords: Informatique; Combinatorial optimization; Heuristic; 005

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Saleh, S. A. (2015). Contribution à la résolution des problèmes combinatoires : optimisation séquentielle et parallèle : Contribution for solving combinatorial problems : sequential and parallel optimization. (Doctoral Dissertation). Amiens. Retrieved from http://www.theses.fr/2015AMIE0010

Chicago Manual of Style (16th Edition):

Saleh, Sagvan Ali. “Contribution à la résolution des problèmes combinatoires : optimisation séquentielle et parallèle : Contribution for solving combinatorial problems : sequential and parallel optimization.” 2015. Doctoral Dissertation, Amiens. Accessed February 18, 2020. http://www.theses.fr/2015AMIE0010.

MLA Handbook (7th Edition):

Saleh, Sagvan Ali. “Contribution à la résolution des problèmes combinatoires : optimisation séquentielle et parallèle : Contribution for solving combinatorial problems : sequential and parallel optimization.” 2015. Web. 18 Feb 2020.

Vancouver:

Saleh SA. Contribution à la résolution des problèmes combinatoires : optimisation séquentielle et parallèle : Contribution for solving combinatorial problems : sequential and parallel optimization. [Internet] [Doctoral dissertation]. Amiens; 2015. [cited 2020 Feb 18]. Available from: http://www.theses.fr/2015AMIE0010.

Council of Science Editors:

Saleh SA. Contribution à la résolution des problèmes combinatoires : optimisation séquentielle et parallèle : Contribution for solving combinatorial problems : sequential and parallel optimization. [Doctoral Dissertation]. Amiens; 2015. Available from: http://www.theses.fr/2015AMIE0010


Montana State University

9. Peterson, Carla Leslie. Ant System variations with job shop scheduling.

Degree: College of Engineering, 2002, Montana State University

Subjects/Keywords: Combinatorial optimization.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Peterson, C. L. (2002). Ant System variations with job shop scheduling. (Thesis). Montana State University. Retrieved from https://scholarworks.montana.edu/xmlui/handle/1/8208

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

Peterson, Carla Leslie. “Ant System variations with job shop scheduling.” 2002. Thesis, Montana State University. Accessed February 18, 2020. https://scholarworks.montana.edu/xmlui/handle/1/8208.

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

MLA Handbook (7th Edition):

Peterson, Carla Leslie. “Ant System variations with job shop scheduling.” 2002. Web. 18 Feb 2020.

Vancouver:

Peterson CL. Ant System variations with job shop scheduling. [Internet] [Thesis]. Montana State University; 2002. [cited 2020 Feb 18]. Available from: https://scholarworks.montana.edu/xmlui/handle/1/8208.

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

Council of Science Editors:

Peterson CL. Ant System variations with job shop scheduling. [Thesis]. Montana State University; 2002. Available from: https://scholarworks.montana.edu/xmlui/handle/1/8208

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


University of Waterloo

10. Graf, Alessandra. Finding Independent Transversals Efficiently.

Degree: 2019, University of Waterloo

 Let G be a graph and (V_1,...,V_m) be a vertex partition of G. An independent transversal (IT) of G with respect to (V_1,...,V_m) is an… (more)

Subjects/Keywords: Combinatorial analysis; Mathematical optimization; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Graf, A. (2019). Finding Independent Transversals Efficiently. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14932

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

Graf, Alessandra. “Finding Independent Transversals Efficiently.” 2019. Thesis, University of Waterloo. Accessed February 18, 2020. http://hdl.handle.net/10012/14932.

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

MLA Handbook (7th Edition):

Graf, Alessandra. “Finding Independent Transversals Efficiently.” 2019. Web. 18 Feb 2020.

Vancouver:

Graf A. Finding Independent Transversals Efficiently. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/10012/14932.

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

Council of Science Editors:

Graf A. Finding Independent Transversals Efficiently. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14932

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


Cornell University

11. Davis, James. Customer Choice Models And Assortment Optimization .

Degree: 2015, Cornell University

 This thesis handles a fundamental problem in retail: given an enormous variety of products which does the retailer display to its customers? This is the… (more)

Subjects/Keywords: Revenue Management; Algorithms; Combinatorial Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Davis, J. (2015). Customer Choice Models And Assortment Optimization . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/40949

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

Davis, James. “Customer Choice Models And Assortment Optimization .” 2015. Thesis, Cornell University. Accessed February 18, 2020. http://hdl.handle.net/1813/40949.

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

MLA Handbook (7th Edition):

Davis, James. “Customer Choice Models And Assortment Optimization .” 2015. Web. 18 Feb 2020.

Vancouver:

Davis J. Customer Choice Models And Assortment Optimization . [Internet] [Thesis]. Cornell University; 2015. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/1813/40949.

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

Council of Science Editors:

Davis J. Customer Choice Models And Assortment Optimization . [Thesis]. Cornell University; 2015. Available from: http://hdl.handle.net/1813/40949

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


Rutgers University

12. Oster, Matthew R., 1983-. Two applications of combinatorial optimization.

Degree: Operations Research, 2014, Rutgers University

Subjects/Keywords: Combinatorial optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oster, Matthew R., 1. (2014). Two applications of combinatorial optimization. (Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/44189/

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

Oster, Matthew R., 1983-. “Two applications of combinatorial optimization.” 2014. Thesis, Rutgers University. Accessed February 18, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/44189/.

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

MLA Handbook (7th Edition):

Oster, Matthew R., 1983-. “Two applications of combinatorial optimization.” 2014. Web. 18 Feb 2020.

Vancouver:

Oster, Matthew R. 1. Two applications of combinatorial optimization. [Internet] [Thesis]. Rutgers University; 2014. [cited 2020 Feb 18]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/44189/.

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

Council of Science Editors:

Oster, Matthew R. 1. Two applications of combinatorial optimization. [Thesis]. Rutgers University; 2014. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/44189/

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


University of British Columbia

13. Wang, Yaoguang. Polyhedral studies on scheduling and routing problems .

Degree: 1991, University of British Columbia

 During the last decade, there have been major advances in solving a class of large-scale real world combinatorial optimization problems. Such problems are formulated as… (more)

Subjects/Keywords: Combinatorial optimization; Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, Y. (1991). Polyhedral studies on scheduling and routing problems . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/32385

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

Wang, Yaoguang. “Polyhedral studies on scheduling and routing problems .” 1991. Thesis, University of British Columbia. Accessed February 18, 2020. http://hdl.handle.net/2429/32385.

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

MLA Handbook (7th Edition):

Wang, Yaoguang. “Polyhedral studies on scheduling and routing problems .” 1991. Web. 18 Feb 2020.

Vancouver:

Wang Y. Polyhedral studies on scheduling and routing problems . [Internet] [Thesis]. University of British Columbia; 1991. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/2429/32385.

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

Council of Science Editors:

Wang Y. Polyhedral studies on scheduling and routing problems . [Thesis]. University of British Columbia; 1991. Available from: http://hdl.handle.net/2429/32385

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

14. Fink, Claudia. O problema de minimização de pilhas abertas - novas contribuições.

Degree: PhD, Ciências de Computação e Matemática Computacional, 2012, University of São Paulo

O Problema de Minimização do Número Máximo de Pilhas Abertas (MOSP, do inglês minimization of open stacks problem) é um problema de otimização combinatória da… (more)

Subjects/Keywords: Combinatorial optimization; Heuristic; Heurística; Otimização combinatória

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fink, C. (2012). O problema de minimização de pilhas abertas - novas contribuições. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19022013-084858/ ;

Chicago Manual of Style (16th Edition):

Fink, Claudia. “O problema de minimização de pilhas abertas - novas contribuições.” 2012. Doctoral Dissertation, University of São Paulo. Accessed February 18, 2020. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19022013-084858/ ;.

MLA Handbook (7th Edition):

Fink, Claudia. “O problema de minimização de pilhas abertas - novas contribuições.” 2012. Web. 18 Feb 2020.

Vancouver:

Fink C. O problema de minimização de pilhas abertas - novas contribuições. [Internet] [Doctoral dissertation]. University of São Paulo; 2012. [cited 2020 Feb 18]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19022013-084858/ ;.

Council of Science Editors:

Fink C. O problema de minimização de pilhas abertas - novas contribuições. [Doctoral Dissertation]. University of São Paulo; 2012. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19022013-084858/ ;


University of Hong Kong

15. Chen, Zhibin. On various packing and covering problems.

Degree: PhD, 2009, University of Hong Kong

published_or_final_version

Mathematics

Doctoral

Doctor of Philosophy

Advisors/Committee Members: Zang, W.

Subjects/Keywords: Combinatorial optimization.; Hypergraphs.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, Z. (2009). On various packing and covering problems. (Doctoral Dissertation). University of Hong Kong. Retrieved from Chen, Z. [陳智斌]. (2009). On various packing and covering problems. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4308552 ; http://dx.doi.org/10.5353/th_b4308552 ; http://hdl.handle.net/10722/56587

Chicago Manual of Style (16th Edition):

Chen, Zhibin. “On various packing and covering problems.” 2009. Doctoral Dissertation, University of Hong Kong. Accessed February 18, 2020. Chen, Z. [陳智斌]. (2009). On various packing and covering problems. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4308552 ; http://dx.doi.org/10.5353/th_b4308552 ; http://hdl.handle.net/10722/56587.

MLA Handbook (7th Edition):

Chen, Zhibin. “On various packing and covering problems.” 2009. Web. 18 Feb 2020.

Vancouver:

Chen Z. On various packing and covering problems. [Internet] [Doctoral dissertation]. University of Hong Kong; 2009. [cited 2020 Feb 18]. Available from: Chen, Z. [陳智斌]. (2009). On various packing and covering problems. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4308552 ; http://dx.doi.org/10.5353/th_b4308552 ; http://hdl.handle.net/10722/56587.

Council of Science Editors:

Chen Z. On various packing and covering problems. [Doctoral Dissertation]. University of Hong Kong; 2009. Available from: Chen, Z. [陳智斌]. (2009). On various packing and covering problems. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4308552 ; http://dx.doi.org/10.5353/th_b4308552 ; http://hdl.handle.net/10722/56587


University of Tasmania

16. Kelareva, Galina Vladislavovna. Development and applications of multi-layered genetic algorithms to multi-dimensional optimisation problems.

Degree: 2003, University of Tasmania

 Genetic algorithms represent a global optimisation method, imitating the principles of natural evolution: selection and survival of the fittest. Genetic algorithms operate on a randomly… (more)

Subjects/Keywords: Combinatorial optimization; Genetics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kelareva, G. V. (2003). Development and applications of multi-layered genetic algorithms to multi-dimensional optimisation problems. (Thesis). University of Tasmania. Retrieved from https://eprints.utas.edu.au/20554/7/whole_KelarevaGalinaVladislavovna2003.pdf

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

Chicago Manual of Style (16th Edition):

Kelareva, Galina Vladislavovna. “Development and applications of multi-layered genetic algorithms to multi-dimensional optimisation problems.” 2003. Thesis, University of Tasmania. Accessed February 18, 2020. https://eprints.utas.edu.au/20554/7/whole_KelarevaGalinaVladislavovna2003.pdf.

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

MLA Handbook (7th Edition):

Kelareva, Galina Vladislavovna. “Development and applications of multi-layered genetic algorithms to multi-dimensional optimisation problems.” 2003. Web. 18 Feb 2020.

Vancouver:

Kelareva GV. Development and applications of multi-layered genetic algorithms to multi-dimensional optimisation problems. [Internet] [Thesis]. University of Tasmania; 2003. [cited 2020 Feb 18]. Available from: https://eprints.utas.edu.au/20554/7/whole_KelarevaGalinaVladislavovna2003.pdf.

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

Council of Science Editors:

Kelareva GV. Development and applications of multi-layered genetic algorithms to multi-dimensional optimisation problems. [Thesis]. University of Tasmania; 2003. Available from: https://eprints.utas.edu.au/20554/7/whole_KelarevaGalinaVladislavovna2003.pdf

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


University of Hong Kong

17. Chen, Qin. Algorithms for some combinatorial optimization problems.

Degree: PhD, 2011, University of Hong Kong

published_or_final_version

Mathematics

Doctoral

Doctor of Philosophy

Advisors/Committee Members: Zang, W.

Subjects/Keywords: Algorithms.; Combinatorial optimization.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, Q. (2011). Algorithms for some combinatorial optimization problems. (Doctoral Dissertation). University of Hong Kong. Retrieved from Chen, Q. [陈琴]. (2011). Algorithms for some combinatorial optimization problems. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4658930 ; http://dx.doi.org/10.5353/th_b4658930 ; http://hdl.handle.net/10722/143221

Chicago Manual of Style (16th Edition):

Chen, Qin. “Algorithms for some combinatorial optimization problems.” 2011. Doctoral Dissertation, University of Hong Kong. Accessed February 18, 2020. Chen, Q. [陈琴]. (2011). Algorithms for some combinatorial optimization problems. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4658930 ; http://dx.doi.org/10.5353/th_b4658930 ; http://hdl.handle.net/10722/143221.

MLA Handbook (7th Edition):

Chen, Qin. “Algorithms for some combinatorial optimization problems.” 2011. Web. 18 Feb 2020.

Vancouver:

Chen Q. Algorithms for some combinatorial optimization problems. [Internet] [Doctoral dissertation]. University of Hong Kong; 2011. [cited 2020 Feb 18]. Available from: Chen, Q. [陈琴]. (2011). Algorithms for some combinatorial optimization problems. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4658930 ; http://dx.doi.org/10.5353/th_b4658930 ; http://hdl.handle.net/10722/143221.

Council of Science Editors:

Chen Q. Algorithms for some combinatorial optimization problems. [Doctoral Dissertation]. University of Hong Kong; 2011. Available from: Chen, Q. [陈琴]. (2011). Algorithms for some combinatorial optimization problems. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4658930 ; http://dx.doi.org/10.5353/th_b4658930 ; http://hdl.handle.net/10722/143221


University of Adelaide

18. Gao, Wanru. Diversity optimization and parameterized analysis of heuristic search methods for combinatorial optimization problems.

Degree: 2016, University of Adelaide

 Heuristic search algorithms belong to the most successful approaches for many combinatorial optimization problems which have wide real world applications in various areas. The heuristic… (more)

Subjects/Keywords: combinatorial optimization; diversity maximization; evolutionary computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gao, W. (2016). Diversity optimization and parameterized analysis of heuristic search methods for combinatorial optimization problems. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/103758

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

Gao, Wanru. “Diversity optimization and parameterized analysis of heuristic search methods for combinatorial optimization problems.” 2016. Thesis, University of Adelaide. Accessed February 18, 2020. http://hdl.handle.net/2440/103758.

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

MLA Handbook (7th Edition):

Gao, Wanru. “Diversity optimization and parameterized analysis of heuristic search methods for combinatorial optimization problems.” 2016. Web. 18 Feb 2020.

Vancouver:

Gao W. Diversity optimization and parameterized analysis of heuristic search methods for combinatorial optimization problems. [Internet] [Thesis]. University of Adelaide; 2016. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/2440/103758.

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

Council of Science Editors:

Gao W. Diversity optimization and parameterized analysis of heuristic search methods for combinatorial optimization problems. [Thesis]. University of Adelaide; 2016. Available from: http://hdl.handle.net/2440/103758

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


University of Waterloo

19. Emami Taba, Mahsa Sadat. Solving Traveling Salesman Problem With a non-complete Graph.

Degree: 2010, University of Waterloo

 One of the simplest, but still NP-hard, routing problems is the Traveling Salesman Problem (TSP). In the TSP, one is given a set of cities… (more)

Subjects/Keywords: Traveling Salesman Problem (TSP); Combinatorial Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Emami Taba, M. S. (2010). Solving Traveling Salesman Problem With a non-complete Graph. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4906

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

Emami Taba, Mahsa Sadat. “Solving Traveling Salesman Problem With a non-complete Graph.” 2010. Thesis, University of Waterloo. Accessed February 18, 2020. http://hdl.handle.net/10012/4906.

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

MLA Handbook (7th Edition):

Emami Taba, Mahsa Sadat. “Solving Traveling Salesman Problem With a non-complete Graph.” 2010. Web. 18 Feb 2020.

Vancouver:

Emami Taba MS. Solving Traveling Salesman Problem With a non-complete Graph. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/10012/4906.

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

Council of Science Editors:

Emami Taba MS. Solving Traveling Salesman Problem With a non-complete Graph. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/4906

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


ETH Zürich

20. Paccagnan, Dario. Distributed Control and Game Design: From Strategic Agents to Programmable Machines.

Degree: 2018, ETH Zürich

 Large scale systems are forecasted to greatly impact our future lives thanks to their wide ranging applications including cooperative robotics, mobility on demand, resource and… (more)

Subjects/Keywords: Multiagent Systems; Game Theory; Combinatorial Optimization; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Paccagnan, D. (2018). Distributed Control and Game Design: From Strategic Agents to Programmable Machines. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/314981

Chicago Manual of Style (16th Edition):

Paccagnan, Dario. “Distributed Control and Game Design: From Strategic Agents to Programmable Machines.” 2018. Doctoral Dissertation, ETH Zürich. Accessed February 18, 2020. http://hdl.handle.net/20.500.11850/314981.

MLA Handbook (7th Edition):

Paccagnan, Dario. “Distributed Control and Game Design: From Strategic Agents to Programmable Machines.” 2018. Web. 18 Feb 2020.

Vancouver:

Paccagnan D. Distributed Control and Game Design: From Strategic Agents to Programmable Machines. [Internet] [Doctoral dissertation]. ETH Zürich; 2018. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/20.500.11850/314981.

Council of Science Editors:

Paccagnan D. Distributed Control and Game Design: From Strategic Agents to Programmable Machines. [Doctoral Dissertation]. ETH Zürich; 2018. Available from: http://hdl.handle.net/20.500.11850/314981


Florida Atlantic University

21. Santos, Radleigh G. A novel optimization algorithm and other techniques in medicinal chemistry.

Degree: PhD, 2012, Florida Atlantic University

Summary: In this dissertation we will present a stochastic optimization algorithm and use it and other mathematical techniques to tackle problems arising in medicinal chemistry.… (more)

Subjects/Keywords: Drugs – Design – Mathematical models; Combinatorial optimization; Combinatorial chemistry; Genetic algorithms; Mathematical optimization; Stochastic processes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Santos, R. G. (2012). A novel optimization algorithm and other techniques in medicinal chemistry. (Doctoral Dissertation). Florida Atlantic University. Retrieved from http://purl.flvc.org/FAU/3352830

Chicago Manual of Style (16th Edition):

Santos, Radleigh G. “A novel optimization algorithm and other techniques in medicinal chemistry.” 2012. Doctoral Dissertation, Florida Atlantic University. Accessed February 18, 2020. http://purl.flvc.org/FAU/3352830.

MLA Handbook (7th Edition):

Santos, Radleigh G. “A novel optimization algorithm and other techniques in medicinal chemistry.” 2012. Web. 18 Feb 2020.

Vancouver:

Santos RG. A novel optimization algorithm and other techniques in medicinal chemistry. [Internet] [Doctoral dissertation]. Florida Atlantic University; 2012. [cited 2020 Feb 18]. Available from: http://purl.flvc.org/FAU/3352830.

Council of Science Editors:

Santos RG. A novel optimization algorithm and other techniques in medicinal chemistry. [Doctoral Dissertation]. Florida Atlantic University; 2012. Available from: http://purl.flvc.org/FAU/3352830

22. Muller, Theodorus Ernst. A comparison of structural optimization techniques with extension towards multi-objective problems.

Degree: MEng, Civil Engineering, 2017, Stellenbosch University

ENGLISH ABSTRACT: Structural optimization is becoming an integral part of the modern structural design process in the search to yield more economical structures. The optimization(more)

Subjects/Keywords: Truss structures; UCTD; Structural optimization; Genetic algorithms; Combinatorial optimization; Structural frames

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Muller, T. E. (2017). A comparison of structural optimization techniques with extension towards multi-objective problems. (Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/102719

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

Muller, Theodorus Ernst. “A comparison of structural optimization techniques with extension towards multi-objective problems.” 2017. Thesis, Stellenbosch University. Accessed February 18, 2020. http://hdl.handle.net/10019.1/102719.

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

MLA Handbook (7th Edition):

Muller, Theodorus Ernst. “A comparison of structural optimization techniques with extension towards multi-objective problems.” 2017. Web. 18 Feb 2020.

Vancouver:

Muller TE. A comparison of structural optimization techniques with extension towards multi-objective problems. [Internet] [Thesis]. Stellenbosch University; 2017. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/10019.1/102719.

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

Council of Science Editors:

Muller TE. A comparison of structural optimization techniques with extension towards multi-objective problems. [Thesis]. Stellenbosch University; 2017. Available from: http://hdl.handle.net/10019.1/102719

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


Univerzitet u Beogradu

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

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

Racunarstvo - Optimizacija / Computer Science - Optimization

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

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

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

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

Council of Science Editors:

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

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


University of Wollongong

24. Sharafi, Pezhman. Cost optimization of the preliminary design layout of reinforced concrete framed buildings.

Degree: PhD, 2013, University of Wollongong

  This thesis proposes an explicit methodology for optimising the cost of the preliminary design layout of framed Reinforced Concrete (RC) buildings. The design of… (more)

Subjects/Keywords: cost optimization; reinforced concrete; conceptual design; framed buildings; combinatorial optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sharafi, P. (2013). Cost optimization of the preliminary design layout of reinforced concrete framed buildings. (Doctoral Dissertation). University of Wollongong. Retrieved from 010303 Optimisation, 080202 Applied Discrete Mathematics, 090506 Structural Engineering, 120405 Models of Engineering Design ; https://ro.uow.edu.au/theses/3916

Chicago Manual of Style (16th Edition):

Sharafi, Pezhman. “Cost optimization of the preliminary design layout of reinforced concrete framed buildings.” 2013. Doctoral Dissertation, University of Wollongong. Accessed February 18, 2020. 010303 Optimisation, 080202 Applied Discrete Mathematics, 090506 Structural Engineering, 120405 Models of Engineering Design ; https://ro.uow.edu.au/theses/3916.

MLA Handbook (7th Edition):

Sharafi, Pezhman. “Cost optimization of the preliminary design layout of reinforced concrete framed buildings.” 2013. Web. 18 Feb 2020.

Vancouver:

Sharafi P. Cost optimization of the preliminary design layout of reinforced concrete framed buildings. [Internet] [Doctoral dissertation]. University of Wollongong; 2013. [cited 2020 Feb 18]. Available from: 010303 Optimisation, 080202 Applied Discrete Mathematics, 090506 Structural Engineering, 120405 Models of Engineering Design ; https://ro.uow.edu.au/theses/3916.

Council of Science Editors:

Sharafi P. Cost optimization of the preliminary design layout of reinforced concrete framed buildings. [Doctoral Dissertation]. University of Wollongong; 2013. Available from: 010303 Optimisation, 080202 Applied Discrete Mathematics, 090506 Structural Engineering, 120405 Models of Engineering Design ; https://ro.uow.edu.au/theses/3916


Rutgers University

25. Chou, Chun-An. Mathematical optimization methods for clustering and classification with biological and medical applications.

Degree: Industrial and Systems Engineering, 2011, Rutgers University

Subjects/Keywords: Combinatorial optimization; Mathematical optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chou, C. (2011). Mathematical optimization methods for clustering and classification with biological and medical applications. (Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063358

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

Chou, Chun-An. “Mathematical optimization methods for clustering and classification with biological and medical applications.” 2011. Thesis, Rutgers University. Accessed February 18, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063358.

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

MLA Handbook (7th Edition):

Chou, Chun-An. “Mathematical optimization methods for clustering and classification with biological and medical applications.” 2011. Web. 18 Feb 2020.

Vancouver:

Chou C. Mathematical optimization methods for clustering and classification with biological and medical applications. [Internet] [Thesis]. Rutgers University; 2011. [cited 2020 Feb 18]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063358.

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

Council of Science Editors:

Chou C. Mathematical optimization methods for clustering and classification with biological and medical applications. [Thesis]. Rutgers University; 2011. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063358

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


Clemson University

26. Holzmann, Timothy. Network Interdiction under Uncertainty.

Degree: PhD, Industrial Engineering, 2019, Clemson University

  We consider variants to one of the most common network interdiction formulations: the shortest path interdiction problem. This problem involves leader and a follower… (more)

Subjects/Keywords: Combinatorial Optimization; Industrial Engineering; Mathematical Programming; Multiobjective Optimization; Network Interdiction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Holzmann, T. (2019). Network Interdiction under Uncertainty. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/2437

Chicago Manual of Style (16th Edition):

Holzmann, Timothy. “Network Interdiction under Uncertainty.” 2019. Doctoral Dissertation, Clemson University. Accessed February 18, 2020. https://tigerprints.clemson.edu/all_dissertations/2437.

MLA Handbook (7th Edition):

Holzmann, Timothy. “Network Interdiction under Uncertainty.” 2019. Web. 18 Feb 2020.

Vancouver:

Holzmann T. Network Interdiction under Uncertainty. [Internet] [Doctoral dissertation]. Clemson University; 2019. [cited 2020 Feb 18]. Available from: https://tigerprints.clemson.edu/all_dissertations/2437.

Council of Science Editors:

Holzmann T. Network Interdiction under Uncertainty. [Doctoral Dissertation]. Clemson University; 2019. Available from: https://tigerprints.clemson.edu/all_dissertations/2437


Georgia Tech

27. Torrico Palacios, Alfredo Ignacio. Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization.

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

 Resource allocation and subset selection are two relevant classes of problems in the core of combinatorial optimization. Over the past decade, there has been an… (more)

Subjects/Keywords: Combinatorial optimization; Online optimization; Online bipartite matching; Constrained submodular maximization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Torrico Palacios, A. I. (2019). Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/61720

Chicago Manual of Style (16th Edition):

Torrico Palacios, Alfredo Ignacio. “Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization.” 2019. Doctoral Dissertation, Georgia Tech. Accessed February 18, 2020. http://hdl.handle.net/1853/61720.

MLA Handbook (7th Edition):

Torrico Palacios, Alfredo Ignacio. “Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization.” 2019. Web. 18 Feb 2020.

Vancouver:

Torrico Palacios AI. Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/1853/61720.

Council of Science Editors:

Torrico Palacios AI. Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/61720


University of Iowa

28. Mirghorbani Nokandeh, Seyed Mohammad S. Graph-theoretic studies of combinatorial optimization problems.

Degree: PhD, Industrial Engineering, 2013, University of Iowa

  Graph theory is fascinating branch of math. Leonhard Euler introduced the concept of Graph Theory in his paper about the seven bridges of Konigsberg… (more)

Subjects/Keywords: combinatorial optimization; graph theory; maximum clique problem; risk optimization; Industrial Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mirghorbani Nokandeh, S. M. S. (2013). Graph-theoretic studies of combinatorial optimization problems. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/4698

Chicago Manual of Style (16th Edition):

Mirghorbani Nokandeh, Seyed Mohammad S. “Graph-theoretic studies of combinatorial optimization problems.” 2013. Doctoral Dissertation, University of Iowa. Accessed February 18, 2020. https://ir.uiowa.edu/etd/4698.

MLA Handbook (7th Edition):

Mirghorbani Nokandeh, Seyed Mohammad S. “Graph-theoretic studies of combinatorial optimization problems.” 2013. Web. 18 Feb 2020.

Vancouver:

Mirghorbani Nokandeh SMS. Graph-theoretic studies of combinatorial optimization problems. [Internet] [Doctoral dissertation]. University of Iowa; 2013. [cited 2020 Feb 18]. Available from: https://ir.uiowa.edu/etd/4698.

Council of Science Editors:

Mirghorbani Nokandeh SMS. Graph-theoretic studies of combinatorial optimization problems. [Doctoral Dissertation]. University of Iowa; 2013. Available from: https://ir.uiowa.edu/etd/4698

29. Simão, Juliana Barby. Minimização de funções submodulares.

Degree: Mestrado, Ciência da Computação, 2009, University of São Paulo

Funções submodulares aparecem naturalmente em diversas áreas, tais como probabilidade, geometria e otimização combinatória. Pode-se dizer que o papel desempenhado por essas funções em otimização… (more)

Subjects/Keywords: algoritmos combinatórios; combinatorial algorithms; combinatorial optimization; funções submodulares; otimização combinatória; submodular functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Simão, J. B. (2009). Minimização de funções submodulares. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-03112010-231536/ ;

Chicago Manual of Style (16th Edition):

Simão, Juliana Barby. “Minimização de funções submodulares.” 2009. Masters Thesis, University of São Paulo. Accessed February 18, 2020. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-03112010-231536/ ;.

MLA Handbook (7th Edition):

Simão, Juliana Barby. “Minimização de funções submodulares.” 2009. Web. 18 Feb 2020.

Vancouver:

Simão JB. Minimização de funções submodulares. [Internet] [Masters thesis]. University of São Paulo; 2009. [cited 2020 Feb 18]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-03112010-231536/ ;.

Council of Science Editors:

Simão JB. Minimização de funções submodulares. [Masters Thesis]. University of São Paulo; 2009. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-03112010-231536/ ;


University of Toronto

30. Michael, Mark. Generalized Combinatorial Auction for Mixed Integer Linear Programming.

Degree: 2014, University of Toronto

Mixed integer linear programming is an invaluable tool for solving some of the toughest problems in operations research. Since the integer nature of these problems… (more)

Subjects/Keywords: column generation; combinatorial auctions; combinatorial optimization; integer programming; linear programming; mixed integer programming; 0796

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Michael, M. (2014). Generalized Combinatorial Auction for Mixed Integer Linear Programming. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/68562

Chicago Manual of Style (16th Edition):

Michael, Mark. “Generalized Combinatorial Auction for Mixed Integer Linear Programming.” 2014. Masters Thesis, University of Toronto. Accessed February 18, 2020. http://hdl.handle.net/1807/68562.

MLA Handbook (7th Edition):

Michael, Mark. “Generalized Combinatorial Auction for Mixed Integer Linear Programming.” 2014. Web. 18 Feb 2020.

Vancouver:

Michael M. Generalized Combinatorial Auction for Mixed Integer Linear Programming. [Internet] [Masters thesis]. University of Toronto; 2014. [cited 2020 Feb 18]. Available from: http://hdl.handle.net/1807/68562.

Council of Science Editors:

Michael M. Generalized Combinatorial Auction for Mixed Integer Linear Programming. [Masters Thesis]. University of Toronto; 2014. Available from: http://hdl.handle.net/1807/68562

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

.