Advanced search options

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

You searched for `subject:(combinatorial optimization)`

.
Showing records 1 – 30 of
506 total matches.

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

Search Limiters

Dates

- 2016 – 2020 (135)
- 2011 – 2015 (190)
- 2006 – 2010 (128)
- 2001 – 2005 (46)
- 1996 – 2000 (18)

Universities

Department

Degrees

- Docteur es (102)
- PhD (91)
- Mestrado (16)
- MS (14)

Languages

- English (249)
- Portuguese (73)
- French (55)
- Greek (16)

▼ Search Limiters

University of Waterloo

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

Degree: 2013, University of Waterloo

URL: http://hdl.handle.net/10012/7812

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

❌

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

APA (6^{th} 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 (16^{th} 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 August 08, 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 (7^{th} Edition):

de Carli Silva, Marcel Kenji. “Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality.” 2013. Web. 08 Aug 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 Aug 08]. 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

Not specified: Masters Thesis or Doctoral Dissertation

Montana State University

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

Degree: College of Engineering, 2002, Montana State University

URL: https://scholarworks.montana.edu/xmlui/handle/1/8208

Subjects/Keywords: Combinatorial optimization.

Record Details Similar Records

❌

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

►

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

❌

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

APA (6^{th} 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 (16^{th} 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 August 08, 2020. http://www.theses.fr/2015AMIE0010.

MLA Handbook (7^{th} 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. 08 Aug 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 Aug 08]. 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

University of Waterloo

4. Graf, Alessandra. Finding Independent Transversals Efficiently.

Degree: 2019, University of Waterloo

URL: http://hdl.handle.net/10012/14932

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

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Graf, Alessandra. “Finding Independent Transversals Efficiently.” 2019. Web. 08 Aug 2020.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Cornell University

5.
Davis, James.
Customer Choice Models And Assortment * Optimization*
.

Degree: 2015, Cornell University

URL: http://hdl.handle.net/1813/40949

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

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Davis, James. “Customer Choice Models And Assortment Optimization .” 2015. Web. 08 Aug 2020.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

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

Degree: Operations Research, 2014, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/44189/

Subjects/Keywords: Combinatorial optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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/

Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

7.
-0985-2237.
*Combinatorial**optimization* for graphical structures in machine learning.

Degree: PhD, Electrical and Computer Engineering, 2020, University of Texas – Austin

URL: http://dx.doi.org/10.26153/tsw/8146

► Graphs are an essential topic in machine learning. In this proposal, we explore problems in graphical models (where a probability distribution has conditional independencies specified…
(more)

Subjects/Keywords: Combinatorial optimization; Machine learning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

-0985-2237. (2020). Combinatorial optimization for graphical structures in machine learning. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/8146

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

Author name may be incomplete

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

-0985-2237. “Combinatorial optimization for graphical structures in machine learning.” 2020. Doctoral Dissertation, University of Texas – Austin. Accessed August 08, 2020. http://dx.doi.org/10.26153/tsw/8146.

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

Author name may be incomplete

MLA Handbook (7^{th} Edition):

-0985-2237. “Combinatorial optimization for graphical structures in machine learning.” 2020. Web. 08 Aug 2020.

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

Author name may be incomplete

Vancouver:

-0985-2237. Combinatorial optimization for graphical structures in machine learning. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2020. [cited 2020 Aug 08]. Available from: http://dx.doi.org/10.26153/tsw/8146.

Author name may be incomplete

Council of Science Editors:

-0985-2237. Combinatorial optimization for graphical structures in machine learning. [Doctoral Dissertation]. University of Texas – Austin; 2020. Available from: http://dx.doi.org/10.26153/tsw/8146

Author name may be incomplete

University of Hong Kong

8. 赵秋兰. Ranking tournaments with no errors.

Degree: 2017, University of Hong Kong

URL: http://hdl.handle.net/10722/249816

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

❌

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

APA (6^{th} Edition):

赵秋兰. (2017). Ranking tournaments with no errors. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/249816

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

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

赵秋兰. “Ranking tournaments with no errors.” 2017. Thesis, University of Hong Kong. Accessed August 08, 2020. http://hdl.handle.net/10722/249816.

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

赵秋兰. “Ranking tournaments with no errors.” 2017. Web. 08 Aug 2020.

Author name may be incomplete

Vancouver:

赵秋兰. Ranking tournaments with no errors. [Internet] [Thesis]. University of Hong Kong; 2017. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10722/249816.

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

赵秋兰. Ranking tournaments with no errors. [Thesis]. University of Hong Kong; 2017. Available from: http://hdl.handle.net/10722/249816

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

University of Hong Kong

9.
Xiao, Han.
Some polyhedral results in
*combinatorial* * optimization*.

Degree: 2016, University of Hong Kong

URL: http://hdl.handle.net/10722/233945

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

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

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

Xiao, Han. “Some polyhedral results in combinatorial optimization.” 2016. Thesis, University of Hong Kong. Accessed August 08, 2020. http://hdl.handle.net/10722/233945.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Xiao, Han. “Some polyhedral results in combinatorial optimization.” 2016. Web. 08 Aug 2020.

Vancouver:

Xiao H. Some polyhedral results in combinatorial optimization. [Internet] [Thesis]. University of Hong Kong; 2016. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10722/233945.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Hong Kong

10. 陈程. Multicommodity flows : integrality, duality, and feasibility.

Degree: 2016, University of Hong Kong

URL: http://hdl.handle.net/10722/235912

Subjects/Keywords: Combinatorial optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

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

陈程. “Multicommodity flows : integrality, duality, and feasibility.” 2016. Thesis, University of Hong Kong. Accessed August 08, 2020. http://hdl.handle.net/10722/235912.

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

陈程. “Multicommodity flows : integrality, duality, and feasibility.” 2016. Web. 08 Aug 2020.

Author name may be incomplete

Vancouver:

陈程. Multicommodity flows : integrality, duality, and feasibility. [Internet] [Thesis]. University of Hong Kong; 2016. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10722/235912.

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

University of British Columbia

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

Degree: 1991, University of British Columbia

URL: http://hdl.handle.net/2429/32385

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

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Hong Kong

12. 陳智斌. On various packing and covering problems.

Degree: 2009, University of Hong Kong

URL: http://hdl.handle.net/10722/56587

Subjects/Keywords: Combinatorial optimization.; Hypergraphs.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

陳智斌. (2009). On various packing and covering problems. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/56587

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

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

陳智斌. “On various packing and covering problems.” 2009. Thesis, University of Hong Kong. Accessed August 08, 2020. http://hdl.handle.net/10722/56587.

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

陳智斌. “On various packing and covering problems.” 2009. Web. 08 Aug 2020.

Author name may be incomplete

Vancouver:

陳智斌. On various packing and covering problems. [Internet] [Thesis]. University of Hong Kong; 2009. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10722/56587.

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

陳智斌. On various packing and covering problems. [Thesis]. University of Hong Kong; 2009. Available from: http://hdl.handle.net/10722/56587

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

University of Hong Kong

13.
陈琴.
Algorithms for some
*combinatorial* *optimization* problems.

Degree: 2011, University of Hong Kong

URL: http://hdl.handle.net/10722/143221

Subjects/Keywords: Algorithms.; Combinatorial optimization.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

陈琴. (2011). Algorithms for some combinatorial optimization problems. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/143221

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

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

陈琴. “Algorithms for some combinatorial optimization problems.” 2011. Thesis, University of Hong Kong. Accessed August 08, 2020. http://hdl.handle.net/10722/143221.

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

陈琴. “Algorithms for some combinatorial optimization problems.” 2011. Web. 08 Aug 2020.

Author name may be incomplete

Vancouver:

陈琴. Algorithms for some combinatorial optimization problems. [Internet] [Thesis]. University of Hong Kong; 2011. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10722/143221.

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

陈琴. Algorithms for some combinatorial optimization problems. [Thesis]. University of Hong Kong; 2011. Available from: http://hdl.handle.net/10722/143221

Author name may be incomplete

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

URL: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19022013-084858/ ;

►

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

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Fink, Claudia. “O problema de minimização de pilhas abertas - novas contribuições.” 2012. Web. 08 Aug 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 Aug 08]. 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 Tasmania

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

Degree: 2003, University of Tasmania

URL: https://eprints.utas.edu.au/20554/7/whole_KelarevaGalinaVladislavovna2003.pdf

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

❌

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kelareva, Galina Vladislavovna. “Development and applications of multi-layered genetic algorithms to multi-dimensional optimisation problems.” 2003. Web. 08 Aug 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 Aug 08]. Available from: https://eprints.utas.edu.au/20554/7/whole_KelarevaGalinaVladislavovna2003.pdf.

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

Not specified: Masters Thesis or Doctoral Dissertation

Massey University

16. Liu, Tong. Improved K-means clustering algorithms : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science, Massey University .

Degree: 2020, Massey University

URL: http://hdl.handle.net/10179/15384

► K-means clustering algorithm is designed to divide the samples into subsets with the goal that maximizes the intra-subset similarity and inter-subset dissimilarity where the similarity…
(more)

Subjects/Keywords: Cluster analysis; Computer algorithms; Combinatorial optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, T. (2020). Improved K-means clustering algorithms : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science, Massey University . (Thesis). Massey University. Retrieved from http://hdl.handle.net/10179/15384

Not specified: Masters Thesis or Doctoral Dissertation

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

Liu, Tong. “Improved K-means clustering algorithms : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science, Massey University .” 2020. Thesis, Massey University. Accessed August 08, 2020. http://hdl.handle.net/10179/15384.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Liu, Tong. “Improved K-means clustering algorithms : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science, Massey University .” 2020. Web. 08 Aug 2020.

Vancouver:

Liu T. Improved K-means clustering algorithms : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science, Massey University . [Internet] [Thesis]. Massey University; 2020. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10179/15384.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu T. Improved K-means clustering algorithms : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science, Massey University . [Thesis]. Massey University; 2020. Available from: http://hdl.handle.net/10179/15384

Not specified: Masters Thesis or Doctoral Dissertation

University of Adelaide

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

Degree: 2016, University of Adelaide

URL: http://hdl.handle.net/2440/103758

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

❌

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gao, Wanru. “Diversity optimization and parameterized analysis of heuristic search methods for combinatorial optimization problems.” 2016. Web. 08 Aug 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 Aug 08]. Available from: http://hdl.handle.net/2440/103758.

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

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

Degree: 2010, University of Waterloo

URL: http://hdl.handle.net/10012/4906

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

❌

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Ottawa

19. Schultz Xavier da Silveira, Luís Fernando. Turán Triangles, Cell Covers, Road Placement and Train Scheduling .

Degree: 2020, University of Ottawa

URL: http://hdl.handle.net/10393/40569

► In this doctoral thesis, four questions related to computational geometry are considered. The first is an extremal combinatorics question regarding triangles with vertices taken from…
(more)

Subjects/Keywords: Computational Geometry; Combinatorial Optimization; Approximation Algorithms; Scheduling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Schultz Xavier da Silveira, L. F. (2020). Turán Triangles, Cell Covers, Road Placement and Train Scheduling . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/40569

Not specified: Masters Thesis or Doctoral Dissertation

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

Schultz Xavier da Silveira, Luís Fernando. “Turán Triangles, Cell Covers, Road Placement and Train Scheduling .” 2020. Thesis, University of Ottawa. Accessed August 08, 2020. http://hdl.handle.net/10393/40569.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Schultz Xavier da Silveira, Luís Fernando. “Turán Triangles, Cell Covers, Road Placement and Train Scheduling .” 2020. Web. 08 Aug 2020.

Vancouver:

Schultz Xavier da Silveira LF. Turán Triangles, Cell Covers, Road Placement and Train Scheduling . [Internet] [Thesis]. University of Ottawa; 2020. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10393/40569.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schultz Xavier da Silveira LF. Turán Triangles, Cell Covers, Road Placement and Train Scheduling . [Thesis]. University of Ottawa; 2020. Available from: http://hdl.handle.net/10393/40569

Not specified: Masters Thesis or Doctoral Dissertation

Virginia Tech

20. Lahn, Nathaniel Adam. A Separator-Based Framework for Graph Matching Problems.

Degree: PhD, Computer Science and Applications, 2020, Virginia Tech

URL: http://hdl.handle.net/10919/98618

► Assume we are given a list of objects, and a list of compatible pairs of these objects. A matching consists of a chosen subset of…
(more)

Subjects/Keywords: Matching; graphs; graph separators; combinatorial optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lahn, N. A. (2020). A Separator-Based Framework for Graph Matching Problems. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/98618

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

Lahn, Nathaniel Adam. “A Separator-Based Framework for Graph Matching Problems.” 2020. Doctoral Dissertation, Virginia Tech. Accessed August 08, 2020. http://hdl.handle.net/10919/98618.

MLA Handbook (7^{th} Edition):

Lahn, Nathaniel Adam. “A Separator-Based Framework for Graph Matching Problems.” 2020. Web. 08 Aug 2020.

Vancouver:

Lahn NA. A Separator-Based Framework for Graph Matching Problems. [Internet] [Doctoral dissertation]. Virginia Tech; 2020. [cited 2020 Aug 08]. Available from: http://hdl.handle.net/10919/98618.

Council of Science Editors:

Lahn NA. A Separator-Based Framework for Graph Matching Problems. [Doctoral Dissertation]. Virginia Tech; 2020. Available from: http://hdl.handle.net/10919/98618

University of Stirling

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

Degree: PhD, 1978, University of Stirling

URL: http://hdl.handle.net/1893/3453

► 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: 519; Combinatorial optimization

Record Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Hinxman AI. The use of geometric information in heuristic optimization. [Internet] [Doctoral dissertation]. University of Stirling; 1978. [cited 2020 Aug 08]. 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

Florida Atlantic University

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

Degree: PhD, 2012, Florida Atlantic University

URL: http://purl.flvc.org/FAU/3352830

►

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

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Santos RG. A novel optimization algorithm and other techniques in medicinal chemistry. [Internet] [Doctoral dissertation]. Florida Atlantic University; 2012. [cited 2020 Aug 08]. 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

University of Wollongong

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

Degree: Doctor of Philosophy, 2013, University of Wollongong

URL: 010303 Optimisation, 080202 Applied Discrete Mathematics, 090506 Structural Engineering, 120405 Models of Engineering Design ; https://ro.uow.edu.au/theses/3916

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

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Sharafi, Pezhman. “Cost optimization of the preliminary design layout of reinforced concrete framed buildings.” 2013. Web. 08 Aug 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 Aug 08]. 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

