Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Binary integer programming). Showing records 1 – 16 of 16 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Virginia Commonwealth University

1. Srinivasan, Sudharshana. Modeling the problem of assigning Virginia’s localities to DCR’s Regional Offices.

Degree: MS, Mathematical Sciences, 2009, Virginia Commonwealth University

 Virginia’s Department of Conservation and Recreation (DCR) assigns all of Virginia localities to Regional Offices to help conserve the natural resources in a certain region.… (more)

Subjects/Keywords: Operations Research; Assignment; Binary Integer Programming; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Srinivasan, S. (2009). Modeling the problem of assigning Virginia’s localities to DCR’s Regional Offices. (Thesis). Virginia Commonwealth University. Retrieved from https://scholarscompass.vcu.edu/etd/1895

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

Chicago Manual of Style (16th Edition):

Srinivasan, Sudharshana. “Modeling the problem of assigning Virginia’s localities to DCR’s Regional Offices.” 2009. Thesis, Virginia Commonwealth University. Accessed May 23, 2019. https://scholarscompass.vcu.edu/etd/1895.

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

MLA Handbook (7th Edition):

Srinivasan, Sudharshana. “Modeling the problem of assigning Virginia’s localities to DCR’s Regional Offices.” 2009. Web. 23 May 2019.

Vancouver:

Srinivasan S. Modeling the problem of assigning Virginia’s localities to DCR’s Regional Offices. [Internet] [Thesis]. Virginia Commonwealth University; 2009. [cited 2019 May 23]. Available from: https://scholarscompass.vcu.edu/etd/1895.

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

Council of Science Editors:

Srinivasan S. Modeling the problem of assigning Virginia’s localities to DCR’s Regional Offices. [Thesis]. Virginia Commonwealth University; 2009. Available from: https://scholarscompass.vcu.edu/etd/1895

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


Queens University

2. Li, Wenjie. Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks .

Degree: Computing, 2015, Queens University

 The growing demand for video streaming is straining the current Internet, and mandating a novel approach to future Internet paradigms. The advent of Information-Centric Networks… (more)

Subjects/Keywords: in-network caching; Optimization; Content-centric network; Queueing analysis; Binary integer programming; Dynamic adaptive streaming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, W. (2015). Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/13414

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

Chicago Manual of Style (16th Edition):

Li, Wenjie. “Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks .” 2015. Thesis, Queens University. Accessed May 23, 2019. http://hdl.handle.net/1974/13414.

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

MLA Handbook (7th Edition):

Li, Wenjie. “Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks .” 2015. Web. 23 May 2019.

Vancouver:

Li W. Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks . [Internet] [Thesis]. Queens University; 2015. [cited 2019 May 23]. Available from: http://hdl.handle.net/1974/13414.

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

Council of Science Editors:

Li W. Popularity-driven Caching Strategy for Dynamic Adaptive Streaming over Information-Centric Networks . [Thesis]. Queens University; 2015. Available from: http://hdl.handle.net/1974/13414

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


Clemson University

3. Paudel, Jyoti. PHASOR MEASUREMENT UNIT DEPLOYMENT APPROACH FOR MAXIMUM OBSERVABILITY CONSIDERING VULNERABILITY ANALYSIS.

Degree: MS, Electrical and Computer Engineering, 2015, Clemson University

 In recent years, there has been growing interest of synchrophasor measurements like Phasor Measurement Units (PMUs) Power systems are now being gradually populated by PMU… (more)

Subjects/Keywords: Binary Integer Programming; Observability; OPP; Phasor Measurement Unit; Redundancy; Vulnerability; Electrical and Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Paudel, J. (2015). PHASOR MEASUREMENT UNIT DEPLOYMENT APPROACH FOR MAXIMUM OBSERVABILITY CONSIDERING VULNERABILITY ANALYSIS. (Masters Thesis). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_theses/2275

Chicago Manual of Style (16th Edition):

Paudel, Jyoti. “PHASOR MEASUREMENT UNIT DEPLOYMENT APPROACH FOR MAXIMUM OBSERVABILITY CONSIDERING VULNERABILITY ANALYSIS.” 2015. Masters Thesis, Clemson University. Accessed May 23, 2019. https://tigerprints.clemson.edu/all_theses/2275.

