Advanced search options

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

You searched for `subject:(Maximum weight clique problem)`

.
Showing records 1 – 30 of
14699 total matches.

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

Search Limiters

Dates

- 2015 – 2019 (4469)
- 2010 – 2014 (5447)
- 2005 – 2009 (2919)
- 2000 – 2004 (945)
- 1995 – 1999 (429)
- 1990 – 1994 (349)
- 1985 – 1989 (289)
- 1980 – 1984 (240)
- 1975 – 1979 (185)
- 1970 – 1974 (139)

Universities

- University of Florida (515)
- Brno University of Technology (365)
- University of São Paulo (310)
- Virginia Tech (265)
- Texas A&M University (193)
- The Ohio State University (186)
- NSYSU (184)
- Michigan State University (173)
- Universidade do Rio Grande do Sul (151)
- Université de Montréal (128)
- Georgia Tech (123)
- National University of Singapore (122)
- University of Illinois – Urbana-Champaign (122)
- Penn State University (116)
- University of North Texas (108)

Department

- Psychology (296)
- Mathematics (195)
- Education (121)
- Computer Science (106)
- Electrical and Computer Engineering (89)
- Informatique (88)
- Electrical Engineering (84)
- Statistics (75)
- Mathématiques (73)
- Mechanical Engineering (73)
- Graduate School (69)
- Industrial and Systems Engineering (65)
- Applied Mathematics (62)
- Economics (52)
- Nursing (49)

Degrees

Levels

- doctoral (4586)
- masters (2844)
- thesis (279)
- project (26)
- dissertation (22)
- doctor of philosophy ph.d. (21)
- doctor of philosophy (ph.d.) (15)

Languages

Country

- US (5695)
- Canada (1124)
- Brazil (1105)
- Sweden (826)
- France (740)
- Australia (550)
- South Africa (422)
- Greece (404)
- Netherlands (403)
- UK (373)
- Czech Republic (370)
- New Zealand (289)
- Portugal (258)
- India (243)
- Japan (199)

▼ Search Limiters

1.
Araujo Tavares, Wladimir.
Algoritmos exatos para problema da *clique* maxima ponderada : Algorithmes pour le problème de la *clique* de poids * maximum*.

Degree: Docteur es, Informatique, 2016, Avignon; Universidade federal do Ceará

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

►

Dans ce travail, nous présentons trois nouveaux algorithmes pour le problème de la *clique* de poids *maximum*. Les trois algorithmes dépendent d'un ordre initial des…
(more)

Subjects/Keywords: Clique de poids maximum; Coloration pondérée; Séparation et évaluation; Poupées russes; Resolution search; Maximum weight clique problem; Weighted integer coloring heuristic; Branch and Bound; Russian dolls; Resolution search; 004

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Araujo Tavares, W. (2016). Algoritmos exatos para problema da clique maxima ponderada : Algorithmes pour le problème de la clique de poids maximum. (Doctoral Dissertation). Avignon; Universidade federal do Ceará. Retrieved from http://www.theses.fr/2016AVIG0211

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

Araujo Tavares, Wladimir. “Algoritmos exatos para problema da clique maxima ponderada : Algorithmes pour le problème de la clique de poids maximum.” 2016. Doctoral Dissertation, Avignon; Universidade federal do Ceará. Accessed November 20, 2019. http://www.theses.fr/2016AVIG0211.

MLA Handbook (7^{th} Edition):

Araujo Tavares, Wladimir. “Algoritmos exatos para problema da clique maxima ponderada : Algorithmes pour le problème de la clique de poids maximum.” 2016. Web. 20 Nov 2019.

Vancouver:

Araujo Tavares W. Algoritmos exatos para problema da clique maxima ponderada : Algorithmes pour le problème de la clique de poids maximum. [Internet] [Doctoral dissertation]. Avignon; Universidade federal do Ceará; 2016. [cited 2019 Nov 20]. Available from: http://www.theses.fr/2016AVIG0211.

Council of Science Editors:

Araujo Tavares W. Algoritmos exatos para problema da clique maxima ponderada : Algorithmes pour le problème de la clique de poids maximum. [Doctoral Dissertation]. Avignon; Universidade federal do Ceará; 2016. Available from: http://www.theses.fr/2016AVIG0211

University of Iowa

2. 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 November 20, 2019. 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. 20 Nov 2019.

Vancouver:

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

Texas A&M University

3.
Balasundaram, Balabhaskar.
Graph theoretic generalizations of *clique*: optimization and extensions.

Degree: 2009, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-1539

► This dissertation considers graph theoretic generalizations of the *maximum* *clique* *problem*. Models that were originally proposed in social network analysis literature, are investigated from a…
(more)

Subjects/Keywords: maximum clique problem; combinatorial optimization; integer programming; social network analysis; data-mining

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Balasundaram, B. (2009). Graph theoretic generalizations of clique: optimization and extensions. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1539

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

Balasundaram, Balabhaskar. “Graph theoretic generalizations of clique: optimization and extensions.” 2009. Thesis, Texas A&M University. Accessed November 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1539.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Balasundaram, Balabhaskar. “Graph theoretic generalizations of clique: optimization and extensions.” 2009. Web. 20 Nov 2019.

Vancouver:

Balasundaram B. Graph theoretic generalizations of clique: optimization and extensions. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1539.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Balasundaram B. Graph theoretic generalizations of clique: optimization and extensions. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1539

Not specified: Masters Thesis or Doctoral Dissertation

4. Balaji, S. Effective heuristics on graph optimization problems;.

Degree: Graph optimization problems, 2014, SASTRA University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/17548

►

Minimum vertex cover, *Maximum* *clique* and Minimum connected dominating set problems are well known Graph Optimization problems. These problems are shown to be NP-complete by…
(more)

Subjects/Keywords: Graph optimization; Maximum clique; Minimum vertex

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Balaji, S. (2014). Effective heuristics on graph optimization problems;. (Thesis). SASTRA University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/17548

Not specified: Masters Thesis or Doctoral Dissertation

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