Univerzitet u Beogradu

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

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

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

►

Racunarstvo - Optimizacija / Computer Science - *Optimization*

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Dražić, Zorica M., 1983-. “Modifikacije metode promenljivih okolina i njihove primene za rešavanje problema raspoređivanja prenosa datoteka.” 2017. Web. 08 Aug 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 Aug 08]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15561/bdef:Content/get.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Not specified: Masters Thesis or Doctoral Dissertation

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

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063358

Subjects/Keywords: Combinatorial optimization; Mathematical optimization

Record Details Similar Records

❌

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Iowa

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

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

URL: https://ir.uiowa.edu/etd/4698

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

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Mirghorbani Nokandeh SMS. Graph-theoretic studies of combinatorial optimization problems. [Internet] [Doctoral dissertation]. University of Iowa; 2013. [cited 2020 Aug 08]. 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

Clemson University

27. Holzmann, Timothy. Network Interdiction under Uncertainty.

Degree: PhD, Industrial Engineering, 2019, Clemson University

URL: https://tigerprints.clemson.edu/all_dissertations/2437

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

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Holzmann, Timothy. “Network Interdiction under Uncertainty.” 2019. Web. 08 Aug 2020.

Vancouver:

Holzmann T. Network Interdiction under Uncertainty. [Internet] [Doctoral dissertation]. Clemson University; 2019. [cited 2020 Aug 08]. 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

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

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

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

❌

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

APA (6^{th} 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 (16^{th} 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 August 08, 2020. http://hdl.handle.net/1853/61720.

MLA Handbook (7^{th} Edition):

Torrico Palacios, Alfredo Ignacio. “Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization.” 2019. Web. 08 Aug 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 Aug 08]. 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

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

Degree: MEng, Civil Engineering, 2017, Stellenbosch University

URL: http://hdl.handle.net/10019.1/102719

►

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

❌

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

URL: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-03112010-231536/ ;

►

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

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Simão JB. Minimização de funções submodulares. [Internet] [Masters thesis]. University of São Paulo; 2009. [cited 2020 Aug 08]. 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/ ;