Advanced search options

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

You searched for `subject:(set covering)`

.
Showing records 1 – 30 of
30 total matches.

▼ Search Limiters

University of Windsor

1. Singh, Harjeet. Performance Evaluation of Weighted Greedy Algorithm in Resource Management.

Degree: MS, Computer Science, 2018, University of Windsor

URL: https://scholar.uwindsor.ca/etd/7397

► *Set* *covering* is a well-studied classical problem with many applications across different fields. More recent work on this problem has taken into account the parallel…
(more)

Subjects/Keywords: big data; set covering algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Singh, H. (2018). Performance Evaluation of Weighted Greedy Algorithm in Resource Management. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/7397

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

Singh, Harjeet. “Performance Evaluation of Weighted Greedy Algorithm in Resource Management.” 2018. Masters Thesis, University of Windsor. Accessed October 31, 2020. https://scholar.uwindsor.ca/etd/7397.

MLA Handbook (7^{th} Edition):

Singh, Harjeet. “Performance Evaluation of Weighted Greedy Algorithm in Resource Management.” 2018. Web. 31 Oct 2020.

Vancouver:

Singh H. Performance Evaluation of Weighted Greedy Algorithm in Resource Management. [Internet] [Masters thesis]. University of Windsor; 2018. [cited 2020 Oct 31]. Available from: https://scholar.uwindsor.ca/etd/7397.

Council of Science Editors:

Singh H. Performance Evaluation of Weighted Greedy Algorithm in Resource Management. [Masters Thesis]. University of Windsor; 2018. Available from: https://scholar.uwindsor.ca/etd/7397

Universidade Nova

2.
Buezas, David.
Constraint-based modeling of minimum *set* *covering*: application to species differentation.

Degree: 2011, Universidade Nova

URL: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/6158

►

Work presented in the context of the European Master in Computational Logics, as partial requisit for the graduation as Master in Computational Logics

A large… (more)

Subjects/Keywords: Minimum set covering; Enzymes; Species differentiation; Constraints

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Buezas, D. (2011). Constraint-based modeling of minimum set covering: application to species differentation. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/6158

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

Buezas, David. “Constraint-based modeling of minimum set covering: application to species differentation.” 2011. Thesis, Universidade Nova. Accessed October 31, 2020. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/6158.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Buezas, David. “Constraint-based modeling of minimum set covering: application to species differentation.” 2011. Web. 31 Oct 2020.

Vancouver:

Buezas D. Constraint-based modeling of minimum set covering: application to species differentation. [Internet] [Thesis]. Universidade Nova; 2011. [cited 2020 Oct 31]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/6158.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Buezas D. Constraint-based modeling of minimum set covering: application to species differentation. [Thesis]. Universidade Nova; 2011. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/6158

Not specified: Masters Thesis or Doctoral Dissertation

Rice University

3. Arellano, John David. Algorithms to Find the Girth and Cogirth of a Linear Matroid.

Degree: PhD, Engineering, 2014, Rice University

URL: http://hdl.handle.net/1911/87699

► In this thesis, I present algorithms to find the cogirth and girth, the cardinality of the smallest cocircuit and circuit respectively, of a linear matroid.…
(more)

Subjects/Keywords: set covering; linear matroid; cogirth; girth

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Arellano, J. D. (2014). Algorithms to Find the Girth and Cogirth of a Linear Matroid. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/87699

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

Arellano, John David. “Algorithms to Find the Girth and Cogirth of a Linear Matroid.” 2014. Doctoral Dissertation, Rice University. Accessed October 31, 2020. http://hdl.handle.net/1911/87699.

MLA Handbook (7^{th} Edition):

Arellano, John David. “Algorithms to Find the Girth and Cogirth of a Linear Matroid.” 2014. Web. 31 Oct 2020.

Vancouver:

Arellano JD. Algorithms to Find the Girth and Cogirth of a Linear Matroid. [Internet] [Doctoral dissertation]. Rice University; 2014. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/1911/87699.

Council of Science Editors:

Arellano JD. Algorithms to Find the Girth and Cogirth of a Linear Matroid. [Doctoral Dissertation]. Rice University; 2014. Available from: http://hdl.handle.net/1911/87699

Indian Institute of Science

4.
Datta Krupa, R.
Generalization of Hitting, *Covering* and Packing Problems on Intervals.

Degree: MSc Engg, Faculty of Engineering, 2018, Indian Institute of Science

URL: http://etd.iisc.ac.in/handle/2005/3628

► Interval graphs are well studied structures. Intervals can represent resources like jobs to be sched-uled. Finding maximum independent *set* in interval graphs would correspond to…
(more)

Subjects/Keywords: Geometric Hitting Problem; Geometric Covering Problem; Geometric Packing Problem; Hitting Set; Covering Set; Pack Points; Interval Graphs; k-pack Points; Demand-hitting Problem; Demand-covering Problem; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Datta Krupa, R. (2018). Generalization of Hitting, Covering and Packing Problems on Intervals. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3628

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

Datta Krupa, R. “Generalization of Hitting, Covering and Packing Problems on Intervals.” 2018. Masters Thesis, Indian Institute of Science. Accessed October 31, 2020. http://etd.iisc.ac.in/handle/2005/3628.

MLA Handbook (7^{th} Edition):

Datta Krupa, R. “Generalization of Hitting, Covering and Packing Problems on Intervals.” 2018. Web. 31 Oct 2020.

Vancouver:

Datta Krupa R. Generalization of Hitting, Covering and Packing Problems on Intervals. [Internet] [Masters thesis]. Indian Institute of Science; 2018. [cited 2020 Oct 31]. Available from: http://etd.iisc.ac.in/handle/2005/3628.

Council of Science Editors:

Datta Krupa R. Generalization of Hitting, Covering and Packing Problems on Intervals. [Masters Thesis]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3628

University of Ottawa

5.
Maltais, Elizabeth Jane.
Graph-dependent *Covering* Arrays and LYM Inequalities
.

Degree: 2016, University of Ottawa

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

► The problems we study in this thesis are all related to *covering* arrays. *Covering* arrays are combinatorial designs, widely used as templates for efficient interaction-testing…
(more)

Subjects/Keywords: covering array; LYM inequality; extremal set theory; graph-intersecting collection

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Maltais, E. J. (2016). Graph-dependent Covering Arrays and LYM Inequalities . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/34434

Not specified: Masters Thesis or Doctoral Dissertation

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

Maltais, Elizabeth Jane. “Graph-dependent Covering Arrays and LYM Inequalities .” 2016. Thesis, University of Ottawa. Accessed October 31, 2020. http://hdl.handle.net/10393/34434.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Maltais, Elizabeth Jane. “Graph-dependent Covering Arrays and LYM Inequalities .” 2016. Web. 31 Oct 2020.

