Advanced search options

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

You searched for `subject:(minimum cut)`

.
Showing records 1 – 15 of
15 total matches.

▼ Search Limiters

Clemson University

1. Hastings, Katherine. Algebraic Approaches to Stochastic Optimization.

Degree: PhD, Mathematical Science, 2012, Clemson University

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

► The dissertation presents algebraic approaches to the shortest path and maximum flow problems in stochastic networks. The goal of the stochastic shortest path problem is…
(more)

Subjects/Keywords: algebraic; majorization; maximum flow; minimum cut; shortest path; stochastic; Operations Research, Systems Engineering and Industrial Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hastings, K. (2012). Algebraic Approaches to Stochastic Optimization. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/935

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

Hastings, Katherine. “Algebraic Approaches to Stochastic Optimization.” 2012. Doctoral Dissertation, Clemson University. Accessed August 15, 2020. https://tigerprints.clemson.edu/all_dissertations/935.

MLA Handbook (7^{th} Edition):

Hastings, Katherine. “Algebraic Approaches to Stochastic Optimization.” 2012. Web. 15 Aug 2020.

Vancouver:

Hastings K. Algebraic Approaches to Stochastic Optimization. [Internet] [Doctoral dissertation]. Clemson University; 2012. [cited 2020 Aug 15]. Available from: https://tigerprints.clemson.edu/all_dissertations/935.

Council of Science Editors:

Hastings K. Algebraic Approaches to Stochastic Optimization. [Doctoral Dissertation]. Clemson University; 2012. Available from: https://tigerprints.clemson.edu/all_dissertations/935

University of Waterloo

2.
Ghaddar, Bissan.
A Branch-and-*Cut* Algorithm based on Semidefinite Programming for the *Minimum* k-Partition Problem.

Degree: 2007, University of Waterloo

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

► The *minimum* k-partition (MkP) problem is a well-known optimization problem encountered in various applications most notably in telecommunication and physics. Formulated in the early 1990s…
(more)

Subjects/Keywords: Minimum k-Partition; Convex Optimization; Semidefinite Programming; Branch-and-Cut

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ghaddar, B. (2007). A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/2766

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

Ghaddar, Bissan. “A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem.” 2007. Thesis, University of Waterloo. Accessed August 15, 2020. http://hdl.handle.net/10012/2766.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ghaddar, Bissan. “A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem.” 2007. Web. 15 Aug 2020.

Vancouver:

Ghaddar B. A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/10012/2766.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ghaddar B. A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/2766

Not specified: Masters Thesis or Doctoral Dissertation

3. Lu, Cheng. Efficient Algorithms for Markov Random Fields, Isotonic Regression, Graph Fused Lasso, and Image Segmentation.

Degree: Industrial Engineering & Operations Research, 2017, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/7xd7x5k3

► Markov random field (MRF) is a multi-label clustering model with applications in image segmentation, image deblurring, isotonic regression, graph fused lasso, and semi-supervised learning. It…
(more)

Subjects/Keywords: Operations research; Computer science; Industrial engineering; KKT; Minimum cut

…they are all in the maximal source set S0 of the *minimum*
*cut* in G0… …uses graph *minimum* *cut* technique inspired by the two provably fastest MRFalgorithms, with… …x7D;). A *minimum* *cut* in s, t-graph
Gst is an s, t-*cut* (S, T ) that minimizes… …*minimum* *cut* procedures that solve
parametric *minimum* cuts for all values of α in a complexity of… …solving a single *minimum*
s, t-*cut*. Procedures known to date that can be used as parametric…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lu, C. (2017). Efficient Algorithms for Markov Random Fields, Isotonic Regression, Graph Fused Lasso, and Image Segmentation. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/7xd7x5k3

Not specified: Masters Thesis or Doctoral Dissertation

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

Lu, Cheng. “Efficient Algorithms for Markov Random Fields, Isotonic Regression, Graph Fused Lasso, and Image Segmentation.” 2017. Thesis, University of California – Berkeley. Accessed August 15, 2020. http://www.escholarship.org/uc/item/7xd7x5k3.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lu, Cheng. “Efficient Algorithms for Markov Random Fields, Isotonic Regression, Graph Fused Lasso, and Image Segmentation.” 2017. Web. 15 Aug 2020.

Vancouver:

Lu C. Efficient Algorithms for Markov Random Fields, Isotonic Regression, Graph Fused Lasso, and Image Segmentation. [Internet] [Thesis]. University of California – Berkeley; 2017. [cited 2020 Aug 15]. Available from: http://www.escholarship.org/uc/item/7xd7x5k3.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lu C. Efficient Algorithms for Markov Random Fields, Isotonic Regression, Graph Fused Lasso, and Image Segmentation. [Thesis]. University of California – Berkeley; 2017. Available from: http://www.escholarship.org/uc/item/7xd7x5k3

Not specified: Masters Thesis or Doctoral Dissertation

4. WU GAOFENG. ENERGY EFFICIENT CONNECTION PROVISIONING IN IP OVER WDM NETWORKS.

Degree: 2014, National University of Singapore

URL: http://scholarbank.nus.edu.sg/handle/10635/120122

Subjects/Keywords: energy efficiency; optical networks; IP over WDM; traffic splitting; bandwidth varying; minimum cut

Record Details Similar Records

❌

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

APA (6^{th} Edition):

GAOFENG, W. (2014). ENERGY EFFICIENT CONNECTION PROVISIONING IN IP OVER WDM NETWORKS. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/120122

Not specified: Masters Thesis or Doctoral Dissertation

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

GAOFENG, WU. “ENERGY EFFICIENT CONNECTION PROVISIONING IN IP OVER WDM NETWORKS.” 2014. Thesis, National University of Singapore. Accessed August 15, 2020. http://scholarbank.nus.edu.sg/handle/10635/120122.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

GAOFENG, WU. “ENERGY EFFICIENT CONNECTION PROVISIONING IN IP OVER WDM NETWORKS.” 2014. Web. 15 Aug 2020.

Vancouver:

GAOFENG W. ENERGY EFFICIENT CONNECTION PROVISIONING IN IP OVER WDM NETWORKS. [Internet] [Thesis]. National University of Singapore; 2014. [cited 2020 Aug 15]. Available from: http://scholarbank.nus.edu.sg/handle/10635/120122.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

GAOFENG W. ENERGY EFFICIENT CONNECTION PROVISIONING IN IP OVER WDM NETWORKS. [Thesis]. National University of Singapore; 2014. Available from: http://scholarbank.nus.edu.sg/handle/10635/120122

Not specified: Masters Thesis or Doctoral Dissertation

Iowa State University

5.
Mikkelson, Rana C.
* Minimum* rank of graphs that allow loops.

Degree: 2008, Iowa State University

URL: https://lib.dr.iastate.edu/etd/11187

► The traditional "*minimum* rank problem" for simple graphs associates a set of symmetric matrices, the zero-nonzero pattern of whose off-diagonal entries are described by the…
(more)

Subjects/Keywords: cut vertex; graph; matrix; minimum rank; rank; zero-nonzero pattern; Mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mikkelson, R. C. (2008). Minimum rank of graphs that allow loops. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/11187

Not specified: Masters Thesis or Doctoral Dissertation

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

Mikkelson, Rana C. “Minimum rank of graphs that allow loops.” 2008. Thesis, Iowa State University. Accessed August 15, 2020. https://lib.dr.iastate.edu/etd/11187.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mikkelson, Rana C. “Minimum rank of graphs that allow loops.” 2008. Web. 15 Aug 2020.

Vancouver:

Mikkelson RC. Minimum rank of graphs that allow loops. [Internet] [Thesis]. Iowa State University; 2008. [cited 2020 Aug 15]. Available from: https://lib.dr.iastate.edu/etd/11187.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mikkelson RC. Minimum rank of graphs that allow loops. [Thesis]. Iowa State University; 2008. Available from: https://lib.dr.iastate.edu/etd/11187

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

6. Makovský, Benjamin. Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm.

Degree: 2020, Brno University of Technology

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

► This work describes the design of the graphic implementation of the Ford-Fulkerson Algorithm for searching the maximum flow and the minimal *cut* in the network.…
(more)

Subjects/Keywords: Graf; vrchol; hrana; síť; maximální tok; minimální řez; Ford-Fulkersonův algoritmus; Java applet.; Graph; node; edge; network; maximum flow; minimum cut; Ford-Fulkerson Algorithm; Java applet.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Makovský, B. (2020). Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/187853

Not specified: Masters Thesis or Doctoral Dissertation

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