Balaji, S. “Effective heuristics on graph optimization problems;.” 2014. Thesis, SASTRA University. Accessed November 20, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/17548.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Balaji, S. “Effective heuristics on graph optimization problems;.” 2014. Web. 20 Nov 2019.

Vancouver:

Balaji S. Effective heuristics on graph optimization problems;. [Internet] [Thesis]. SASTRA University; 2014. [cited 2019 Nov 20]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/17548.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Balaji S. Effective heuristics on graph optimization problems;. [Thesis]. SASTRA University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/17548

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

5. Buchanan, Austin Loyd. Parameterized Approaches for Large-Scale Optimization Problems.

Degree: 2015, Texas A&M University

URL: http://hdl.handle.net/1969.1/155568

► In this dissertation, we study challenging discrete optimization problems from the perspective of parameterized complexity. The usefulness of this type of analysis is twofold. First,…
(more)

Subjects/Keywords: parameterized complexity; integer programming; extended formulations; fixed-parameter tractable; combinatorial optimization; Steiner tree; node-weighted Steiner tree; maximum-weight connected subgraph; vertex cover; independent set; maximum clique; degeneracy; conflict graph; 0-1 program; treewidth; independence system; extension complexity; exponential time hypothesis; cardinality constraint; polyhedra; polytope; algorithm; connectivity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Buchanan, A. L. (2015). Parameterized Approaches for Large-Scale Optimization Problems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155568

Not specified: Masters Thesis or Doctoral Dissertation

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

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Thesis, Texas A&M University. Accessed November 20, 2019. http://hdl.handle.net/1969.1/155568.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Web. 20 Nov 2019.

Vancouver:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1969.1/155568.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155568

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

6.
Shirokikh, Oleg A.
Degree-Based *Clique* Relaxations Theoretical Bounds, Computational Issues, and Applications.

Degree: PhD, Industrial and Systems Engineering, 2013, University of Florida

URL: http://ufdc.ufl.edu/UFE0046078

► This dissertation considers degree-based *clique* relaxations and their applications in real-world settings. A significant part of the study is devoted to two *clique* relaxation models,…
(more)

Subjects/Keywords: Corporations; Finance; Financial investments; Financial portfolios; Investment banking; Outliers; Property trusts; Stock markets; Time series; Vertices; clique-relaxations – data-mining – maximum-clique – maximum-s-defective-clique – maximum-s-plex – optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shirokikh, O. A. (2013). Degree-Based Clique Relaxations Theoretical Bounds, Computational Issues, and Applications. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0046078

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

Shirokikh, Oleg A. “Degree-Based Clique Relaxations Theoretical Bounds, Computational Issues, and Applications.” 2013. Doctoral Dissertation, University of Florida. Accessed November 20, 2019. http://ufdc.ufl.edu/UFE0046078.

MLA Handbook (7^{th} Edition):

Shirokikh, Oleg A. “Degree-Based Clique Relaxations Theoretical Bounds, Computational Issues, and Applications.” 2013. Web. 20 Nov 2019.

Vancouver:

Shirokikh OA. Degree-Based Clique Relaxations Theoretical Bounds, Computational Issues, and Applications. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2019 Nov 20]. Available from: http://ufdc.ufl.edu/UFE0046078.

Council of Science Editors:

Shirokikh OA. Degree-Based Clique Relaxations Theoretical Bounds, Computational Issues, and Applications. [Doctoral Dissertation]. University of Florida; 2013. Available from: http://ufdc.ufl.edu/UFE0046078

Kent State University

7.
Bhaduri, Sudipta.
Finding A *Maximum* *Clique* of A Chordal Graph by Removing
Vertices of Minimum Degree.

Degree: MS, College of Arts and Sciences / Department of Mathematical Science, 2008, Kent State University

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

► A graph is chordal if each of its cycles of four or more nodes has a chord, which is an edge joining two nodes that…
(more)

Subjects/Keywords: Computer Science; Minimum Degree Ordering; M.D.O; Maximum Clique

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bhaduri, S. (2008). Finding A Maximum Clique of A Chordal Graph by Removing Vertices of Minimum Degree. (Masters Thesis). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1208869783

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

Bhaduri, Sudipta. “Finding A Maximum Clique of A Chordal Graph by Removing Vertices of Minimum Degree.” 2008. Masters Thesis, Kent State University. Accessed November 20, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=kent1208869783.

MLA Handbook (7^{th} Edition):

Bhaduri, Sudipta. “Finding A Maximum Clique of A Chordal Graph by Removing Vertices of Minimum Degree.” 2008. Web. 20 Nov 2019.

Vancouver:

Bhaduri S. Finding A Maximum Clique of A Chordal Graph by Removing Vertices of Minimum Degree. [Internet] [Masters thesis]. Kent State University; 2008. [cited 2019 Nov 20]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1208869783.

Council of Science Editors:

Bhaduri S. Finding A Maximum Clique of A Chordal Graph by Removing Vertices of Minimum Degree. [Masters Thesis]. Kent State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1208869783

University of Waterloo

8. Xiang, Jingen. Scalable Scientific Computing Algorithms Using MapReduce.

Degree: 2013, University of Waterloo

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

► Cloud computing systems, like MapReduce and Pregel, provide a scalable and fault tolerant environment for running computations at massive scale. However, these systems are designed…
(more)

Subjects/Keywords: Scientific Computing; Cloud Computing; MapReduce; Hadoop; Matrix Inversion; Maximum Clique

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xiang, J. (2013). Scalable Scientific Computing Algorithms Using MapReduce. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7830

Not specified: Masters Thesis or Doctoral Dissertation

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

Xiang, Jingen. “Scalable Scientific Computing Algorithms Using MapReduce.” 2013. Thesis, University of Waterloo. Accessed November 20, 2019. http://hdl.handle.net/10012/7830.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Xiang, Jingen. “Scalable Scientific Computing Algorithms Using MapReduce.” 2013. Web. 20 Nov 2019.

Vancouver:

Xiang J. Scalable Scientific Computing Algorithms Using MapReduce. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/10012/7830.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xiang J. Scalable Scientific Computing Algorithms Using MapReduce. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/7830

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