Vancouver:

Maltais EJ. Graph-dependent Covering Arrays and LYM Inequalities . [Internet] [Thesis]. University of Ottawa; 2016. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/10393/34434.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Maltais EJ. Graph-dependent Covering Arrays and LYM Inequalities . [Thesis]. University of Ottawa; 2016. Available from: http://hdl.handle.net/10393/34434

Not specified: Masters Thesis or Doctoral Dissertation

Queen Mary, University of London

6. Curtis, Andrew. Two families of holomorphic correspondences.

Degree: PhD, 2014, Queen Mary, University of London

URL: http://qmro.qmul.ac.uk/xmlui/handle/123456789/7978 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658686

► Holomorphic correspondences are multivalued functions from the Riemann sphere to itself. This thesis is concerned with a certain type of holomorphic correspondence known as a…
(more)

Subjects/Keywords: 515; Holomorphic correspondences; covering correspondence; Cantor set correspondences; Klein Combination Theorem; matings

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Curtis, A. (2014). Two families of holomorphic correspondences. (Doctoral Dissertation). Queen Mary, University of London. Retrieved from http://qmro.qmul.ac.uk/xmlui/handle/123456789/7978 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658686

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

Curtis, Andrew. “Two families of holomorphic correspondences.” 2014. Doctoral Dissertation, Queen Mary, University of London. Accessed October 31, 2020. http://qmro.qmul.ac.uk/xmlui/handle/123456789/7978 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658686.

MLA Handbook (7^{th} Edition):

Curtis, Andrew. “Two families of holomorphic correspondences.” 2014. Web. 31 Oct 2020.

Vancouver:

Curtis A. Two families of holomorphic correspondences. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2014. [cited 2020 Oct 31]. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/7978 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658686.

Council of Science Editors:

Curtis A. Two families of holomorphic correspondences. [Doctoral Dissertation]. Queen Mary, University of London; 2014. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/7978 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658686

University of Waterloo

7.
Grant, Elyot.
* Covering* Problems via Structural Approaches.

Degree: 2011, University of Waterloo

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

► The minimum *set* cover problem is, without question, among the most ubiquitous and well-studied problems in computer science. Its theoretical hardness has been fully characterized –…
(more)

Subjects/Keywords: set cover; combinatorial optimization; computational geometry; quasi-uniform sampling; hitting set; apx-hard; dynamic programming; capacitated covering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Grant, E. (2011). Covering Problems via Structural Approaches. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6317

Not specified: Masters Thesis or Doctoral Dissertation

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

Grant, Elyot. “Covering Problems via Structural Approaches.” 2011. Thesis, University of Waterloo. Accessed October 31, 2020. http://hdl.handle.net/10012/6317.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Grant, Elyot. “Covering Problems via Structural Approaches.” 2011. Web. 31 Oct 2020.

Vancouver:

Grant E. Covering Problems via Structural Approaches. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/10012/6317.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Grant E. Covering Problems via Structural Approaches. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6317

Not specified: Masters Thesis or Doctoral Dissertation

Universitetet i Tromsø

8. Yang, Shuo. Improving the performance of service network through location-based optimization and analysis. A case study on postal service in a city in Northern Norway.

Degree: 2017, Universitetet i Tromsø

URL: http://hdl.handle.net/10037/12223

► Everyone needs to be served, and a service network provides a *set* of services and/or help to please the people involved. No matter who is…
(more)

Subjects/Keywords: VDP::Teknologi: 500::Maskinfag: 570; VDP::Technology: 500::Mechanical engineering: 570; Availability; Efficiency; Accessibility; Set covering location problem; Maximal covering location problem; P-median problem; Service facility

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yang, S. (2017). Improving the performance of service network through location-based optimization and analysis. A case study on postal service in a city in Northern Norway. (Masters Thesis). Universitetet i Tromsø. Retrieved from http://hdl.handle.net/10037/12223

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

Yang, Shuo. “Improving the performance of service network through location-based optimization and analysis. A case study on postal service in a city in Northern Norway.” 2017. Masters Thesis, Universitetet i Tromsø. Accessed October 31, 2020. http://hdl.handle.net/10037/12223.

MLA Handbook (7^{th} Edition):

Yang, Shuo. “Improving the performance of service network through location-based optimization and analysis. A case study on postal service in a city in Northern Norway.” 2017. Web. 31 Oct 2020.

Vancouver:

Yang S. Improving the performance of service network through location-based optimization and analysis. A case study on postal service in a city in Northern Norway. [Internet] [Masters thesis]. Universitetet i Tromsø 2017. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/10037/12223.

Council of Science Editors:

Yang S. Improving the performance of service network through location-based optimization and analysis. A case study on postal service in a city in Northern Norway. [Masters Thesis]. Universitetet i Tromsø 2017. Available from: http://hdl.handle.net/10037/12223

9. Wang, Yan. Query Selection in Deep Web Crawling.

Degree: PhD, Computer Science, 2012, National Library of Canada

URL: http://scholar.uwindsor.ca/etd/4850

► In many web sites, users need to type in keywords in a search Form in order to access the pages. These pages, called the deep…
(more)

Subjects/Keywords: Communication and the arts; Applied sciences; Deep web; Document frequency; Ranked data source; Set covering; Query selection

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, Y. (2012). Query Selection in Deep Web Crawling. (Doctoral Dissertation). National Library of Canada. Retrieved from http://scholar.uwindsor.ca/etd/4850

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

Wang, Yan. “Query Selection in Deep Web Crawling.” 2012. Doctoral Dissertation, National Library of Canada. Accessed October 31, 2020. http://scholar.uwindsor.ca/etd/4850.

MLA Handbook (7^{th} Edition):

Wang, Yan. “Query Selection in Deep Web Crawling.” 2012. Web. 31 Oct 2020.

Vancouver:

Wang Y. Query Selection in Deep Web Crawling. [Internet] [Doctoral dissertation]. National Library of Canada; 2012. [cited 2020 Oct 31]. Available from: http://scholar.uwindsor.ca/etd/4850.

Council of Science Editors:

Wang Y. Query Selection in Deep Web Crawling. [Doctoral Dissertation]. National Library of Canada; 2012. Available from: http://scholar.uwindsor.ca/etd/4850

University of Washington

10.
Wu, Hao-Hsiang.
Stochastic Combinatorial Optimization with Applications in Graph * Covering*.

Degree: PhD, 2019, University of Washington

URL: http://hdl.handle.net/1773/43402

► We study stochastic combinatorial optimization models and propose methods for their solution. First, we consider a risk-neutral two-stage stochastic programming model for which the objective…
(more)