Makovský, Benjamin. “Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm.” 2020. Thesis, Brno University of Technology. Accessed August 15, 2020. http://hdl.handle.net/11012/187853.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Makovský, Benjamin. “Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm.” 2020. Web. 15 Aug 2020.

Vancouver:

Makovský B. Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/11012/187853.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Makovský B. Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/187853

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

7. Makovský, Benjamin. Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm.

Degree: 2019, Brno University of Technology

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

► This work describes the design of the graphic implementation of the Ford-Fulkerson Algorithm for searching the maximum flow and the minimal *cut* in the network.…
(more)

Subjects/Keywords: Graf; vrchol; hrana; síť; maximální tok; minimální řez; Ford-Fulkersonův algoritmus; Java applet.; Graph; node; edge; network; maximum flow; minimum cut; Ford-Fulkerson Algorithm; Java applet.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Makovský, B. (2019). Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/56213

Not specified: Masters Thesis or Doctoral Dissertation

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

Makovský, Benjamin. “Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm.” 2019. Thesis, Brno University of Technology. Accessed August 15, 2020. http://hdl.handle.net/11012/56213.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Makovský, Benjamin. “Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm.” 2019. Web. 15 Aug 2020.

Vancouver:

Makovský B. Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/11012/56213.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Makovský B. Implementace Ford-Fulkersonova algoritmu: Implementation of Ford-Fulkerson Algorithm. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/56213

Not specified: Masters Thesis or Doctoral Dissertation

Pontifical Catholic University of Rio de Janeiro

8.
JOAO PAULO DE FREITAS ARAUJO.
[en] ALGORITHMS FOR PERFORMING THE COMPUTATION OF GOMORY HU
*CUT*-TREES.

Degree: 2017, Pontifical Catholic University of Rio de Janeiro

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

►

[pt] Calcular o valor do fluxo máximo entre um nó origem e um nó destino em uma rede é um problema clássico no contexto de… (more)

Subjects/Keywords: [pt] ANALISE DE SENSIBILIDADE; [en] SENSITIVITY ANALYSIS; [pt] CLUSTERIZACAO; [en] CLUSTERING; [pt] FLUXOS EM REDES MULTITERMINAIS; [en] MULTI-TERMINAL NETWORK FLOWS; [pt] CORTE MINIMO; [en] MINIMUM CUT; [pt] ARVORE DE CORTE; [en] CUT TREE

Record Details Similar Records

❌

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

APA (6^{th} Edition):

ARAUJO, J. P. D. F. (2017). [en] ALGORITHMS FOR PERFORMING THE COMPUTATION OF GOMORY HU CUT-TREES. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=32393

Not specified: Masters Thesis or Doctoral Dissertation

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

ARAUJO, JOAO PAULO DE FREITAS. “[en] ALGORITHMS FOR PERFORMING THE COMPUTATION OF GOMORY HU CUT-TREES.” 2017. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed August 15, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=32393.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

ARAUJO, JOAO PAULO DE FREITAS. “[en] ALGORITHMS FOR PERFORMING THE COMPUTATION OF GOMORY HU CUT-TREES.” 2017. Web. 15 Aug 2020.

Vancouver:

ARAUJO JPDF. [en] ALGORITHMS FOR PERFORMING THE COMPUTATION OF GOMORY HU CUT-TREES. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2017. [cited 2020 Aug 15]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=32393.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

ARAUJO JPDF. [en] ALGORITHMS FOR PERFORMING THE COMPUTATION OF GOMORY HU CUT-TREES. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2017. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=32393

Not specified: Masters Thesis or Doctoral Dissertation

Queensland University of Technology

9. Nourbakhsh, Ghavameddin. Reliability analysis and economic equipment replacement appraisal for substation and sub-transmission systems with explicit inclusion of non-repairable failures.

Degree: 2011, Queensland University of Technology

URL: https://eprints.qut.edu.au/40848/

► The modern society has come to expect the electrical energy on demand, while many of the facilities in power systems are aging beyond repair and…
(more)

Subjects/Keywords: power system reliability, substation reliability, sub-transmission reliability, distribution reliability, failure rate, outage, useful life, risk, aging, degradation, mean life, life cycle, bathtub curve, non-repairable, replacement, refurbishment; Markov model, enumeration method, maximum flow, minimum cut, contingency enumeration, frequency and duration, correlation, clustering, expected interruption cost

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nourbakhsh, G. (2011). Reliability analysis and economic equipment replacement appraisal for substation and sub-transmission systems with explicit inclusion of non-repairable failures. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/40848/