MLA Handbook (7th Edition):

Paudel, Jyoti. “PHASOR MEASUREMENT UNIT DEPLOYMENT APPROACH FOR MAXIMUM OBSERVABILITY CONSIDERING VULNERABILITY ANALYSIS.” 2015. Web. 23 May 2019.

Vancouver:

Paudel J. PHASOR MEASUREMENT UNIT DEPLOYMENT APPROACH FOR MAXIMUM OBSERVABILITY CONSIDERING VULNERABILITY ANALYSIS. [Internet] [Masters thesis]. Clemson University; 2015. [cited 2019 May 23]. Available from: https://tigerprints.clemson.edu/all_theses/2275.

Council of Science Editors:

Paudel J. PHASOR MEASUREMENT UNIT DEPLOYMENT APPROACH FOR MAXIMUM OBSERVABILITY CONSIDERING VULNERABILITY ANALYSIS. [Masters Thesis]. Clemson University; 2015. Available from: https://tigerprints.clemson.edu/all_theses/2275

4. Silva, João Paulo das Neves. Problema de atribuição de vigilâncias de exames a docentes.

Degree: 2012, Instituto Politécnico do Porto

O presente trabalho foi realizado com o intuito de resolver o problema de alocação de vigilantes a exames do Instituto Superior de Engenharia do Porto,… (more)

Subjects/Keywords: Problemas de horários; Programação inteira binária; Alocação de docentes a exames; Scheduling problems; University exam scheduling; Binary integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Silva, J. P. d. N. (2012). Problema de atribuição de vigilâncias de exames a docentes. (Thesis). Instituto Politécnico do Porto. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/4472

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

Chicago Manual of Style (16th Edition):

Silva, João Paulo das Neves. “Problema de atribuição de vigilâncias de exames a docentes.” 2012. Thesis, Instituto Politécnico do Porto. Accessed May 23, 2019. http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/4472.

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

MLA Handbook (7th Edition):

Silva, João Paulo das Neves. “Problema de atribuição de vigilâncias de exames a docentes.” 2012. Web. 23 May 2019.

Vancouver:

Silva JPdN. Problema de atribuição de vigilâncias de exames a docentes. [Internet] [Thesis]. Instituto Politécnico do Porto; 2012. [cited 2019 May 23]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/4472.

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

Council of Science Editors:

Silva JPdN. Problema de atribuição de vigilâncias de exames a docentes. [Thesis]. Instituto Politécnico do Porto; 2012. Available from: http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/4472

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


Curtin University of Technology

5. Loh, Ruen Chze. Using edge-disjoint paths to improve the QoS in computer communications .

Degree: 2010, Curtin University of Technology

 Most of today’s computer communications use only a single (s,t) path to transmit a message from a source node s to a destination node t.… (more)