Subjects/Keywords: chance constraints; conditional value-at-risk; oracle; probabilistic set covering; stochastic programming; submodularity; Operations research; Industrial engineering; Industrial engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wu, H. (2019). Stochastic Combinatorial Optimization with Applications in Graph Covering. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/43402

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

Wu, Hao-Hsiang. “Stochastic Combinatorial Optimization with Applications in Graph Covering.” 2019. Doctoral Dissertation, University of Washington. Accessed October 31, 2020. http://hdl.handle.net/1773/43402.

MLA Handbook (7^{th} Edition):

Wu, Hao-Hsiang. “Stochastic Combinatorial Optimization with Applications in Graph Covering.” 2019. Web. 31 Oct 2020.

Vancouver:

Wu H. Stochastic Combinatorial Optimization with Applications in Graph Covering. [Internet] [Doctoral dissertation]. University of Washington; 2019. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/1773/43402.

Council of Science Editors:

Wu H. Stochastic Combinatorial Optimization with Applications in Graph Covering. [Doctoral Dissertation]. University of Washington; 2019. Available from: http://hdl.handle.net/1773/43402

11. Γεωργαντζίνος, Στυλιανός. Χρήση της περιβάλλουσας ανάλυσης δεδομένων για την αποδοτική κάλυψη ή σύμπτηξη ενός συνόλου.

Degree: 2009, University of Patras

URL: http://nemertes.lis.upatras.gr/jspui/handle/10889/2500

►

Στην παρούσα μεταπτυχιακή εργασία περιγράφεται η διαδικασία συνδυασμού προβλημάτων Επιχειρησιακής Έρευνας με την μεθοδολογία εύρεσης συγκριτικής αποδοτικότητας (DEA). Αρχικά, παρουσιάζεται μια γενική περιγραφή της μεθόδου… (more)

Subjects/Keywords: Περιβάλλουσα ανάλυση δεδομένων; Κάλυψη συνόλου; Σύμπτυξη συνόλου; Ποσοτική λήψη αποφάσεων; Βελτιστοποίηση; Επιχειρησιακή έρευνα; Πολυκριτήρια ανάλυση; 519.72; Data envelopment analysis (DEA); Set covering problem; Set packing problem; Operation research; Multiobjective analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Γεωργαντζίνος, . (2009). Χρήση της περιβάλλουσας ανάλυσης δεδομένων για την αποδοτική κάλυψη ή σύμπτηξη ενός συνόλου. (Masters Thesis). University of Patras. Retrieved from http://nemertes.lis.upatras.gr/jspui/handle/10889/2500

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

Γεωργαντζίνος, Στυλιανός. “Χρήση της περιβάλλουσας ανάλυσης δεδομένων για την αποδοτική κάλυψη ή σύμπτηξη ενός συνόλου.” 2009. Masters Thesis, University of Patras. Accessed October 31, 2020. http://nemertes.lis.upatras.gr/jspui/handle/10889/2500.

MLA Handbook (7^{th} Edition):

Γεωργαντζίνος, Στυλιανός. “Χρήση της περιβάλλουσας ανάλυσης δεδομένων για την αποδοτική κάλυψη ή σύμπτηξη ενός συνόλου.” 2009. Web. 31 Oct 2020.

Vancouver:

Γεωργαντζίνος . Χρήση της περιβάλλουσας ανάλυσης δεδομένων για την αποδοτική κάλυψη ή σύμπτηξη ενός συνόλου. [Internet] [Masters thesis]. University of Patras; 2009. [cited 2020 Oct 31]. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/2500.

Council of Science Editors:

Γεωργαντζίνος . Χρήση της περιβάλλουσας ανάλυσης δεδομένων για την αποδοτική κάλυψη ή σύμπτηξη ενός συνόλου. [Masters Thesis]. University of Patras; 2009. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/2500

University of Vienna

12.
Kubik, Patrick.
Heuristic solution approaches for the *covering* tour problem.

Degree: 2007, University of Vienna

URL: http://othes.univie.ac.at/334/

►

Diese Arbeit beschäftigt sich mit dem *Covering* Tour Problem (CTP) und verschiedenen heuristischen Lösungsmethoden. Dieses Problem der Tourenplanung zählt zu den kombinatorischen Optimierungsproblemen, welche sehr…
(more)

Subjects/Keywords: 85.99 Betriebswirtschaft: Sonstiges; Covering Tour Problem / kombinatorische Optimierung / Ant Colony Optimierung / GENIUS / PRIAML1 / Traveling Salesman Problem / Set Covering Problem; Covering Tour Problem / Combinatorial Optimization / Ant Colony Optimization / GENIUS / PRIAML1 / Traveling Salesman Problem / Set Covering Problem

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kubik, P. (2007). Heuristic solution approaches for the covering tour problem. (Thesis). University of Vienna. Retrieved from http://othes.univie.ac.at/334/

Not specified: Masters Thesis or Doctoral Dissertation

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

Kubik, Patrick. “Heuristic solution approaches for the covering tour problem.” 2007. Thesis, University of Vienna. Accessed October 31, 2020. http://othes.univie.ac.at/334/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kubik, Patrick. “Heuristic solution approaches for the covering tour problem.” 2007. Web. 31 Oct 2020.

Vancouver:

Kubik P. Heuristic solution approaches for the covering tour problem. [Internet] [Thesis]. University of Vienna; 2007. [cited 2020 Oct 31]. Available from: http://othes.univie.ac.at/334/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kubik P. Heuristic solution approaches for the covering tour problem. [Thesis]. University of Vienna; 2007. Available from: http://othes.univie.ac.at/334/

Not specified: Masters Thesis or Doctoral Dissertation

13. Kukuk, Markus. A model-based approach to intraoperative guidance of flexible endoscopy.

Degree: 2003, Universität Dortmund

URL: http://hdl.handle.net/2003/2571

► Endoscopy is a medical procedure, where a physician uses an optical instrument called an "endoscope" to obtain a magnified view of the inner surface of…
(more)

Subjects/Keywords: endoscope model; endoscopy; minimally invasive; Set-Covering-Problem; TBNA; 620

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kukuk, M. (2003). A model-based approach to intraoperative guidance of flexible endoscopy. (Thesis). Universität Dortmund. Retrieved from http://hdl.handle.net/2003/2571

Not specified: Masters Thesis or Doctoral Dissertation

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

Kukuk, Markus. “A model-based approach to intraoperative guidance of flexible endoscopy.” 2003. Thesis, Universität Dortmund. Accessed October 31, 2020. http://hdl.handle.net/2003/2571.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kukuk, Markus. “A model-based approach to intraoperative guidance of flexible endoscopy.” 2003. Web. 31 Oct 2020.

Vancouver:

Kukuk M. A model-based approach to intraoperative guidance of flexible endoscopy. [Internet] [Thesis]. Universität Dortmund; 2003. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/2003/2571.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kukuk M. A model-based approach to intraoperative guidance of flexible endoscopy. [Thesis]. Universität Dortmund; 2003. Available from: http://hdl.handle.net/2003/2571

Not specified: Masters Thesis or Doctoral Dissertation

14. Kukuk, Markus. A model-based approach to intraoperative guidance of flexible endoscopy.

Degree: 2003, Technische Universität Dortmund

URL: http://dx.doi.org/10.17877/DE290R-14855

► Endoscopy is a medical procedure, where a physician uses an optical instrument called an "endoscope" to obtain a magnified view of the inner surface of…
(more)

Subjects/Keywords: endoscopy; minimally invasive; endoscope model; Set-Covering-Problem; TBNA; 620

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kukuk, M. (2003). A model-based approach to intraoperative guidance of flexible endoscopy. (Doctoral Dissertation). Technische Universität Dortmund. Retrieved from http://dx.doi.org/10.17877/DE290R-14855

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

Kukuk, Markus. “A model-based approach to intraoperative guidance of flexible endoscopy.” 2003. Doctoral Dissertation, Technische Universität Dortmund. Accessed October 31, 2020. http://dx.doi.org/10.17877/DE290R-14855.

MLA Handbook (7^{th} Edition):

Kukuk, Markus. “A model-based approach to intraoperative guidance of flexible endoscopy.” 2003. Web. 31 Oct 2020.

Vancouver:

Kukuk M. A model-based approach to intraoperative guidance of flexible endoscopy. [Internet] [Doctoral dissertation]. Technische Universität Dortmund; 2003. [cited 2020 Oct 31]. Available from: http://dx.doi.org/10.17877/DE290R-14855.

Council of Science Editors:

Kukuk M. A model-based approach to intraoperative guidance of flexible endoscopy. [Doctoral Dissertation]. Technische Universität Dortmund; 2003. Available from: http://dx.doi.org/10.17877/DE290R-14855

15. Barbato, Michele. A Polyhedral Approach for the Double TSP with Multiple Stacks and Lexicographical Orders : Une approche polyédrale pour le problème du double voyageur de commerce sous contraintes de piles et pour les ordres lexicographiques.

Degree: Docteur es, Informatique, 2016, Sorbonne Paris Cité

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

►

Dans cette thèse nous considérons deux problèmes d'optimisation combinatoire.Le premier s'appelle problème du double voyageur de commerce avec contraintes de piles. Dans ce problème, un… (more)

Subjects/Keywords: Etude polyédrale; Algorithme de coupes et branchements; Polytope lexicographique; Set covering; Double traveling salesman problem with multiple stacks; Branch-and-cut algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Barbato, M. (2016). A Polyhedral Approach for the Double TSP with Multiple Stacks and Lexicographical Orders : Une approche polyédrale pour le problème du double voyageur de commerce sous contraintes de piles et pour les ordres lexicographiques. (Doctoral Dissertation). Sorbonne Paris Cité. Retrieved from http://www.theses.fr/2016USPCD049

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

Barbato, Michele. “A Polyhedral Approach for the Double TSP with Multiple Stacks and Lexicographical Orders : Une approche polyédrale pour le problème du double voyageur de commerce sous contraintes de piles et pour les ordres lexicographiques.” 2016. Doctoral Dissertation, Sorbonne Paris Cité. Accessed October 31, 2020. http://www.theses.fr/2016USPCD049.

MLA Handbook (7^{th} Edition):

Barbato, Michele. “A Polyhedral Approach for the Double TSP with Multiple Stacks and Lexicographical Orders : Une approche polyédrale pour le problème du double voyageur de commerce sous contraintes de piles et pour les ordres lexicographiques.” 2016. Web. 31 Oct 2020.

Vancouver:

Barbato M. A Polyhedral Approach for the Double TSP with Multiple Stacks and Lexicographical Orders : Une approche polyédrale pour le problème du double voyageur de commerce sous contraintes de piles et pour les ordres lexicographiques. [Internet] [Doctoral dissertation]. Sorbonne Paris Cité; 2016. [cited 2020 Oct 31]. Available from: http://www.theses.fr/2016USPCD049.

Council of Science Editors:

Barbato M. A Polyhedral Approach for the Double TSP with Multiple Stacks and Lexicographical Orders : Une approche polyédrale pour le problème du double voyageur de commerce sous contraintes de piles et pour les ordres lexicographiques. [Doctoral Dissertation]. Sorbonne Paris Cité; 2016. Available from: http://www.theses.fr/2016USPCD049

University of Central Florida

16.
Sapkota, Nabin.
Simulation Of Random *Set* *Covering* Problems With Known Optimal Solutions And Explicitly Induced Correlations Amoong Coefficients.

Degree: 2006, University of Central Florida

URL: https://stars.library.ucf.edu/etd/1032

► The objective of this research is to devise a procedure to generate random *Set* *Covering* Problem (SCP) instances with known optimal solutions and correlated coefficients.…
(more)

Subjects/Keywords: Correlated coefficients; set covering; column generation; random problem generation; Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sapkota, N. (2006). Simulation Of Random Set Covering Problems With Known Optimal Solutions And Explicitly Induced Correlations Amoong Coefficients. (Doctoral Dissertation). University of Central Florida. Retrieved from https://stars.library.ucf.edu/etd/1032

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

Sapkota, Nabin. “Simulation Of Random Set Covering Problems With Known Optimal Solutions And Explicitly Induced Correlations Amoong Coefficients.” 2006. Doctoral Dissertation, University of Central Florida. Accessed October 31, 2020. https://stars.library.ucf.edu/etd/1032.

MLA Handbook (7^{th} Edition):

Sapkota, Nabin. “Simulation Of Random Set Covering Problems With Known Optimal Solutions And Explicitly Induced Correlations Amoong Coefficients.” 2006. Web. 31 Oct 2020.

Vancouver:

Sapkota N. Simulation Of Random Set Covering Problems With Known Optimal Solutions And Explicitly Induced Correlations Amoong Coefficients. [Internet] [Doctoral dissertation]. University of Central Florida; 2006. [cited 2020 Oct 31]. Available from: https://stars.library.ucf.edu/etd/1032.

Council of Science Editors:

Sapkota N. Simulation Of Random Set Covering Problems With Known Optimal Solutions And Explicitly Induced Correlations Amoong Coefficients. [Doctoral Dissertation]. University of Central Florida; 2006. Available from: https://stars.library.ucf.edu/etd/1032

17. Ballone, Frank A. Gamma-Sets and the (A, B_∞) Selection Principle.

Degree: PhD, Mathematics (Arts and Sciences), 2017, Ohio University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1490350606744796