Not specified: Masters Thesis or Doctoral Dissertation

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

Nourbakhsh, Ghavameddin. “Reliability analysis and economic equipment replacement appraisal for substation and sub-transmission systems with explicit inclusion of non-repairable failures.” 2011. Thesis, Queensland University of Technology. Accessed August 15, 2020. https://eprints.qut.edu.au/40848/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Nourbakhsh, Ghavameddin. “Reliability analysis and economic equipment replacement appraisal for substation and sub-transmission systems with explicit inclusion of non-repairable failures.” 2011. Web. 15 Aug 2020.

Vancouver:

Nourbakhsh G. Reliability analysis and economic equipment replacement appraisal for substation and sub-transmission systems with explicit inclusion of non-repairable failures. [Internet] [Thesis]. Queensland University of Technology; 2011. [cited 2020 Aug 15]. Available from: https://eprints.qut.edu.au/40848/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nourbakhsh G. Reliability analysis and economic equipment replacement appraisal for substation and sub-transmission systems with explicit inclusion of non-repairable failures. [Thesis]. Queensland University of Technology; 2011. Available from: https://eprints.qut.edu.au/40848/

Not specified: Masters Thesis or Doctoral Dissertation

10. 伊, 麗娜. In vitro activity of sitafloxacin against Mycobacterium tuberculosis with gyrA/B mutations isolated in Japan : 日本で分離されたgyrA/B 変異結核菌株のin vitroでのシタフロキサシン活性の評価.

Degree: 博士(医学), 2017, Nagasaki University / 長崎大学

URL: http://hdl.handle.net/10069/37902

► Purpose. Sitafloxacin (SFX) is a new fluoroquinolone (FQ) that has shown a strong bactericidal effect against Mycobacterium tuberculosis (Mtb) in vitro. However, data on SFX…
(more)

Subjects/Keywords: epidemiological cut-off value; minimum inhibitory concentrations; gyrase A gene; sitafloxacin; gyrase B gene

…sitafloxacin;
Mfx, moxifloxacin; Cfx, ciprofloxacin; ECOFF, epidemiological *cut*-off.
Table 1. *Minimum*… …Lfx-resistant isolates showing MIC ≥ 2 µg/mL, which is the
*cut*-off value for Lfx against Mtb… …831.
33. Kambli P, Ajbani K, Sadani M, Nikam C, Shetty A et al. Correlating *minimum*… …MIC,
*minimum* inhibitory concentration; Lfx, levofloxacin; Mfx, moxifloxacin; Sfx… …bimodal
distributions. MIC, *minimum* inhibitory concentration; Lfx, levofloxacin; Sfx…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

伊, . (2017). In vitro activity of sitafloxacin against Mycobacterium tuberculosis with gyrA/B mutations isolated in Japan : 日本で分離されたgyrA/B 変異結核菌株のin vitroでのシタフロキサシン活性の評価. (Thesis). Nagasaki University / 長崎大学. Retrieved from http://hdl.handle.net/10069/37902

Not specified: Masters Thesis or Doctoral Dissertation

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

伊, 麗娜. “In vitro activity of sitafloxacin against Mycobacterium tuberculosis with gyrA/B mutations isolated in Japan : 日本で分離されたgyrA/B 変異結核菌株のin vitroでのシタフロキサシン活性の評価.” 2017. Thesis, Nagasaki University / 長崎大学. Accessed August 15, 2020. http://hdl.handle.net/10069/37902.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

伊, 麗娜. “In vitro activity of sitafloxacin against Mycobacterium tuberculosis with gyrA/B mutations isolated in Japan : 日本で分離されたgyrA/B 変異結核菌株のin vitroでのシタフロキサシン活性の評価.” 2017. Web. 15 Aug 2020.

Vancouver:

伊 . In vitro activity of sitafloxacin against Mycobacterium tuberculosis with gyrA/B mutations isolated in Japan : 日本で分離されたgyrA/B 変異結核菌株のin vitroでのシタフロキサシン活性の評価. [Internet] [Thesis]. Nagasaki University / 長崎大学; 2017. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/10069/37902.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

伊 . In vitro activity of sitafloxacin against Mycobacterium tuberculosis with gyrA/B mutations isolated in Japan : 日本で分離されたgyrA/B 変異結核菌株のin vitroでのシタフロキサシン活性の評価. [Thesis]. Nagasaki University / 長崎大学; 2017. Available from: http://hdl.handle.net/10069/37902