9.
Ames, Brendan.
Convex relaxation for the planted *clique*, biclique, and clustering problems.

Degree: 2011, University of Waterloo

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

► A *clique* of a graph G is a set of pairwise adjacent nodes of G. Similarly, a biclique (U, V ) of a bipartite graph…
(more)

Subjects/Keywords: nuclear norm minimization; convex optimization; maximum clique; clustering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ames, B. (2011). Convex relaxation for the planted clique, biclique, and clustering problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6113

Not specified: Masters Thesis or Doctoral Dissertation

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

Ames, Brendan. “Convex relaxation for the planted clique, biclique, and clustering problems.” 2011. Thesis, University of Waterloo. Accessed November 20, 2019. http://hdl.handle.net/10012/6113.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ames, Brendan. “Convex relaxation for the planted clique, biclique, and clustering problems.” 2011. Web. 20 Nov 2019.

Vancouver:

Ames B. Convex relaxation for the planted clique, biclique, and clustering problems. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/10012/6113.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ames B. Convex relaxation for the planted clique, biclique, and clustering problems. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6113

Not specified: Masters Thesis or Doctoral Dissertation

University of Georgia

10. Kwon, Kyongboon. Peer nomination patterns and social identification in the context of children's cliques and friendship groups in middle childhood.

Degree: PhD, School Psychology, 2008, University of Georgia

URL: http://purl.galileo.usg.edu/uga_etd/kwon_kyongboon_200808_phd

► The overarching goal of the dissertation research was to examine the impact of the peer group context on children’s peer-related perceptions and behaviors. The first…
(more)

Subjects/Keywords: Clique

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kwon, K. (2008). Peer nomination patterns and social identification in the context of children's cliques and friendship groups in middle childhood. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/kwon_kyongboon_200808_phd

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

Kwon, Kyongboon. “Peer nomination patterns and social identification in the context of children's cliques and friendship groups in middle childhood.” 2008. Doctoral Dissertation, University of Georgia. Accessed November 20, 2019. http://purl.galileo.usg.edu/uga_etd/kwon_kyongboon_200808_phd.

MLA Handbook (7^{th} Edition):

Kwon, Kyongboon. “Peer nomination patterns and social identification in the context of children's cliques and friendship groups in middle childhood.” 2008. Web. 20 Nov 2019.

Vancouver:

Kwon K. Peer nomination patterns and social identification in the context of children's cliques and friendship groups in middle childhood. [Internet] [Doctoral dissertation]. University of Georgia; 2008. [cited 2019 Nov 20]. Available from: http://purl.galileo.usg.edu/uga_etd/kwon_kyongboon_200808_phd.

Council of Science Editors:

Kwon K. Peer nomination patterns and social identification in the context of children's cliques and friendship groups in middle childhood. [Doctoral Dissertation]. University of Georgia; 2008. Available from: http://purl.galileo.usg.edu/uga_etd/kwon_kyongboon_200808_phd

11. Sajjadi, Seyed Javad. Novel Models and Efficient Algorithms for Network-based Optimization in Biomedical Applications.

Degree: 2014, University of South Florida

URL: https://scholarcommons.usf.edu/etd/5300

► We introduce and study a novel graph optimization *problem* to search for multiple cliques with the *maximum* overall *weight*, to which we denote as the…
(more)

Subjects/Keywords: Biomarker Identication; Column Generation; Combinatorial Optimization; Integer Programming; Maximum Clique Problem; Industrial Engineering

…*maximum* overall *weight*, to which we denote as the *Maximum* Weighted
Multiple *Clique* *Problem* (… …LIST OF FIGURES
Figure 1
A solution of the *Maximum* Weighted *Clique* *Problem*… …7
Figure 2
A solution of the *Maximum* Weighted Multiple *Clique* *Problem*… …*problem* as a network optimization *problem* to search for a *Maximum* Weighted
*Clique* (MWC)… …the *Maximum* Weighted *Clique*
*Problem* (MWCP) the objective is to find a *clique* C…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sajjadi, S. J. (2014). Novel Models and Efficient Algorithms for Network-based Optimization in Biomedical Applications. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/5300

Not specified: Masters Thesis or Doctoral Dissertation

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

Sajjadi, Seyed Javad. “Novel Models and Efficient Algorithms for Network-based Optimization in Biomedical Applications.” 2014. Thesis, University of South Florida. Accessed November 20, 2019. https://scholarcommons.usf.edu/etd/5300.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sajjadi, Seyed Javad. “Novel Models and Efficient Algorithms for Network-based Optimization in Biomedical Applications.” 2014. Web. 20 Nov 2019.

Vancouver:

Sajjadi SJ. Novel Models and Efficient Algorithms for Network-based Optimization in Biomedical Applications. [Internet] [Thesis]. University of South Florida; 2014. [cited 2019 Nov 20]. Available from: https://scholarcommons.usf.edu/etd/5300.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sajjadi SJ. Novel Models and Efficient Algorithms for Network-based Optimization in Biomedical Applications. [Thesis]. University of South Florida; 2014. Available from: https://scholarcommons.usf.edu/etd/5300

Not specified: Masters Thesis or Doctoral Dissertation

12. Douik, Ahmed S. Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications.

Degree: 2015, King Abdullah University of Science and Technology

URL: http://hdl.handle.net/10754/552541

► From its introduction to its quindecennial, network coding have built a strong reputation in enhancing packet recovery process and achieving *maximum* information flow in both…
(more)

Subjects/Keywords: Network Coding; Completion Time; Decoding Delay; Graph theory; Game Theory; Maximum Weigh Clique Problem

…*weight* is the sum of the individual weights. Note that packet 1 and 3
are required by the same… …*problem* in real-time without
knowing future channel erasures), as they involve the… …provide a comprehensive description of the different types, graph models, *problem* formulations… …processes, Network Coding has been introduced as a new paradigm that
attains *maximum* information… …authors examined the *problem* of minimizing the queue size at the sender
and in [74]…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Douik, A. S. (2015). Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications. (Thesis). King Abdullah University of Science and Technology. Retrieved from http://hdl.handle.net/10754/552541