► The field of Selection Principles in Mathematics is in some sense the study of diagonalization processes. It has its roots in a few basic selection…
(more)

Subjects/Keywords: Mathematics; mathematics; set theory; topology; selection principles; gamma-set; filters; covering properties

…Y ⊆X
x∈X
O
Ω
Γ
O
Ω
Γ
CΩ
the *set* of all finite ordinals (the *set* of natural numbers… …covers of a *set* X introduced by B. Tsaban
A
A choose B∞ selection principle… …B∞
X \Y
the relative complement of Y with respect to a *set* X . . . .
P(X)… …the power *set* of a *set* X . . . . . . . . . . . . . . . . . . . .
f : A → B f is a function… …R
the *set* of real numbers
. . . . . . . . . . . . . . . . . . . .
T
A
(A
,
B)…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ballone, F. A. (2017). Gamma-Sets and the (A, B_∞) Selection Principle. (Doctoral Dissertation). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1490350606744796

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

Ballone, Frank A. “Gamma-Sets and the (A, B_∞) Selection Principle.” 2017. Doctoral Dissertation, Ohio University. Accessed October 31, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1490350606744796.

MLA Handbook (7^{th} Edition):

Ballone, Frank A. “Gamma-Sets and the (A, B_∞) Selection Principle.” 2017. Web. 31 Oct 2020.

Vancouver:

Ballone FA. Gamma-Sets and the (A, B_∞) Selection Principle. [Internet] [Doctoral dissertation]. Ohio University; 2017. [cited 2020 Oct 31]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1490350606744796.

Council of Science Editors:

Ballone FA. Gamma-Sets and the (A, B_∞) Selection Principle. [Doctoral Dissertation]. Ohio University; 2017. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1490350606744796

Technical University of Lisbon

18. Pinto, Leonor Santiago. Cobertura com restrições de conexidade.

Degree: 2004, Technical University of Lisbon

URL: http://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/4705

►

Doutoramento em Matemática Aplicada à Economia e Gestão

Dado um grafo bipartido com classes de bipartição V e U, uma cobertura é um subconjunto C… (more)

Subjects/Keywords: Problema da cobertura; grafos; conexidade; programação linear inteira; poliedros; Set covering; graphs; connectivity; integer programming; poly-topes

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pinto, L. S. (2004). Cobertura com restrições de conexidade. (Thesis). Technical University of Lisbon. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/4705

Not specified: Masters Thesis or Doctoral Dissertation

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

Pinto, Leonor Santiago. “Cobertura com restrições de conexidade.” 2004. Thesis, Technical University of Lisbon. Accessed October 31, 2020. http://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/4705.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Pinto, Leonor Santiago. “Cobertura com restrições de conexidade.” 2004. Web. 31 Oct 2020.

Vancouver:

Pinto LS. Cobertura com restrições de conexidade. [Internet] [Thesis]. Technical University of Lisbon; 2004. [cited 2020 Oct 31]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/4705.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pinto LS. Cobertura com restrições de conexidade. [Thesis]. Technical University of Lisbon; 2004. Available from: http://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/4705

Not specified: Masters Thesis or Doctoral Dissertation

Pontifical Catholic University of Rio de Janeiro

19.
MAYRA CARVALHO ALBUQUERQUE.
[en] MATHEURISTICS FOR VARIANTS OF THE DOMINATING *SET*
PROBLEM.

Degree: 2018, Pontifical Catholic University of Rio de Janeiro

URL: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=34169

►

[pt] Esta tese faz um estudo do problema do Conjunto Dominante, um problema NP-difícil de grande relevância em aplicações relacionadas ao projeto de rede sem… (more)

Subjects/Keywords: [pt] BUSCA TABU; [en] TABU SEARCH; [pt] CONJUNTO DOMINANTE; [en] DOMINATING SET; [pt] CODIGO DE COBERTURA; [en] COVERING CODE; [pt] MATEURISTICAS; [en] MATHEURISTICS; [pt] BUSCA EM VIZINHANCA LARGA; [en] NEIGHBORHOOD SEARCH

Record Details Similar Records

❌

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

APA (6^{th} Edition):

ALBUQUERQUE, M. C. (2018). [en] MATHEURISTICS FOR VARIANTS OF THE DOMINATING SET PROBLEM. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=34169

Not specified: Masters Thesis or Doctoral Dissertation

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

ALBUQUERQUE, MAYRA CARVALHO. “[en] MATHEURISTICS FOR VARIANTS OF THE DOMINATING SET PROBLEM.” 2018. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed October 31, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=34169.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

ALBUQUERQUE, MAYRA CARVALHO. “[en] MATHEURISTICS FOR VARIANTS OF THE DOMINATING SET PROBLEM.” 2018. Web. 31 Oct 2020.

Vancouver:

ALBUQUERQUE MC. [en] MATHEURISTICS FOR VARIANTS OF THE DOMINATING SET PROBLEM. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2018. [cited 2020 Oct 31]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=34169.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

ALBUQUERQUE MC. [en] MATHEURISTICS FOR VARIANTS OF THE DOMINATING SET PROBLEM. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2018. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=34169

Not specified: Masters Thesis or Doctoral Dissertation

20. Telelis, Orestis. Κάλυψη συνόλου και βελτιστοποίηση δικτύων: δυναμικοί και προσεγγιστικοί αλγόριθμοι.

Degree: 2006, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ)

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

►

The dissertation concerns design and analysis of *set* *covering* and network optimization algorithms.The content of the dissertation consists of three parts: Probabilistic *Set* *Covering*, Dynamic…
(more)

Subjects/Keywords: Κάλυψη συνόλου; Δυναμικοί αλγόριθμοι γράφων; Αλγόριθμοι, Προσεγγιστικοί; Βελτιστοποίηση; Σχεδιασμός δικτύων; Set covering; Dynamic graph algorithms; Optimization; Network design

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Telelis, O. (2006). Κάλυψη συνόλου και βελτιστοποίηση δικτύων: δυναμικοί και προσεγγιστικοί αλγόριθμοι. (Thesis). National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Retrieved from http://hdl.handle.net/10442/hedi/22196

Not specified: Masters Thesis or Doctoral Dissertation

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

Telelis, Orestis. “Κάλυψη συνόλου και βελτιστοποίηση δικτύων: δυναμικοί και προσεγγιστικοί αλγόριθμοι.” 2006. Thesis, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Accessed October 31, 2020. http://hdl.handle.net/10442/hedi/22196.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Telelis, Orestis. “Κάλυψη συνόλου και βελτιστοποίηση δικτύων: δυναμικοί και προσεγγιστικοί αλγόριθμοι.” 2006. Web. 31 Oct 2020.

Vancouver:

Telelis O. Κάλυψη συνόλου και βελτιστοποίηση δικτύων: δυναμικοί και προσεγγιστικοί αλγόριθμοι. [Internet] [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 2006. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/10442/hedi/22196.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Telelis O. Κάλυψη συνόλου και βελτιστοποίηση δικτύων: δυναμικοί και προσεγγιστικοί αλγόριθμοι. [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 2006. Available from: http://hdl.handle.net/10442/hedi/22196

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

21. Abdi, Ahmad. Ideal Clutters.

Degree: 2018, University of Waterloo

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

► Let E be a finite *set* of elements, and let C be a family of subsets of E called members. We say that C is…
(more)

Subjects/Keywords: clutters; ideal matrices; the packing property; integral polyhedra; set covering polyhedron; degenerate projective planes; cuboids; binary clutters; strict polarity; cube-ideal sets; identically self-blocking clutters; resistant sets; minimally non-ideal clutters

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Abdi, A. (2018). Ideal Clutters. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13167

Not specified: Masters Thesis or Doctoral Dissertation

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

Abdi, Ahmad. “Ideal Clutters.” 2018. Thesis, University of Waterloo. Accessed October 31, 2020. http://hdl.handle.net/10012/13167.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Abdi, Ahmad. “Ideal Clutters.” 2018. Web. 31 Oct 2020.

Vancouver:

Abdi A. Ideal Clutters. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/10012/13167.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Abdi A. Ideal Clutters. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13167

Not specified: Masters Thesis or Doctoral Dissertation

22. Okeson, Trent James. Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods.

Degree: MS, 2018, Brigham Young University

URL: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=8102&context=etd

► Remote sensors and unmanned aerial vehicles (UAVs) have the potential to dramatically improve infrastructure health monitoring in terms of accuracy of the information and frequency…
(more)

Subjects/Keywords: Combinatorial Optimization; Camera Planning; Set Covering Problem; Structure-from-Motion; Multi-scale Modeling; Engineering

…The time to solve the *set* *covering* problem with the greedy algorithm based on the
number of… …15]. Using the graph, the optimization problem is formulated as the *set*
*covering*… …region, the optimization problem is often formulated as the *set* *covering* problem. More… …information about the *set* *covering* problem, a standard problem in combinatorics, is discussed in… …general *set* *covering* algorithms have been applied to the camera placement problem for
SfM…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Okeson, T. J. (2018). Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=8102&context=etd

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

Okeson, Trent James. “Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods.” 2018. Masters Thesis, Brigham Young University. Accessed October 31, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=8102&context=etd.

MLA Handbook (7^{th} Edition):

Okeson, Trent James. “Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods.” 2018. Web. 31 Oct 2020.

Vancouver:

Okeson TJ. Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods. [Internet] [Masters thesis]. Brigham Young University; 2018. [cited 2020 Oct 31]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=8102&context=etd.

Council of Science Editors:

Okeson TJ. Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods. [Masters Thesis]. Brigham Young University; 2018. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=8102&context=etd

Brno University of Technology

23. Popek, Miloš. Řešení optimalizačních úloh inspirované živými organismy: Solving of Optimisation Tasks Inspired by Living Organisms.

Degree: 2018, Brno University of Technology

URL: http://hdl.handle.net/11012/52796

► We meet with solving of optimization problems every day, when we try to do our tasks in the best way. An Ant Colony Optimization is…
(more)

Subjects/Keywords: Ant Colony Optimization; genetický algoritmus; optimalizace; problém obchodního cestujícího; problém rozvržení úloh na dílně; problém pokrytí množin; simulace; samoorganizace; Ant Colony Optimization; Genetic Algorithm; optimization; Traveling Salesman Problem; Job Shop Scheduling Problem; Set Covering Problem; simulation; self-organization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Popek, M. (2018). Řešení optimalizačních úloh inspirované živými organismy: Solving of Optimisation Tasks Inspired by Living Organisms. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/52796

Not specified: Masters Thesis or Doctoral Dissertation

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

Popek, Miloš. “Řešení optimalizačních úloh inspirované živými organismy: Solving of Optimisation Tasks Inspired by Living Organisms.” 2018. Thesis, Brno University of Technology. Accessed October 31, 2020. http://hdl.handle.net/11012/52796.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Popek, Miloš. “Řešení optimalizačních úloh inspirované živými organismy: Solving of Optimisation Tasks Inspired by Living Organisms.” 2018. Web. 31 Oct 2020.

Vancouver:

Popek M. Řešení optimalizačních úloh inspirované živými organismy: Solving of Optimisation Tasks Inspired by Living Organisms. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/11012/52796.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Popek M. Řešení optimalizačních úloh inspirované živými organismy: Solving of Optimisation Tasks Inspired by Living Organisms. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/52796

Not specified: Masters Thesis or Doctoral Dissertation

24. Okeson, Trent James. Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods.

Degree: MS, 2018, Brigham Young University

URL: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=8060&context=etd

► Remote sensors and unmanned aerial vehicles (UAVs) have the potential to dramatically improve infrastructure health monitoring in terms of accuracy of the information and frequency…
(more)

Subjects/Keywords: Combinatorial Optimization; Camera Planning; Set Covering Problem; Structure-from-Motion; Multi-scale Modeling; Chemical Engineering

…The time to solve the *set* *covering* problem with the greedy algorithm based on the
number of… …15]. Using the graph, the optimization problem is formulated as the *set*
*covering*… …region, the optimization problem is often formulated as the *set* *covering* problem. More… …information about the *set* *covering* problem, a standard problem in combinatorics, is discussed in… …general *set* *covering* algorithms have been applied to the camera placement problem for
SfM…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Okeson, T. J. (2018). Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=8060&context=etd

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

Okeson, Trent James. “Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods.” 2018. Masters Thesis, Brigham Young University. Accessed October 31, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=8060&context=etd.

MLA Handbook (7^{th} Edition):

Okeson, Trent James. “Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods.” 2018. Web. 31 Oct 2020.

Vancouver:

Okeson TJ. Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods. [Internet] [Masters thesis]. Brigham Young University; 2018. [cited 2020 Oct 31]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=8060&context=etd.

Council of Science Editors:

Okeson TJ. Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods. [Masters Thesis]. Brigham Young University; 2018. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=8060&context=etd

25.
Bhowmick, Santanu.
Multi-*covering* problems and their variants.

Degree: PhD, Computer Science, 2017, University of Iowa

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

► In combinatorial optimization, *covering* problems are those problems where given a ground *set* and a family of subsets of the ground *set*, the objective…
(more)

Subjects/Keywords: approximation algorithm; clustering; computational geometry; geometric covering; multi cover; set cover; Computer Sciences