Not specified: Masters Thesis or Doctoral Dissertation

11. Nayyeri, Amir. Combinatorial optimization on embedded curves.

Degree: PhD, 0112, 2013, University of Illinois – Urbana-Champaign

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

► We describe several algorithms for classifying, comparing and optimizing curves on surfaces. We give algorithms to compute the *minimum* member of a given homology class,…
(more)

Subjects/Keywords: Computational topology; combinatorial optimization; curves; maximum flow; minimum cut; curve similarity; normal coordinated

…Generalizations of planar cuts . . . . . . . . . . . . . . . . . . . .
3.2 Undirected *minimum* *cut* and… …computing the *minimum*
3
*cut* [39], computing the *minimum* non-separating cycle… …and t, we prove that
the *minimum* (s, t)-*cut* is dual to shortest even subgraph in a… …is the linear programming dual of
the *minimum* *cut* problem; however, our solution requires… …homology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3.5 *Minimum* homologous…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nayyeri, A. (2013). Combinatorial optimization on embedded curves. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/42333

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

Nayyeri, Amir. “Combinatorial optimization on embedded curves.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 15, 2020. http://hdl.handle.net/2142/42333.

MLA Handbook (7^{th} Edition):

Nayyeri, Amir. “Combinatorial optimization on embedded curves.” 2013. Web. 15 Aug 2020.

Vancouver:

Nayyeri A. Combinatorial optimization on embedded curves. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/2142/42333.

Council of Science Editors:

Nayyeri A. Combinatorial optimization on embedded curves. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/42333

12. Fox, Kyle J. Fast algorithms for surface embedded graphs via homology.

Degree: PhD, 0112 0112, 2014, University of Illinois – Urbana-Champaign

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

► We describe several results on combinatorial optimization problems for graphs where the input comes with an embedding on an orientable surface of small genus. While…
(more)

Subjects/Keywords: computational topology; topological graph theory; Homology; minimum cut; maximum flow; non-trivial cycles