Not specified: Masters Thesis or Doctoral Dissertation

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

Douik, Ahmed S. “Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications.” 2015. Thesis, King Abdullah University of Science and Technology. Accessed November 20, 2019. http://hdl.handle.net/10754/552541.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Douik, Ahmed S. “Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications.” 2015. Web. 20 Nov 2019.

Vancouver:

Douik AS. Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications. [Internet] [Thesis]. King Abdullah University of Science and Technology; 2015. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/10754/552541.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Douik AS. Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications. [Thesis]. King Abdullah University of Science and Technology; 2015. Available from: http://hdl.handle.net/10754/552541

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

13. Cisneros Saldana, Jorge Ignacio Domingo. Network-based Optimization Techniques for Wind Farm Location Decisions.

Degree: MS, Energy, 2017, Texas A&M University

URL: http://hdl.handle.net/1969.1/165853

► This thesis develops network-based approaches to analysis and optimization of wind energy systems. The wind energy system is a complex system that produces a massive…
(more)

Subjects/Keywords: optimization; wind; energy systems; network analysis; maximum clique; maximum k-plex, dominating set; integer programming; cost analysis; potential wind farm locations

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cisneros Saldana, J. I. D. (2017). Network-based Optimization Techniques for Wind Farm Location Decisions. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/165853

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

Cisneros Saldana, Jorge Ignacio Domingo. “Network-based Optimization Techniques for Wind Farm Location Decisions.” 2017. Masters Thesis, Texas A&M University. Accessed November 20, 2019. http://hdl.handle.net/1969.1/165853.

MLA Handbook (7^{th} Edition):

Cisneros Saldana, Jorge Ignacio Domingo. “Network-based Optimization Techniques for Wind Farm Location Decisions.” 2017. Web. 20 Nov 2019.

Vancouver:

Cisneros Saldana JID. Network-based Optimization Techniques for Wind Farm Location Decisions. [Internet] [Masters thesis]. Texas A&M University; 2017. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1969.1/165853.

Council of Science Editors:

Cisneros Saldana JID. Network-based Optimization Techniques for Wind Farm Location Decisions. [Masters Thesis]. Texas A&M University; 2017. Available from: http://hdl.handle.net/1969.1/165853

University of Canterbury

14.
Lee, Sang Myung (Chris).
Sub-cubic Time Algorithm for the k-disjoint *Maximum* subarray * Problem*.

Degree: Computer Science and Software Engineering, 2011, University of Canterbury

URL: http://hdl.handle.net/10092/6494

► The *maximum* subarray *problem* is to find the array portion that maximizes the sum of array elements in it. This *problem* was first introduced by…
(more)