Subjects/Keywords: Lagrange Relaxation; computer communications; t) communications; edge-disjoint paths; Binary Integer Programming (BIP); Quality-of-Service (QoS); multi (s

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Loh, R. C. (2010). Using edge-disjoint paths to improve the QoS in computer communications . (Thesis). Curtin University of Technology. Retrieved from http://hdl.handle.net/20.500.11937/2222

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

Chicago Manual of Style (16th Edition):

Loh, Ruen Chze. “Using edge-disjoint paths to improve the QoS in computer communications .” 2010. Thesis, Curtin University of Technology. Accessed May 23, 2019. http://hdl.handle.net/20.500.11937/2222.

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

MLA Handbook (7th Edition):

Loh, Ruen Chze. “Using edge-disjoint paths to improve the QoS in computer communications .” 2010. Web. 23 May 2019.

Vancouver:

Loh RC. Using edge-disjoint paths to improve the QoS in computer communications . [Internet] [Thesis]. Curtin University of Technology; 2010. [cited 2019 May 23]. Available from: http://hdl.handle.net/20.500.11937/2222.

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

Council of Science Editors:

Loh RC. Using edge-disjoint paths to improve the QoS in computer communications . [Thesis]. Curtin University of Technology; 2010. Available from: http://hdl.handle.net/20.500.11937/2222

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

6. Lopez, Oscar Fabian. A compressive sensing approach to solving nonograms.

Degree: Mathematics, 2013, University of Texas – Austin

 A nonogram is a logic puzzle where one shades certain cells of a 2D grid to reveal a hidden image. One uses the sequences of… (more)

Subjects/Keywords: Nonogram; Compressive sensing; Binary integer programming

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lopez, O. F. (2013). A compressive sensing approach to solving nonograms. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/22669

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

Chicago Manual of Style (16th Edition):

Lopez, Oscar Fabian. “A compressive sensing approach to solving nonograms.” 2013. Thesis, University of Texas – Austin. Accessed May 23, 2019. http://hdl.handle.net/2152/22669.

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

MLA Handbook (7th Edition):

Lopez, Oscar Fabian. “A compressive sensing approach to solving nonograms.” 2013. Web. 23 May 2019.

Vancouver:

Lopez OF. A compressive sensing approach to solving nonograms. [Internet] [Thesis]. University of Texas – Austin; 2013. [cited 2019 May 23]. Available from: http://hdl.handle.net/2152/22669.

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

Council of Science Editors:

Lopez OF. A compressive sensing approach to solving nonograms. [Thesis]. University of Texas – Austin; 2013. Available from: http://hdl.handle.net/2152/22669

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


NSYSU

7. Fan, Liang-Jan. Ridership Based Substation Planning for Mass Rapid Transit System.

Degree: Master, Electrical Engineering, 2000, NSYSU

 This thesis is to investigate the power system operation strategy for an electrified mass rapid transitï¼MRTï¼network with the load transfer among main transformers by considering… (more)

Subjects/Keywords: Load Factor; ACãDC Load Flow; Binary Integer Programming; Dynamic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fan, L. (2000). Ridership Based Substation Planning for Mass Rapid Transit System. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0619100-020345

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

Chicago Manual of Style (16th Edition):

Fan, Liang-Jan. “Ridership Based Substation Planning for Mass Rapid Transit System.” 2000. Thesis, NSYSU. Accessed May 23, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0619100-020345.

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

MLA Handbook (7th Edition):

Fan, Liang-Jan. “Ridership Based Substation Planning for Mass Rapid Transit System.” 2000. Web. 23 May 2019.

Vancouver:

Fan L. Ridership Based Substation Planning for Mass Rapid Transit System. [Internet] [Thesis]. NSYSU; 2000. [cited 2019 May 23]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0619100-020345.

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

Council of Science Editors:

Fan L. Ridership Based Substation Planning for Mass Rapid Transit System. [Thesis]. NSYSU; 2000. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0619100-020345

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

8. Κυριακίδης, Θωμάς. Algorithms for optimal project scheduling.

Degree: 2013, University of Western Macedonia; Πανεπιστήμιο Δυτικής Μακεδονίας

 Project scheduling plays a vital role in project management, and constitutes one of the most important directions in both research and practice in the Operational… (more)

Subjects/Keywords: Χρονοπρογραμματισμός έργων; Μικτός ακέραιος προγραμματισμός; Δυαδικός ακέραιος προγραμματισμός; Χρονικές υστερήσεις; Πρόβλημα χρονοπρογραμματισμός με περιορισμένους πόρους; Διαχείριση έργων; Μαθηματικός προγραμματισμός; Project scheduling; Mixed integer programming; Binary integer programming; Time lags; Resource constrained project scheduling; Project management; Mathematical programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Κυριακίδης, . . (2013). Algorithms for optimal project scheduling. (Thesis). University of Western Macedonia; Πανεπιστήμιο Δυτικής Μακεδονίας. Retrieved from http://hdl.handle.net/10442/hedi/28198

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

Chicago Manual of Style (16th Edition):

Κυριακίδης, Θωμάς. “Algorithms for optimal project scheduling.” 2013. Thesis, University of Western Macedonia; Πανεπιστήμιο Δυτικής Μακεδονίας. Accessed May 23, 2019. http://hdl.handle.net/10442/hedi/28198.

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

MLA Handbook (7th Edition):

Κυριακίδης, Θωμάς. “Algorithms for optimal project scheduling.” 2013. Web. 23 May 2019.

Vancouver:

Κυριακίδης . Algorithms for optimal project scheduling. [Internet] [Thesis]. University of Western Macedonia; Πανεπιστήμιο Δυτικής Μακεδονίας; 2013. [cited 2019 May 23]. Available from: http://hdl.handle.net/10442/hedi/28198.

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

Council of Science Editors:

Κυριακίδης . Algorithms for optimal project scheduling. [Thesis]. University of Western Macedonia; Πανεπιστήμιο Δυτικής Μακεδονίας; 2013. Available from: http://hdl.handle.net/10442/hedi/28198

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

9. Da Costa Fontes, Fábio Francisco. Optimization Models and Algorithms for the Design of Global Transportation Networks : Modèles et algorithmes pour la conception de réseaux de transport mondiaux.

Degree: Docteur es, Génie Informatique et Automatique, 2017, Université d'Artois

Le développement de structures de réseau efficaces pour le transport de marchandises est fondamental sur le marché mondial actuel. Les demandes doivent être traitées rapidement,… (more)

Subjects/Keywords: Hub-and-spoke; Sub-hub; Programmation linéaire en nombres entiers binaires; Cutting plane; VNDS; Matheuristic; Hub-and-spoke; Sub-hub; Binary integer linear programming; Cutting plane; VNDS; Matheuristic; 388; 621.39

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Da Costa Fontes, F. F. (2017). Optimization Models and Algorithms for the Design of Global Transportation Networks : Modèles et algorithmes pour la conception de réseaux de transport mondiaux. (Doctoral Dissertation). Université d'Artois. Retrieved from http://www.theses.fr/2017ARTO0206

Chicago Manual of Style (16th Edition):

Da Costa Fontes, Fábio Francisco. “Optimization Models and Algorithms for the Design of Global Transportation Networks : Modèles et algorithmes pour la conception de réseaux de transport mondiaux.” 2017. Doctoral Dissertation, Université d'Artois. Accessed May 23, 2019. http://www.theses.fr/2017ARTO0206.

MLA Handbook (7th Edition):

Da Costa Fontes, Fábio Francisco. “Optimization Models and Algorithms for the Design of Global Transportation Networks : Modèles et algorithmes pour la conception de réseaux de transport mondiaux.” 2017. Web. 23 May 2019.

Vancouver:

Da Costa Fontes FF. Optimization Models and Algorithms for the Design of Global Transportation Networks : Modèles et algorithmes pour la conception de réseaux de transport mondiaux. [Internet] [Doctoral dissertation]. Université d'Artois; 2017. [cited 2019 May 23]. Available from: http://www.theses.fr/2017ARTO0206.

Council of Science Editors:

Da Costa Fontes FF. Optimization Models and Algorithms for the Design of Global Transportation Networks : Modèles et algorithmes pour la conception de réseaux de transport mondiaux. [Doctoral Dissertation]. Université d'Artois; 2017. Available from: http://www.theses.fr/2017ARTO0206

10. Pal, Anamitra. PMU-Based Applications for Improved Monitoring and Protection of Power Systems.

Degree: PhD, Electrical and Computer Engineering, 2014, Virginia Tech

 Monitoring and protection of power systems is a task that has manifold objectives. Amongst others, it involves performing data mining, optimizing available resources, assessing system… (more)

Subjects/Keywords: Binary Integer Programming; Data Conditioning; Fisher Linear Discriminant (FLD); Kalman Filter; Observability; Phasor Measurement Units (PMUs); Stress Assessment; Wide Area Measurement Systems (WAMS)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pal, A. (2014). PMU-Based Applications for Improved Monitoring and Protection of Power Systems. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/51093

Chicago Manual of Style (16th Edition):

Pal, Anamitra. “PMU-Based Applications for Improved Monitoring and Protection of Power Systems.” 2014. Doctoral Dissertation, Virginia Tech. Accessed May 23, 2019. http://hdl.handle.net/10919/51093.

MLA Handbook (7th Edition):

Pal, Anamitra. “PMU-Based Applications for Improved Monitoring and Protection of Power Systems.” 2014. Web. 23 May 2019.

Vancouver:

Pal A. PMU-Based Applications for Improved Monitoring and Protection of Power Systems. [Internet] [Doctoral dissertation]. Virginia Tech; 2014. [cited 2019 May 23]. Available from: http://hdl.handle.net/10919/51093.

Council of Science Editors:

Pal A. PMU-Based Applications for Improved Monitoring and Protection of Power Systems. [Doctoral Dissertation]. Virginia Tech; 2014. Available from: http://hdl.handle.net/10919/51093


Universidade Federal de Santa Maria

11. Rafael Corrêa. OTIMIZACÃO DA COORDENAÇÃO DE RELÉS DE SOBRECORRENTE DIRECIONAIS EM SISTEMAS ELÉTRICOS DE POTÊNCIA UTILIZANDO A PROGRAMAÇÃO INTEIRA BINÁRIA.

Degree: 2012, Universidade Federal de Santa Maria

Este trabalho visa otimizar a coordenação de relés de sobrecorrente direcionais microprocessados em sistemas elétricos de potência com o auxílio da Programação Inteira Binária (PIB).… (more)

Subjects/Keywords: Otimização; Coordenação; Programação inteira binária; Programação linear; Programação não linear; Proteção de sobrecorrente; Relé de sobrecorrente; Sistemas elétricos de potência; ENGENHARIA ELETRICA; Binary integer programming; Coordination; Electric power systems; Linear programming; Overcurrent protection; Nonlinear programming; Optimization; Overcurrent relay

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Corrêa, R. (2012). OTIMIZACÃO DA COORDENAÇÃO DE RELÉS DE SOBRECORRENTE DIRECIONAIS EM SISTEMAS ELÉTRICOS DE POTÊNCIA UTILIZANDO A PROGRAMAÇÃO INTEIRA BINÁRIA. (Thesis). Universidade Federal de Santa Maria. Retrieved from http://coralx.ufsm.br/tede/tde_busca/arquivo.php?codArquivo=4506

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

Chicago Manual of Style (16th Edition):

Corrêa, Rafael. “OTIMIZACÃO DA COORDENAÇÃO DE RELÉS DE SOBRECORRENTE DIRECIONAIS EM SISTEMAS ELÉTRICOS DE POTÊNCIA UTILIZANDO A PROGRAMAÇÃO INTEIRA BINÁRIA.” 2012. Thesis, Universidade Federal de Santa Maria. Accessed May 23, 2019. http://coralx.ufsm.br/tede/tde_busca/arquivo.php?codArquivo=4506.

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

MLA Handbook (7th Edition):

Corrêa, Rafael. “OTIMIZACÃO DA COORDENAÇÃO DE RELÉS DE SOBRECORRENTE DIRECIONAIS EM SISTEMAS ELÉTRICOS DE POTÊNCIA UTILIZANDO A PROGRAMAÇÃO INTEIRA BINÁRIA.” 2012. Web. 23 May 2019.

Vancouver:

Corrêa R. OTIMIZACÃO DA COORDENAÇÃO DE RELÉS DE SOBRECORRENTE DIRECIONAIS EM SISTEMAS ELÉTRICOS DE POTÊNCIA UTILIZANDO A PROGRAMAÇÃO INTEIRA BINÁRIA. [Internet] [Thesis]. Universidade Federal de Santa Maria; 2012. [cited 2019 May 23]. Available from: http://coralx.ufsm.br/tede/tde_busca/arquivo.php?codArquivo=4506.

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

Council of Science Editors:

Corrêa R. OTIMIZACÃO DA COORDENAÇÃO DE RELÉS DE SOBRECORRENTE DIRECIONAIS EM SISTEMAS ELÉTRICOS DE POTÊNCIA UTILIZANDO A PROGRAMAÇÃO INTEIRA BINÁRIA. [Thesis]. Universidade Federal de Santa Maria; 2012. Available from: http://coralx.ufsm.br/tede/tde_busca/arquivo.php?codArquivo=4506

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


University of Cincinnati

12. KANNAN, SRIRAM. AN EXACT ALGORITHM FOR THE SHARE-OF-CHOICE PROBLEM.

Degree: PhD, Business Administration : Quantitative Analysis, 2006, University of Cincinnati

 Products and services can be thought of as bundles of attributes that are each made up of many levels. Consumers consider tradeoffs between various attributes… (more)

Subjects/Keywords: Operations Research; Product Design; Conjoint Optimization; Binary Integer Programming; Constraint Aggregation; Share of Choice Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

KANNAN, S. (2006). AN EXACT ALGORITHM FOR THE SHARE-OF-CHOICE PROBLEM. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1146808499

Chicago Manual of Style (16th Edition):

KANNAN, SRIRAM. “AN EXACT ALGORITHM FOR THE SHARE-OF-CHOICE PROBLEM.” 2006. Doctoral Dissertation, University of Cincinnati. Accessed May 23, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1146808499.

MLA Handbook (7th Edition):

KANNAN, SRIRAM. “AN EXACT ALGORITHM FOR THE SHARE-OF-CHOICE PROBLEM.” 2006. Web. 23 May 2019.

Vancouver:

KANNAN S. AN EXACT ALGORITHM FOR THE SHARE-OF-CHOICE PROBLEM. [Internet] [Doctoral dissertation]. University of Cincinnati; 2006. [cited 2019 May 23]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1146808499.

Council of Science Editors:

KANNAN S. AN EXACT ALGORITHM FOR THE SHARE-OF-CHOICE PROBLEM. [Doctoral Dissertation]. University of Cincinnati; 2006. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1146808499


University of Western Ontario

13. Miranskyy, Andriy. Models, Techniques, and Metrics for Managing Risk in Software Engineering.

Degree: 2011, University of Western Ontario

 The field of Software Engineering (SE) is the study of systematic and quantifiable approaches to software development, operation, and maintenance. This thesis presents a set… (more)

Subjects/Keywords: software engineering; risk; execution trace; entropy; defect rediscovery; extreme value theory; Kappa distribution; G/M/k queue; binary integer programming; customer profiling; escalated requirement; assumption; stochastic modeling; Boolean network; Other Applied Mathematics; Software Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Miranskyy, A. (2011). Models, Techniques, and Metrics for Managing Risk in Software Engineering. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/188

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

Chicago Manual of Style (16th Edition):

Miranskyy, Andriy. “Models, Techniques, and Metrics for Managing Risk in Software Engineering.” 2011. Thesis, University of Western Ontario. Accessed May 23, 2019. https://ir.lib.uwo.ca/etd/188.

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

MLA Handbook (7th Edition):

Miranskyy, Andriy. “Models, Techniques, and Metrics for Managing Risk in Software Engineering.” 2011. Web. 23 May 2019.

Vancouver:

Miranskyy A. Models, Techniques, and Metrics for Managing Risk in Software Engineering. [Internet] [Thesis]. University of Western Ontario; 2011. [cited 2019 May 23]. Available from: https://ir.lib.uwo.ca/etd/188.

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

Council of Science Editors:

Miranskyy A. Models, Techniques, and Metrics for Managing Risk in Software Engineering. [Thesis]. University of Western Ontario; 2011. Available from: https://ir.lib.uwo.ca/etd/188

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

14. Jalao, Eugene Rex Lazaro. A Pairwise Comparison Matrix Framework for Large-Scale Decision Making.

Degree: PhD, Industrial Engineering, 2013, Arizona State University

 A Pairwise Comparison Matrix (PCM) is used to compute for relative priorities of criteria or alternatives and are integral components of widely applied decision making… (more)

Subjects/Keywords: Industrial engineering; Computer science; Management; AHP; Binary Integer Programming; Decomposition; Inconsistency; Non Linear Programming; Pairwise Comparison Matrix

…pairwise comparisons of a large scale PCM, a binary integer programming (BIP) model is… …comparisons elicited from the DM thereby increasing its consistency. A binary integer programming… …decomposition methodology. A binary integer program is proposed to intelligently decompose a PCM into… …with Goal Programming Methodology of Y. M. Wang & Elhag (2007)… …These stochastic AHP models need to explore the use of methodologies like linear programming… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jalao, E. R. L. (2013). A Pairwise Comparison Matrix Framework for Large-Scale Decision Making. (Doctoral Dissertation). Arizona State University. Retrieved from http://repository.asu.edu/items/17720

Chicago Manual of Style (16th Edition):

Jalao, Eugene Rex Lazaro. “A Pairwise Comparison Matrix Framework for Large-Scale Decision Making.” 2013. Doctoral Dissertation, Arizona State University. Accessed May 23, 2019. http://repository.asu.edu/items/17720.

MLA Handbook (7th Edition):

Jalao, Eugene Rex Lazaro. “A Pairwise Comparison Matrix Framework for Large-Scale Decision Making.” 2013. Web. 23 May 2019.

Vancouver:

Jalao ERL. A Pairwise Comparison Matrix Framework for Large-Scale Decision Making. [Internet] [Doctoral dissertation]. Arizona State University; 2013. [cited 2019 May 23]. Available from: http://repository.asu.edu/items/17720.

Council of Science Editors:

Jalao ERL. A Pairwise Comparison Matrix Framework for Large-Scale Decision Making. [Doctoral Dissertation]. Arizona State University; 2013. Available from: http://repository.asu.edu/items/17720


University of Cincinnati

15. FENG, KELI. THREE ESSAYS ON PRODUCTION AND INVENTORY MANAGEMENT.

Degree: PhD, Business Administration : Quantitative Analysis, 2005, University of Cincinnati

  This dissertation consists of three essays that address issues in production and inventory management. The first essay focuses on inventory management. We study a… (more)

Subjects/Keywords: Business Administration, Management; Multi-Echelon Inventory; Stochastic Demand; Heuristics; Periodic-Review; Cyclic Scheduling; Flow-Time Optimization; Binary Integer Programming; Material Requirements Planning; Demand Uncertainty; Simulation based optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

FENG, K. (2005). THREE ESSAYS ON PRODUCTION AND INVENTORY MANAGEMENT. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1122442476

Chicago Manual of Style (16th Edition):

FENG, KELI. “THREE ESSAYS ON PRODUCTION AND INVENTORY MANAGEMENT.” 2005. Doctoral Dissertation, University of Cincinnati. Accessed May 23, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1122442476.

MLA Handbook (7th Edition):

FENG, KELI. “THREE ESSAYS ON PRODUCTION AND INVENTORY MANAGEMENT.” 2005. Web. 23 May 2019.

Vancouver:

FENG K. THREE ESSAYS ON PRODUCTION AND INVENTORY MANAGEMENT. [Internet] [Doctoral dissertation]. University of Cincinnati; 2005. [cited 2019 May 23]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1122442476.

Council of Science Editors:

FENG K. THREE ESSAYS ON PRODUCTION AND INVENTORY MANAGEMENT. [Doctoral Dissertation]. University of Cincinnati; 2005. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1122442476

16. Morrison, David. New methods for branch-and-bound algorithms.

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

 Branch-and-bound (B&B) algorithms, and extensions such as branch-and-price (B&P) are powerful tools for optimization. These algorithms are used in a wide variety of settings, and… (more)

Subjects/Keywords: branch-and-bound; branch-and-price; search strategies; zero-suppressed binary decision diagrams; wide branching; graph coloring; mixed integer programming

…of the tree first. For example, given a binary mixed integer programming problem with a… …branching scheme for integer programming in Section 2.6.1 is another binary branching scheme. In… …integer programming problem A An arbitrary search strategy for a branch-and-bound algorithm b… …Constraint bounds for an integer programming problem β A numerical constant c A vector of cost… …path) at z λ Lagrange multiplier vector in an integer programming problem M A bound… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Morrison, D. (2014). New methods for branch-and-bound algorithms. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50713

Chicago Manual of Style (16th Edition):

Morrison, David. “New methods for branch-and-bound algorithms.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed May 23, 2019. http://hdl.handle.net/2142/50713.

MLA Handbook (7th Edition):

Morrison, David. “New methods for branch-and-bound algorithms.” 2014. Web. 23 May 2019.

Vancouver:

Morrison D. New methods for branch-and-bound algorithms. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2019 May 23]. Available from: http://hdl.handle.net/2142/50713.

Council of Science Editors:

Morrison D. New methods for branch-and-bound algorithms. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50713

.