…Verdi`
ere and Lazarus for simple cycles [33]. The *minimum* s, t-*cut* algorithms of… …*minimum* s, t-*cut* of G with respect to capacity function c is an s, t-*cut* of *minimum* value. The… …well known maximumflow/*minimum*-*cut* theorem of Ford and Fulkerson [57] states that… …to the value of a *minimum* s, t-*cut*.
2.5 Covering Spaces and Cutting
A continuous map π : Σ… …sometimes refer to the problem of computing a *minimum* *cut* as the global
*minimum* *cut* problem.
The…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fox, K. J. (2014). Fast algorithms for surface embedded graphs via homology. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/46579

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

Fox, Kyle J. “Fast algorithms for surface embedded graphs via homology.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 15, 2020. http://hdl.handle.net/2142/46579.

MLA Handbook (7^{th} Edition):

Fox, Kyle J. “Fast algorithms for surface embedded graphs via homology.” 2014. Web. 15 Aug 2020.

Vancouver:

Fox KJ. Fast algorithms for surface embedded graphs via homology. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/2142/46579.

Council of Science Editors:

Fox KJ. Fast algorithms for surface embedded graphs via homology. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/46579

Brno University of Technology

13. Cabalka, Matouš. Pokročilá optimalizace toků v sítích: Advanced Optimization of Network Flows.

Degree: 2019, Brno University of Technology

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

► The master’s thesis focuses on the optimization models in logistics with emphasis on the network interdiction problem. The brief introduction is followed by two overview…
(more)

Subjects/Keywords: Matematické programování; lineární programování; toky v sítích; úloha o maximálním toku; duální úloha; úloha o minimálním řezu; úloha napadení sítě; dvoustupňové programování; stochastické programování; GAMS; Mathematical programming; linear programming; network flows; the maximum flow problem; dual problem; the minimum cut problem; network interdiction problem; two-stage programming; stochastic programming; GAMS

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cabalka, M. (2019). Pokročilá optimalizace toků v sítích: Advanced Optimization of Network Flows. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/138014

Not specified: Masters Thesis or Doctoral Dissertation

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

Cabalka, Matouš. “Pokročilá optimalizace toků v sítích: Advanced Optimization of Network Flows.” 2019. Thesis, Brno University of Technology. Accessed August 15, 2020. http://hdl.handle.net/11012/138014.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cabalka, Matouš. “Pokročilá optimalizace toků v sítích: Advanced Optimization of Network Flows.” 2019. Web. 15 Aug 2020.

Vancouver:

Cabalka M. Pokročilá optimalizace toků v sítích: Advanced Optimization of Network Flows. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/11012/138014.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cabalka M. Pokročilá optimalizace toků v sítích: Advanced Optimization of Network Flows. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/138014

Not specified: Masters Thesis or Doctoral Dissertation

University of Toronto

14. Georgiou, Konstantinos. Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations.

Degree: 2010, University of Toronto

URL: http://hdl.handle.net/1807/26271

►

The inapproximability for NP-hard combinatorial optimization problems lies in the heart of theoretical computer science. A negative result can be either conditional, where the starting… (more)

Subjects/Keywords: integrality gap; lift and project systems; convex optimization; combinatorial optimization; linear programming relaxations; semidefinite programming relaxations; minimum vertex cover; constraint satisfaction problem; Max Cut; Lovasz-Schrijver system; Sherali-Adams system; Lasserre system; hardness of approximation; 0984; 0405

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Georgiou, K. (2010). Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/26271

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

Georgiou, Konstantinos. “Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations.” 2010. Doctoral Dissertation, University of Toronto. Accessed August 15, 2020. http://hdl.handle.net/1807/26271.

MLA Handbook (7^{th} Edition):

Georgiou, Konstantinos. “Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations.” 2010. Web. 15 Aug 2020.

Vancouver:

Georgiou K. Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations. [Internet] [Doctoral dissertation]. University of Toronto; 2010. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/1807/26271.

Council of Science Editors:

Georgiou K. Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations. [Doctoral Dissertation]. University of Toronto; 2010. Available from: http://hdl.handle.net/1807/26271

Humboldt State University

15. Storlie, Jason Tevis. Movements and habitat use of female Roosevelt elk in relation to human disturbance on the Hoko and Dickey Game Management Units, Washington.

Degree: 2006, Humboldt State University

URL: http://hdl.handle.net/2148/88

► Anthropogenic disturbance may alter the movements and habitat use of Roosevelt elk (Cervus elaphus roosevelti). Persistent human disturbance may ultimately lead to increased energetic demands,…
(more)

Subjects/Keywords: Elk; Washington; Cervus elaphus roosevelti; Disturbance; Reproductive success; Range; Habitat; Successional; Chi; GIS; Hunt; Paired; ANOVA; NCSS; ArcView; Geographic information systems; XTools; Centriod; Water; Riparian; Bonferroni; Herd movements; Herd fidelity; Logging; MCP; Minimum convex polygon; Fixed kernel; Core area; Mean daily distance; Roads; Calving; Rut; Timber seral stage; Anthropogenic; Forest; Clear cut; Commercial thinning; Forage; Productivity; Makah; Harvest; Pacific Northwest; Succession; Ungulate; Herbivore; Radio telemetry; UTM; Pseudoreplication; Coefficient

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Storlie, J. T. (2006). Movements and habitat use of female Roosevelt elk in relation to human disturbance on the Hoko and Dickey Game Management Units, Washington. (Thesis). Humboldt State University. Retrieved from http://hdl.handle.net/2148/88

Not specified: Masters Thesis or Doctoral Dissertation

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

Storlie, Jason Tevis. “Movements and habitat use of female Roosevelt elk in relation to human disturbance on the Hoko and Dickey Game Management Units, Washington.” 2006. Thesis, Humboldt State University. Accessed August 15, 2020. http://hdl.handle.net/2148/88.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Storlie, Jason Tevis. “Movements and habitat use of female Roosevelt elk in relation to human disturbance on the Hoko and Dickey Game Management Units, Washington.” 2006. Web. 15 Aug 2020.

Vancouver:

Storlie JT. Movements and habitat use of female Roosevelt elk in relation to human disturbance on the Hoko and Dickey Game Management Units, Washington. [Internet] [Thesis]. Humboldt State University; 2006. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/2148/88.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Storlie JT. Movements and habitat use of female Roosevelt elk in relation to human disturbance on the Hoko and Dickey Game Management Units, Washington. [Thesis]. Humboldt State University; 2006. Available from: http://hdl.handle.net/2148/88

Not specified: Masters Thesis or Doctoral Dissertation