Subjects/Keywords: Maximum Subarray Problem; Distance Matrix Multiplication; k-maximum Subarray Problem; k-disjoint Maximum Subarray Problem; Table-Lookup; X+Y Problem

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lee, S. M. (. (2011). Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem. (Thesis). University of Canterbury. Retrieved from http://hdl.handle.net/10092/6494

Not specified: Masters Thesis or Doctoral Dissertation

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

Lee, Sang Myung (Chris). “Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem.” 2011. Thesis, University of Canterbury. Accessed November 20, 2019. http://hdl.handle.net/10092/6494.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lee, Sang Myung (Chris). “Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem.” 2011. Web. 20 Nov 2019.

Vancouver:

Lee SM(. Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem. [Internet] [Thesis]. University of Canterbury; 2011. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/10092/6494.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lee SM(. Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem. [Thesis]. University of Canterbury; 2011. Available from: http://hdl.handle.net/10092/6494

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

15. Burle, Sai Kiran. Optimal heavy-traffic queue length scaling in an incompletely saturated switch.

Degree: MS, Electrical & Computer Engr, 2017, University of Illinois – Urbana-Champaign

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

► We consider an input queued switch operating under the MaxWeight scheduling algorithm. This system is interesting to study because it is a model for Internet…
(more)

Subjects/Keywords: Switch; Maximum weight scheduling; Data center; MaxWeight

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Burle, S. K. (2017). Optimal heavy-traffic queue length scaling in an incompletely saturated switch. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97777

Not specified: Masters Thesis or Doctoral Dissertation

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

Burle, Sai Kiran. “Optimal heavy-traffic queue length scaling in an incompletely saturated switch.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed November 20, 2019. http://hdl.handle.net/2142/97777.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Burle, Sai Kiran. “Optimal heavy-traffic queue length scaling in an incompletely saturated switch.” 2017. Web. 20 Nov 2019.

Vancouver:

Burle SK. Optimal heavy-traffic queue length scaling in an incompletely saturated switch. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/2142/97777.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Burle SK. Optimal heavy-traffic queue length scaling in an incompletely saturated switch. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97777

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

16. Stozhkov, Vladimir Dmitrievich. Combinatorial Optimization Problems in Network Robustness.

Degree: PhD, Industrial and Systems Engineering, 2015, University of Florida

URL: http://ufdc.ufl.edu/UFE0049146

Subjects/Keywords: bilevel-programming; clique-relaxation; interdiction; maximum-clique; motzkin-straus-formulation; power-law-graphs; robust-networks; s-defective-clique; s-plex

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Stozhkov, V. D. (2015). Combinatorial Optimization Problems in Network Robustness. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0049146

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

Stozhkov, Vladimir Dmitrievich. “Combinatorial Optimization Problems in Network Robustness.” 2015. Doctoral Dissertation, University of Florida. Accessed November 20, 2019. http://ufdc.ufl.edu/UFE0049146.

MLA Handbook (7^{th} Edition):

Stozhkov, Vladimir Dmitrievich. “Combinatorial Optimization Problems in Network Robustness.” 2015. Web. 20 Nov 2019.

Vancouver:

Stozhkov VD. Combinatorial Optimization Problems in Network Robustness. [Internet] [Doctoral dissertation]. University of Florida; 2015. [cited 2019 Nov 20]. Available from: http://ufdc.ufl.edu/UFE0049146.

Council of Science Editors:

Stozhkov VD. Combinatorial Optimization Problems in Network Robustness. [Doctoral Dissertation]. University of Florida; 2015. Available from: http://ufdc.ufl.edu/UFE0049146

17. Hume, Thomas. Practical and theoretical approaches for module analysis of protein-protein interaction networks : Approches pratiques et théoriques pour l'analyse de modules au sein de réseaux d'interaction protéine-protéine.

Degree: Docteur es, Informatique, 2016, Bordeaux

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

►

Un des principaux défis de la bioinformatique moderne est de saisir le sens des données biologiques en constante croissance. Il est prépondérant de trouver de… (more)

Subjects/Keywords: Bioinformatique; Optimisation combinatoire; Maximum-Weight Connected Subgraph; Recherche de modules biologiques; Bioinformatics; Combinatorial optimization; Maximum-Weight Connected Subgraph; Biological module discovery

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hume, T. (2016). Practical and theoretical approaches for module analysis of protein-protein interaction networks : Approches pratiques et théoriques pour l'analyse de modules au sein de réseaux d'interaction protéine-protéine. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2016BORD0006

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

Hume, Thomas. “Practical and theoretical approaches for module analysis of protein-protein interaction networks : Approches pratiques et théoriques pour l'analyse de modules au sein de réseaux d'interaction protéine-protéine.” 2016. Doctoral Dissertation, Bordeaux. Accessed November 20, 2019. http://www.theses.fr/2016BORD0006.

MLA Handbook (7^{th} Edition):

Hume, Thomas. “Practical and theoretical approaches for module analysis of protein-protein interaction networks : Approches pratiques et théoriques pour l'analyse de modules au sein de réseaux d'interaction protéine-protéine.” 2016. Web. 20 Nov 2019.

Vancouver:

Hume T. Practical and theoretical approaches for module analysis of protein-protein interaction networks : Approches pratiques et théoriques pour l'analyse de modules au sein de réseaux d'interaction protéine-protéine. [Internet] [Doctoral dissertation]. Bordeaux; 2016. [cited 2019 Nov 20]. Available from: http://www.theses.fr/2016BORD0006.

Council of Science Editors:

Hume T. Practical and theoretical approaches for module analysis of protein-protein interaction networks : Approches pratiques et théoriques pour l'analyse de modules au sein de réseaux d'interaction protéine-protéine. [Doctoral Dissertation]. Bordeaux; 2016. Available from: http://www.theses.fr/2016BORD0006

California State University – Sacramento

18.
Stratton, Theresa Marie.
Functional assessment and behavioral interventions for *weight* loss in overweight individuals.

Degree: MA, Psychology (Applied Behavior Analysis, 2011, California State University – Sacramento

URL: http://hdl.handle.net/10211.9/970

► Functional assessment is a part of behavior analysis used to determine the function of a behavior *problem*; however, the researcher did not find the use…
(more)

Subjects/Keywords: Behavior management for weight loss; Self-monitoring for weight loss; Problem solving for weight loss

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Stratton, T. M. (2011). Functional assessment and behavioral interventions for weight loss in overweight individuals. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.9/970

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

Stratton, Theresa Marie. “Functional assessment and behavioral interventions for weight loss in overweight individuals.” 2011. Masters Thesis, California State University – Sacramento. Accessed November 20, 2019. http://hdl.handle.net/10211.9/970.

MLA Handbook (7^{th} Edition):

Stratton, Theresa Marie. “Functional assessment and behavioral interventions for weight loss in overweight individuals.” 2011. Web. 20 Nov 2019.

Vancouver:

Stratton TM. Functional assessment and behavioral interventions for weight loss in overweight individuals. [Internet] [Masters thesis]. California State University – Sacramento; 2011. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/10211.9/970.

Council of Science Editors:

Stratton TM. Functional assessment and behavioral interventions for weight loss in overweight individuals. [Masters Thesis]. California State University – Sacramento; 2011. Available from: http://hdl.handle.net/10211.9/970

19.
Janićijević Stefana.
Metode promena formulacija i okolina za *problem* maksimalne klike grafa.

Degree: 2016, University of Novi Sad

URL: http://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija146796914413639.pdf?controlNumber=(BISIS)101446&fileName=146796914413639.pdf&id=6337&source=OATD&language=en ; http://www.cris.uns.ac.rs/record.jsf?recordId=101446&source=OATD&language=en

►

Doktorska disertacija se bavi temama rešavanja računarski teških problema kombinatorne optimizacije. Istaknut je *problem* maksimalne klike kao predstavnik određenih struktura u grafovima. *Problem* maksimalne…
(more)

Subjects/Keywords: Maksimalna klika, Metoda promenljivih okolina, Pretraga kroz prostor formulacija, Modeli, Globalna optimizacija, Velike baze podataka; Variable Neighborhood Search, Formulation Space Search, Maximum Clique Global Optimization, Models, Big Data

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Stefana, J. (2016). Metode promena formulacija i okolina za problem maksimalne klike grafa. (Thesis). University of Novi Sad. Retrieved from http://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija146796914413639.pdf?controlNumber=(BISIS)101446&fileName=146796914413639.pdf&id=6337&source=OATD&language=en ; http://www.cris.uns.ac.rs/record.jsf?recordId=101446&source=OATD&language=en

Not specified: Masters Thesis or Doctoral Dissertation

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

Stefana, Janićijević. “Metode promena formulacija i okolina za problem maksimalne klike grafa.” 2016. Thesis, University of Novi Sad. Accessed November 20, 2019. http://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija146796914413639.pdf?controlNumber=(BISIS)101446&fileName=146796914413639.pdf&id=6337&source=OATD&language=en ; http://www.cris.uns.ac.rs/record.jsf?recordId=101446&source=OATD&language=en.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Stefana, Janićijević. “Metode promena formulacija i okolina za problem maksimalne klike grafa.” 2016. Web. 20 Nov 2019.

Vancouver:

Stefana J. Metode promena formulacija i okolina za problem maksimalne klike grafa. [Internet] [Thesis]. University of Novi Sad; 2016. [cited 2019 Nov 20]. Available from: http://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija146796914413639.pdf?controlNumber=(BISIS)101446&fileName=146796914413639.pdf&id=6337&source=OATD&language=en ; http://www.cris.uns.ac.rs/record.jsf?recordId=101446&source=OATD&language=en.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Stefana J. Metode promena formulacija i okolina za problem maksimalne klike grafa. [Thesis]. University of Novi Sad; 2016. Available from: http://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija146796914413639.pdf?controlNumber=(BISIS)101446&fileName=146796914413639.pdf&id=6337&source=OATD&language=en ; http://www.cris.uns.ac.rs/record.jsf?recordId=101446&source=OATD&language=en

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

20.
Sethuraman, Samyukta.
On Fork-Join Queues and *Maximum* Ratio Cliques.

Degree: 2015, Texas A&M University

URL: http://hdl.handle.net/1969.1/156160

► This dissertation consists of two parts. The ?rst part delves into the *problem* of response time estimation in fork-join queueing networks. These systems have been…
(more)

Subjects/Keywords: Fork-Join Network; Queueing; Communications Network; Assembly Network; Parallel Processing; Synchronization; Maximum Clique; Fractional Combinatorial Optimization; Social Network Analysis; Market Graph; Wind Energy

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sethuraman, S. (2015). On Fork-Join Queues and Maximum Ratio Cliques. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/156160

Not specified: Masters Thesis or Doctoral Dissertation

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

Sethuraman, Samyukta. “On Fork-Join Queues and Maximum Ratio Cliques.” 2015. Thesis, Texas A&M University. Accessed November 20, 2019. http://hdl.handle.net/1969.1/156160.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sethuraman, Samyukta. “On Fork-Join Queues and Maximum Ratio Cliques.” 2015. Web. 20 Nov 2019.

Vancouver:

Sethuraman S. On Fork-Join Queues and Maximum Ratio Cliques. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1969.1/156160.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sethuraman S. On Fork-Join Queues and Maximum Ratio Cliques. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/156160

Not specified: Masters Thesis or Doctoral Dissertation

21.
Rabern, Landon.
Coloring Graphs from Almost *Maximum* Degree Sized
Palettes.

Degree: PhD, Mathematics, 2013, Arizona State University

URL: http://repository.asu.edu/items/17753

► Every graph can be colored with one more color than its *maximum* degree. A well-known theorem of Brooks gives the precise conditions under which a…
(more)

Subjects/Keywords: Mathematics; Borodin-Kostochka; Brooks; clique; coloring; maximum degree

…every *maximum* *clique* with an independent set.
Theorem 1.1.5 (Kostochka [45]… …following result which shows that graphs having
*clique* number sufficiently close to their *maximum*… …degree contain an independent set
hitting every *maximum* *clique*. In [59] we improved… …*problem*. On some such encounters, the possible relations between our sorted things
are… …degenerate subgraph
with *maximum* degree at most r.
4
In fact, we proved a lemma stronger than…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rabern, L. (2013). Coloring Graphs from Almost Maximum Degree Sized Palettes. (Doctoral Dissertation). Arizona State University. Retrieved from http://repository.asu.edu/items/17753

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

Rabern, Landon. “Coloring Graphs from Almost Maximum Degree Sized Palettes.” 2013. Doctoral Dissertation, Arizona State University. Accessed November 20, 2019. http://repository.asu.edu/items/17753.

MLA Handbook (7^{th} Edition):

Rabern, Landon. “Coloring Graphs from Almost Maximum Degree Sized Palettes.” 2013. Web. 20 Nov 2019.

Vancouver:

Rabern L. Coloring Graphs from Almost Maximum Degree Sized Palettes. [Internet] [Doctoral dissertation]. Arizona State University; 2013. [cited 2019 Nov 20]. Available from: http://repository.asu.edu/items/17753.

Council of Science Editors:

Rabern L. Coloring Graphs from Almost Maximum Degree Sized Palettes. [Doctoral Dissertation]. Arizona State University; 2013. Available from: http://repository.asu.edu/items/17753

Universiteit Utrecht

22. Jong, J.W. de. The optimal power distribution for cycling a time trial.

Degree: 2015, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/323480

► In this thesis a *problem* of determining the optimal pacing strategy to minimize travel time is considered. The *problem* is restricted to a straight race…
(more)

Subjects/Keywords: Optimal Control Theory; Pontryagin's maximum principle; pacing strategy; minimum time problem

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jong, J. W. d. (2015). The optimal power distribution for cycling a time trial. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/323480

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

Jong, J W de. “The optimal power distribution for cycling a time trial.” 2015. Masters Thesis, Universiteit Utrecht. Accessed November 20, 2019. http://dspace.library.uu.nl:8080/handle/1874/323480.

MLA Handbook (7^{th} Edition):

Jong, J W de. “The optimal power distribution for cycling a time trial.” 2015. Web. 20 Nov 2019.

Vancouver:

Jong JWd. The optimal power distribution for cycling a time trial. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2019 Nov 20]. Available from: http://dspace.library.uu.nl:8080/handle/1874/323480.

Council of Science Editors:

Jong JWd. The optimal power distribution for cycling a time trial. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/323480

Delft University of Technology

23. De Jong, J.W. The optimal power distribution for cycling a time trial:.

Degree: 2015, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:52e70049-3902-4ac5-8588-38383335c1bc

► In this thesis a *problem* of determining the optimal pacing strategy to minimize travel time is considered. The *problem* is restricted to a straight race…
(more)

Subjects/Keywords: Pontryagin's maximum principle; Optimal Control Theory; Minimum time problem; pacing strategy

Record Details Similar Records

❌

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

APA (6^{th} Edition):

De Jong, J. W. (2015). The optimal power distribution for cycling a time trial:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:52e70049-3902-4ac5-8588-38383335c1bc

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

De Jong, J W. “The optimal power distribution for cycling a time trial:.” 2015. Masters Thesis, Delft University of Technology. Accessed November 20, 2019. http://resolver.tudelft.nl/uuid:52e70049-3902-4ac5-8588-38383335c1bc.

MLA Handbook (7^{th} Edition):

De Jong, J W. “The optimal power distribution for cycling a time trial:.” 2015. Web. 20 Nov 2019.

Vancouver:

De Jong JW. The optimal power distribution for cycling a time trial:. [Internet] [Masters thesis]. Delft University of Technology; 2015. [cited 2019 Nov 20]. Available from: http://resolver.tudelft.nl/uuid:52e70049-3902-4ac5-8588-38383335c1bc.

Council of Science Editors:

De Jong JW. The optimal power distribution for cycling a time trial:. [Masters Thesis]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:52e70049-3902-4ac5-8588-38383335c1bc

University of Illinois – Urbana-Champaign

24.
Roehl, Brian.
* Maximum*-entropy principle approach to the multiple travelling salesman

Degree: MS, 0133, 2012, University of Illinois – Urbana-Champaign

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

► This thesis presents an investigation into the applications of the *maximum*-entropy principle as a heuristic for the multiple travelling salesman *problem*. This is a computationally…
(more)

Subjects/Keywords: Maximum-Entropy Principle; Deterministic Annealing; Travelling Salesman Problem; Multiple Travelling Salesman Problem; Close Enough Travelling Salesman Problem

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Roehl, B. (2012). Maximum-entropy principle approach to the multiple travelling salesman problem and related problems. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/29735

Not specified: Masters Thesis or Doctoral Dissertation

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

Roehl, Brian. “Maximum-entropy principle approach to the multiple travelling salesman problem and related problems.” 2012. Thesis, University of Illinois – Urbana-Champaign. Accessed November 20, 2019. http://hdl.handle.net/2142/29735.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Roehl, Brian. “Maximum-entropy principle approach to the multiple travelling salesman problem and related problems.” 2012. Web. 20 Nov 2019.

Vancouver:

Roehl B. Maximum-entropy principle approach to the multiple travelling salesman problem and related problems. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2012. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/2142/29735.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Roehl B. Maximum-entropy principle approach to the multiple travelling salesman problem and related problems. [Thesis]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/29735

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

25. Lu, Zhaosong. Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming.

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

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

► The limiting behavior of weighted paths associated with the semidefinite program (SDP) map X^{1/2}SX^{1/2} was studied and some applications to error bound analysis and superlinear…
(more)

Subjects/Keywords: Semidefinite program; Weighted paths; Trust region subproblem; Maximum weight basis preconditioner; Preconditioned iterative linear solver; Convex quadratic program; Smooth saddle point problem; Mirror-prox algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lu, Z. (2005). Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/7151

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

Lu, Zhaosong. “Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming.” 2005. Doctoral Dissertation, Georgia Tech. Accessed November 20, 2019. http://hdl.handle.net/1853/7151.

MLA Handbook (7^{th} Edition):

Lu, Zhaosong. “Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming.” 2005. Web. 20 Nov 2019.

Vancouver:

Lu Z. Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming. [Internet] [Doctoral dissertation]. Georgia Tech; 2005. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1853/7151.

Council of Science Editors:

Lu Z. Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming. [Doctoral Dissertation]. Georgia Tech; 2005. Available from: http://hdl.handle.net/1853/7151

26. Ertem Oktay, Makbule Zeynep. Characterizing and Detecting Cohesive Subgroups with Applications to Social and Brain Networks.

Degree: 2015, Texas A&M University

URL: http://hdl.handle.net/1969.1/155698

► Many complex systems involve entities that interact with each other through various relationships (e.g., people in social systems, neurons in the brain). These entities and…
(more)

Subjects/Keywords: Clique relaxations; Clustering coefficient; Clustering algorithms; Integer programming; Graph theory; Combinatorial optimization; Computational complexity; Branch and bound; Social network analysis; Brain network analysis; Maximum independent union of cliques problem

…x5B;16, 2, 8, 1, 33]. *Maximum* *clique* *problem*
is one of the Karp’s 21 problems that are… …x5D; introduce the *maximum* disjoint union of *clique* *problem* (max
DUC), in which… …51
3.2
*Maximum* *clique*, *maximum* independent set and *maximum* independent union of cliques… …the treatment group. . . . . . .
86
4.12 *Maximum* *clique* size changes pre- and post… …3.1
3.2
3.3
3.4
Computational results of solving the *maximum* IUC *problem* using
branch and…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ertem Oktay, M. Z. (2015). Characterizing and Detecting Cohesive Subgroups with Applications to Social and Brain Networks. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155698

Not specified: Masters Thesis or Doctoral Dissertation

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

Ertem Oktay, Makbule Zeynep. “Characterizing and Detecting Cohesive Subgroups with Applications to Social and Brain Networks.” 2015. Thesis, Texas A&M University. Accessed November 20, 2019. http://hdl.handle.net/1969.1/155698.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ertem Oktay, Makbule Zeynep. “Characterizing and Detecting Cohesive Subgroups with Applications to Social and Brain Networks.” 2015. Web. 20 Nov 2019.

Vancouver:

Ertem Oktay MZ. Characterizing and Detecting Cohesive Subgroups with Applications to Social and Brain Networks. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1969.1/155698.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ertem Oktay MZ. Characterizing and Detecting Cohesive Subgroups with Applications to Social and Brain Networks. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155698

Not specified: Masters Thesis or Doctoral Dissertation

27. ZHANG YAN. NEURAL NETWORK BASED PARALLEL ALGORITHMS FOR SOLVING OPTIMIZATION PROBLEMS.

Degree: 2000, National University of Singapore

URL: https://scholarbank.nus.edu.sg/handle/10635/159042

Subjects/Keywords: Combinatorial optimization; artificial neural network; Hopfield network; coloring of graph; iso-structure of graph; maximum independent set; maximum clique; travelling salesman

Record Details Similar Records

❌

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

APA (6^{th} Edition):

YAN, Z. (2000). NEURAL NETWORK BASED PARALLEL ALGORITHMS FOR SOLVING OPTIMIZATION PROBLEMS. (Thesis). National University of Singapore. Retrieved from https://scholarbank.nus.edu.sg/handle/10635/159042

Not specified: Masters Thesis or Doctoral Dissertation

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

YAN, ZHANG. “NEURAL NETWORK BASED PARALLEL ALGORITHMS FOR SOLVING OPTIMIZATION PROBLEMS.” 2000. Thesis, National University of Singapore. Accessed November 20, 2019. https://scholarbank.nus.edu.sg/handle/10635/159042.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

YAN, ZHANG. “NEURAL NETWORK BASED PARALLEL ALGORITHMS FOR SOLVING OPTIMIZATION PROBLEMS.” 2000. Web. 20 Nov 2019.

Vancouver:

YAN Z. NEURAL NETWORK BASED PARALLEL ALGORITHMS FOR SOLVING OPTIMIZATION PROBLEMS. [Internet] [Thesis]. National University of Singapore; 2000. [cited 2019 Nov 20]. Available from: https://scholarbank.nus.edu.sg/handle/10635/159042.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

YAN Z. NEURAL NETWORK BASED PARALLEL ALGORITHMS FOR SOLVING OPTIMIZATION PROBLEMS. [Thesis]. National University of Singapore; 2000. Available from: https://scholarbank.nus.edu.sg/handle/10635/159042

Not specified: Masters Thesis or Doctoral Dissertation

28. ZHANG YAN. NEURAL NETWORK BASED PARALLEL ALGORITHMS FOR SOLVING OPTIMIZATION PROBLEMS.

Degree: 2000, National University of Singapore

URL: https://scholarbank.nus.edu.sg/handle/10635/160356

Subjects/Keywords: Combinatorial optimization; artificial neural network; Hopfield network; coloring of graph; iso-structure of graph; maximum independent set; maximum clique; travelling salesman

Record Details Similar Records

❌

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

APA (6^{th} Edition):

YAN, Z. (2000). NEURAL NETWORK BASED PARALLEL ALGORITHMS FOR SOLVING OPTIMIZATION PROBLEMS. (Thesis). National University of Singapore. Retrieved from https://scholarbank.nus.edu.sg/handle/10635/160356

Not specified: Masters Thesis or Doctoral Dissertation

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

YAN, ZHANG. “NEURAL NETWORK BASED PARALLEL ALGORITHMS FOR SOLVING OPTIMIZATION PROBLEMS.” 2000. Thesis, National University of Singapore. Accessed November 20, 2019. https://scholarbank.nus.edu.sg/handle/10635/160356.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

YAN, ZHANG. “NEURAL NETWORK BASED PARALLEL ALGORITHMS FOR SOLVING OPTIMIZATION PROBLEMS.” 2000. Web. 20 Nov 2019.

Vancouver:

YAN Z. NEURAL NETWORK BASED PARALLEL ALGORITHMS FOR SOLVING OPTIMIZATION PROBLEMS. [Internet] [Thesis]. National University of Singapore; 2000. [cited 2019 Nov 20]. Available from: https://scholarbank.nus.edu.sg/handle/10635/160356.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

YAN Z. NEURAL NETWORK BASED PARALLEL ALGORITHMS FOR SOLVING OPTIMIZATION PROBLEMS. [Thesis]. National University of Singapore; 2000. Available from: https://scholarbank.nus.edu.sg/handle/10635/160356

Not specified: Masters Thesis or Doctoral Dissertation

University of Southern California

29. Meidani, Hadi. Uncertainty management for complex systems of systems: applications to the future smart grid.

Degree: PhD, Civil Engineering, 2014, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/94167/rec/7655

► Today, many of the infrastructures are composed of several coupled sub-systems, many of which are by themselves complex, and further couplings introduce yet more complexities…
(more)

Subjects/Keywords: uncertainty quantification; Markov chains; random eigenvalue problem; maximum entropy; consensus problem; systems of systems; robust decision making; smart grid; structural dynamics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Meidani, H. (2014). Uncertainty management for complex systems of systems: applications to the future smart grid. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/94167/rec/7655

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

Meidani, Hadi. “Uncertainty management for complex systems of systems: applications to the future smart grid.” 2014. Doctoral Dissertation, University of Southern California. Accessed November 20, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/94167/rec/7655.

MLA Handbook (7^{th} Edition):

Meidani, Hadi. “Uncertainty management for complex systems of systems: applications to the future smart grid.” 2014. Web. 20 Nov 2019.

Vancouver:

Meidani H. Uncertainty management for complex systems of systems: applications to the future smart grid. [Internet] [Doctoral dissertation]. University of Southern California; 2014. [cited 2019 Nov 20]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/94167/rec/7655.

Council of Science Editors:

Meidani H. Uncertainty management for complex systems of systems: applications to the future smart grid. [Doctoral Dissertation]. University of Southern California; 2014. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/94167/rec/7655

University of Newcastle

30. Pérez-Rosés, Hebert. Large networks bounded in degree and diameter.

Degree: PhD, 2012, University of Newcastle

URL: http://hdl.handle.net/1959.13/933140

►

Research Doctorate - Doctor of Philosophy (PhD)

In the design of large interconnection networks several (and sometimes conflicting) factors come into play. Two of the… (more)

Subjects/Keywords: network design; Degree-Diameter Problem; mesh; hypercube; honeycomb; Degree-Diameter Subgraph Problem; Maximum Degree-and-Diameter Bounded Subgraph

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pérez-Rosés, H. (2012). Large networks bounded in degree and diameter. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/933140

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

Pérez-Rosés, Hebert. “Large networks bounded in degree and diameter.” 2012. Doctoral Dissertation, University of Newcastle. Accessed November 20, 2019. http://hdl.handle.net/1959.13/933140.

MLA Handbook (7^{th} Edition):

Pérez-Rosés, Hebert. “Large networks bounded in degree and diameter.” 2012. Web. 20 Nov 2019.

Vancouver:

Pérez-Rosés H. Large networks bounded in degree and diameter. [Internet] [Doctoral dissertation]. University of Newcastle; 2012. [cited 2019 Nov 20]. Available from: http://hdl.handle.net/1959.13/933140.

Council of Science Editors:

Pérez-Rosés H. Large networks bounded in degree and diameter. [Doctoral Dissertation]. University of Newcastle; 2012. Available from: http://hdl.handle.net/1959.13/933140