…*covering*. An example
of a clustering problem is the following: given a *set* X of points in an… …minimize
the sum of radii of the balls. In a typical *covering* problem, we are given a *set* P of… …complexity of the *set* system gives improved approximation bounds for *covering* using fat objects… …Cover Problem for *covering* points using
disks on the plane (and other *set* systems having… …following
generalization in the multi-*covering* domain.
Definition 2. Given are a *set* of points X…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bhowmick, S. (2017). Multi-covering problems and their variants. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/5418

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

Bhowmick, Santanu. “Multi-covering problems and their variants.” 2017. Doctoral Dissertation, University of Iowa. Accessed October 31, 2020. https://ir.uiowa.edu/etd/5418.

MLA Handbook (7^{th} Edition):

Bhowmick, Santanu. “Multi-covering problems and their variants.” 2017. Web. 31 Oct 2020.

Vancouver:

Bhowmick S. Multi-covering problems and their variants. [Internet] [Doctoral dissertation]. University of Iowa; 2017. [cited 2020 Oct 31]. Available from: https://ir.uiowa.edu/etd/5418.

Council of Science Editors:

Bhowmick S. Multi-covering problems and their variants. [Doctoral Dissertation]. University of Iowa; 2017. Available from: https://ir.uiowa.edu/etd/5418

University of Waterloo

26. Lafreniere, Benjamin J. Packing Unit Disks.

Degree: 2008, University of Waterloo

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

► Given a *set* of unit disks in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint…
(more)

Subjects/Keywords: computational geometry; disk packing; covering; colouring; maximum independent set; lower bounds; discrete geometry; algorithms; complexity; disk intersection graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lafreniere, B. J. (2008). Packing Unit Disks. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3907

Not specified: Masters Thesis or Doctoral Dissertation

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

Lafreniere, Benjamin J. “Packing Unit Disks.” 2008. Thesis, University of Waterloo. Accessed October 31, 2020. http://hdl.handle.net/10012/3907.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lafreniere, Benjamin J. “Packing Unit Disks.” 2008. Web. 31 Oct 2020.

Vancouver:

Lafreniere BJ. Packing Unit Disks. [Internet] [Thesis]. University of Waterloo; 2008. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/10012/3907.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lafreniere BJ. Packing Unit Disks. [Thesis]. University of Waterloo; 2008. Available from: http://hdl.handle.net/10012/3907

Not specified: Masters Thesis or Doctoral Dissertation

University of Sydney

27. Sheppard, Nicholas Paul. Self-Reduction for Combinatorial Optimisation .

Degree: 2001, University of Sydney

URL: http://hdl.handle.net/2123/797

► This thesis presents and develops a theory of self-reduction. This process is used to map instances of combinatorial optimisation problems onto smaller, more easily solvable…
(more)

Subjects/Keywords: combinatorial optmisation; self-reduction; confluence; decomposition; graph colouring; steiner problem; bin packing; set covering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sheppard, N. P. (2001). Self-Reduction for Combinatorial Optimisation . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/797

Not specified: Masters Thesis or Doctoral Dissertation

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

Sheppard, Nicholas Paul. “Self-Reduction for Combinatorial Optimisation .” 2001. Thesis, University of Sydney. Accessed October 31, 2020. http://hdl.handle.net/2123/797.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sheppard, Nicholas Paul. “Self-Reduction for Combinatorial Optimisation .” 2001. Web. 31 Oct 2020.

Vancouver:

Sheppard NP. Self-Reduction for Combinatorial Optimisation . [Internet] [Thesis]. University of Sydney; 2001. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/2123/797.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sheppard NP. Self-Reduction for Combinatorial Optimisation . [Thesis]. University of Sydney; 2001. Available from: http://hdl.handle.net/2123/797

Not specified: Masters Thesis or Doctoral Dissertation

28. Dwivedi, Aditi. An Integrated Optimization Model for Distribution Center Location with Considerations of Population and Income.

Degree: MS, Industrial and Systems Engineering (Engineering and Technology), 2012, Ohio University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1353939479

► This Paper uses optimization method and decision making tool to find the best possible location of distribution centers. The original optimization method is modified to…
(more)

Subjects/Keywords: Industrial Engineering; Set Covering; Location Model; AHP; Dstribution Center; Two level location problem

…hierarchy process (AHP) and *set*
*covering* methodologies will be applied to a problem to… …x29; using *set* *covering*
problem taking into consideration some important factors.
11
3… …distribution centers depending on
the answer given by the *set* *covering* method for that particular… …LDC
The RDC location is obtained using *set* *covering*. The original *set* *covering* formulation… …preference
scale.
17
1.3
*Set* *Covering*
*Set* *covering* is a facility location problem which helps…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dwivedi, A. (2012). An Integrated Optimization Model for Distribution Center Location with Considerations of Population and Income. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1353939479

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

Dwivedi, Aditi. “An Integrated Optimization Model for Distribution Center Location with Considerations of Population and Income.” 2012. Masters Thesis, Ohio University. Accessed October 31, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1353939479.

MLA Handbook (7^{th} Edition):

Dwivedi, Aditi. “An Integrated Optimization Model for Distribution Center Location with Considerations of Population and Income.” 2012. Web. 31 Oct 2020.

Vancouver:

Dwivedi A. An Integrated Optimization Model for Distribution Center Location with Considerations of Population and Income. [Internet] [Masters thesis]. Ohio University; 2012. [cited 2020 Oct 31]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1353939479.

Council of Science Editors:

Dwivedi A. An Integrated Optimization Model for Distribution Center Location with Considerations of Population and Income. [Masters Thesis]. Ohio University; 2012. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1353939479

29. Kantharaj, Krithica. Evaluating Coverage Models for Emergency Services: A Case Study of Emergency Siren Placement in Lucas County, OH.

Degree: MA, Geography, 2013, University of Toledo

URL: http://rave.ohiolink.edu/etdc/view?acc_num=toledo1384525360

► This thesis documents the development of a model to optimally site a minimum number of emergency warning sirens in a continuous space to provide emergency…
(more)

Subjects/Keywords: Geographic Information Science; Geography; Location Set Covering Problem; Site Emergency Siren; Clustering; Location Modeling; Location Analysis

…IDE - Integrated Development Environment
LOC - Lines of Code
LSCP - location *set* *covering*… …study are listed as follows:
Compare the different *set* *covering* problems (LSCP, MCLP… …formulate the coverage problem in 1965. Toregas and ReVelle introduced
the location *set* *covering*… …Mathematical formulation of the location *set* *covering* problem (LSCP) is as follows… …facility sites.
Φi = *set* of potential facility sites j capable of *covering* area i.
s = standard…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kantharaj, K. (2013). Evaluating Coverage Models for Emergency Services: A Case Study of Emergency Siren Placement in Lucas County, OH. (Masters Thesis). University of Toledo. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=toledo1384525360

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

Kantharaj, Krithica. “Evaluating Coverage Models for Emergency Services: A Case Study of Emergency Siren Placement in Lucas County, OH.” 2013. Masters Thesis, University of Toledo. Accessed October 31, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1384525360.

MLA Handbook (7^{th} Edition):

Kantharaj, Krithica. “Evaluating Coverage Models for Emergency Services: A Case Study of Emergency Siren Placement in Lucas County, OH.” 2013. Web. 31 Oct 2020.

Vancouver:

Kantharaj K. Evaluating Coverage Models for Emergency Services: A Case Study of Emergency Siren Placement in Lucas County, OH. [Internet] [Masters thesis]. University of Toledo; 2013. [cited 2020 Oct 31]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=toledo1384525360.

Council of Science Editors:

Kantharaj K. Evaluating Coverage Models for Emergency Services: A Case Study of Emergency Siren Placement in Lucas County, OH. [Masters Thesis]. University of Toledo; 2013. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=toledo1384525360

30. ΣΑΤΡΑΤΖΕΜΗ, ΜΑΡΙΑ-ΑΙΚΑΤΕΡΙΝΗ. ΕΠΙΛΥΣΗ ΠΡΟΒΛΗΜΑΤΩΝ ΧΩΡΟΘΕΤΗΣΗΣ ΚΕΝΤΡΩΝ ΠΑΡΟΧΗΣ ΥΠΗΡΕΣΙΩΝ ΣΕ ΔΙΚΤΥΟ.

Degree: 1991, Πανεπιστήμιο Μακεδονίας Οικονομικών και Κοινωνικών Επιστημών; University of Macedonia Economic and Social Sciences

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

►

THE *SUBJECT* OF THIS THESIS IS THE SOLUTION OF THE FACILITY LOCATION PROBLEM (FLP) IN SUCH WAY THAT ANY DEMAND POINT CAN BE SERVICED BY…
(more)

Subjects/Keywords: BRANCH AND BOUND ALGORITHMS; EXTERNALLY STABLE SETS; Graphs; Location; LOCATION-ALLOCATION MODELS; Networks; OPTIMAZATION; SERVICE FACILITY; SET COVERING PROBLEMS; SHORTEST PATH; ΑΛΓΟΡΙΘΜΟΙ ΔΙΑΚΛΑΔΩΣΗΣ ΚΑΙΦΡΑΓΜΟΥ; Βελτιστοποίηση; Γραφήματα; Δίκτυα; ΕΞΩΤΕΡΙΚΩΣ ΣΤΑΘΕΡΑ ΣΥΝΟΛΑ; ΚΕΝΤΡΑ ΠΑΡΟΧΗΣ ΥΠΗΡΕΣΙΩΝ; ΜΟΝΤΕΛΑ ΧΩΡΟΘΕΤΗΣΕΩΝ-ΚΑΤΑΝΟΜΩΝ; ΠΡΟΒΛΗΜΑΤΑ ΣΥΝΟΛΟΥ ΚΑΛΥΨΗΣ; ΣΥΝΤΟΜΕΤΕΡΟΣ ΔΡΟΜΟΣ; Χωροθέτηση

Record Details Similar Records

❌

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

APA (6^{th} Edition):

ΣΑΤΡΑΤΖΕΜΗ, . (1991). ΕΠΙΛΥΣΗ ΠΡΟΒΛΗΜΑΤΩΝ ΧΩΡΟΘΕΤΗΣΗΣ ΚΕΝΤΡΩΝ ΠΑΡΟΧΗΣ ΥΠΗΡΕΣΙΩΝ ΣΕ ΔΙΚΤΥΟ. (Thesis). Πανεπιστήμιο Μακεδονίας Οικονομικών και Κοινωνικών Επιστημών; University of Macedonia Economic and Social Sciences. Retrieved from http://hdl.handle.net/10442/hedi/1746

Not specified: Masters Thesis or Doctoral Dissertation

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

ΣΑΤΡΑΤΖΕΜΗ, ΜΑΡΙΑ-ΑΙΚΑΤΕΡΙΝΗ. “ΕΠΙΛΥΣΗ ΠΡΟΒΛΗΜΑΤΩΝ ΧΩΡΟΘΕΤΗΣΗΣ ΚΕΝΤΡΩΝ ΠΑΡΟΧΗΣ ΥΠΗΡΕΣΙΩΝ ΣΕ ΔΙΚΤΥΟ.” 1991. Thesis, Πανεπιστήμιο Μακεδονίας Οικονομικών και Κοινωνικών Επιστημών; University of Macedonia Economic and Social Sciences. Accessed October 31, 2020. http://hdl.handle.net/10442/hedi/1746.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

ΣΑΤΡΑΤΖΕΜΗ, ΜΑΡΙΑ-ΑΙΚΑΤΕΡΙΝΗ. “ΕΠΙΛΥΣΗ ΠΡΟΒΛΗΜΑΤΩΝ ΧΩΡΟΘΕΤΗΣΗΣ ΚΕΝΤΡΩΝ ΠΑΡΟΧΗΣ ΥΠΗΡΕΣΙΩΝ ΣΕ ΔΙΚΤΥΟ.” 1991. Web. 31 Oct 2020.

Vancouver:

ΣΑΤΡΑΤΖΕΜΗ . ΕΠΙΛΥΣΗ ΠΡΟΒΛΗΜΑΤΩΝ ΧΩΡΟΘΕΤΗΣΗΣ ΚΕΝΤΡΩΝ ΠΑΡΟΧΗΣ ΥΠΗΡΕΣΙΩΝ ΣΕ ΔΙΚΤΥΟ. [Internet] [Thesis]. Πανεπιστήμιο Μακεδονίας Οικονομικών και Κοινωνικών Επιστημών; University of Macedonia Economic and Social Sciences; 1991. [cited 2020 Oct 31]. Available from: http://hdl.handle.net/10442/hedi/1746.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

ΣΑΤΡΑΤΖΕΜΗ . ΕΠΙΛΥΣΗ ΠΡΟΒΛΗΜΑΤΩΝ ΧΩΡΟΘΕΤΗΣΗΣ ΚΕΝΤΡΩΝ ΠΑΡΟΧΗΣ ΥΠΗΡΕΣΙΩΝ ΣΕ ΔΙΚΤΥΟ. [Thesis]. Πανεπιστήμιο Μακεδονίας Οικονομικών και Κοινωνικών Επιστημών; University of Macedonia Economic and Social Sciences; 1991. Available from: http://hdl.handle.net/10442/hedi/1746

Not specified: Masters Thesis or Doctoral Dissertation