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:(Principal minor assignment problem). Showing records 1 – 30 of 12225 total matches.

[1] [2] [3] [4] [5] … [408]

Search Limiters

Last 2 Years | English Only

Languages

Country

▼ Search Limiters

1. Oeding, Luke. G-Varieties and the Principal Minors of Symmetric Matrices.

Degree: 2010, Texas A&M University

 The variety of principal minors of nxn symmetric matrices, denoted Zn, can be described naturally as a projection from the Lagrangian Grassmannian. Moreover, Zn is… (more)

Subjects/Keywords: G-varieties; Principal minors; symmetric matrices; inverse eigenvalue problem; Principal minor assignment problem; Relations among principal minors of symmetric matrices

…1 CHAPTER I INTRODUCTION The problem of finding the relations among principal minors of… …under the principal minor map. We define the hyperdeterminantal module in terms of Schur… …appearing. If A is an n×n matrix, then let ∆I (A) denote the principal minor of A with… …If one includes the 0 × 0 minor, there are 2n principal minors, therefore, a natural home… …symmetric matrix; in other words, it is a complete algebraic solution to the principal minor… 

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

Oeding, L. (2010). G-Varieties and the Principal Minors of Symmetric Matrices. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-526

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

Oeding, Luke. “G-Varieties and the Principal Minors of Symmetric Matrices.” 2010. Thesis, Texas A&M University. Accessed October 19, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-526.

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

MLA Handbook (7th Edition):

Oeding, Luke. “G-Varieties and the Principal Minors of Symmetric Matrices.” 2010. Web. 19 Oct 2019.

Vancouver:

Oeding L. G-Varieties and the Principal Minors of Symmetric Matrices. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-526.

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

Council of Science Editors:

Oeding L. G-Varieties and the Principal Minors of Symmetric Matrices. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-526

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


University of Texas – Austin

2. Camarillo, Stephaine. District selection and assignment of principals : a Texas case study.

Degree: EdD, Educational Leadership and Policy, 2018, University of Texas – Austin

 The emphasis on student achievement results to measure school effectiveness has shed a spotlight on the role of the school principals and their impact on… (more)

Subjects/Keywords: District principal selection; School principal selection; District principal assignment practices; School principal assignment; School principals; Effective school principals; School principal placement

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Camarillo, S. (2018). District selection and assignment of principals : a Texas case study. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/65692

Chicago Manual of Style (16th Edition):

Camarillo, Stephaine. “District selection and assignment of principals : a Texas case study.” 2018. Doctoral Dissertation, University of Texas – Austin. Accessed October 19, 2019. http://hdl.handle.net/2152/65692.

MLA Handbook (7th Edition):

Camarillo, Stephaine. “District selection and assignment of principals : a Texas case study.” 2018. Web. 19 Oct 2019.

Vancouver:

Camarillo S. District selection and assignment of principals : a Texas case study. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2018. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/2152/65692.

Council of Science Editors:

Camarillo S. District selection and assignment of principals : a Texas case study. [Doctoral Dissertation]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/65692


University of Victoria

3. Shadnam, Mojdeh. The Mathematics of principal-agent problem with adverse selection.

Degree: Dept. of Mathematics and Statistics, 2011, University of Victoria

 This thesis studies existence and characterization of optimal solutions to the principal-agent problem with adverse selection for both discrete and continuous problems. The existence results… (more)

Subjects/Keywords: Principal-agent problem; Adverse selection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shadnam, M. (2011). The Mathematics of principal-agent problem with adverse selection. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/3482

Chicago Manual of Style (16th Edition):

Shadnam, Mojdeh. “The Mathematics of principal-agent problem with adverse selection.” 2011. Masters Thesis, University of Victoria. Accessed October 19, 2019. http://hdl.handle.net/1828/3482.

MLA Handbook (7th Edition):

Shadnam, Mojdeh. “The Mathematics of principal-agent problem with adverse selection.” 2011. Web. 19 Oct 2019.

Vancouver:

Shadnam M. The Mathematics of principal-agent problem with adverse selection. [Internet] [Masters thesis]. University of Victoria; 2011. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/1828/3482.

Council of Science Editors:

Shadnam M. The Mathematics of principal-agent problem with adverse selection. [Masters Thesis]. University of Victoria; 2011. Available from: http://hdl.handle.net/1828/3482

4. Monori, Akos. Task assignment optimization in SAP Extended WarehouseManagement.

Degree: Computer Engineering, 2008, Dalarna University

  Nowadays in the world of mass consumption there is big demand for distributioncenters of bigger size. Managing such a center is a very complex… (more)

Subjects/Keywords: Warehouse management; task assignment; generalized assignment problem; SAP; EWM

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Monori, A. (2008). Task assignment optimization in SAP Extended WarehouseManagement. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-3598

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

Monori, Akos. “Task assignment optimization in SAP Extended WarehouseManagement.” 2008. Thesis, Dalarna University. Accessed October 19, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3598.

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

MLA Handbook (7th Edition):

Monori, Akos. “Task assignment optimization in SAP Extended WarehouseManagement.” 2008. Web. 19 Oct 2019.

Vancouver:

Monori A. Task assignment optimization in SAP Extended WarehouseManagement. [Internet] [Thesis]. Dalarna University; 2008. [cited 2019 Oct 19]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-3598.

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

Council of Science Editors:

Monori A. Task assignment optimization in SAP Extended WarehouseManagement. [Thesis]. Dalarna University; 2008. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-3598

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


Addis Ababa University

5. Tadele, Abera. Frequency Assignment Problem Optimization of GSM Network in the case of Addis Ababa .

Degree: 2014, Addis Ababa University

 In GSM systems, radio frequencies are repeatedly used in order to efficiently use assigned frequency bands. To expand the network capacity, one solution is to… (more)

Subjects/Keywords: Frequency Assignment Problem Optimization; Genetic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tadele, A. (2014). Frequency Assignment Problem Optimization of GSM Network in the case of Addis Ababa . (Thesis). Addis Ababa University. Retrieved from http://etd.aau.edu.et/dspace/handle/123456789/4928

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

Tadele, Abera. “Frequency Assignment Problem Optimization of GSM Network in the case of Addis Ababa .” 2014. Thesis, Addis Ababa University. Accessed October 19, 2019. http://etd.aau.edu.et/dspace/handle/123456789/4928.

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

MLA Handbook (7th Edition):

Tadele, Abera. “Frequency Assignment Problem Optimization of GSM Network in the case of Addis Ababa .” 2014. Web. 19 Oct 2019.

Vancouver:

Tadele A. Frequency Assignment Problem Optimization of GSM Network in the case of Addis Ababa . [Internet] [Thesis]. Addis Ababa University; 2014. [cited 2019 Oct 19]. Available from: http://etd.aau.edu.et/dspace/handle/123456789/4928.

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

Council of Science Editors:

Tadele A. Frequency Assignment Problem Optimization of GSM Network in the case of Addis Ababa . [Thesis]. Addis Ababa University; 2014. Available from: http://etd.aau.edu.et/dspace/handle/123456789/4928

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

6. 亀田, 栄一. 複数無線通信サービス環境におけるアプリケーション特性とネットワーク指標を考慮した基地局割り当て手法 : Studies on efficient assignment of base stations with considering application characteristics and network indexes in heterogeneous wireless communication services.

Degree: 博士(工学), 2018, Soka University / 創価大学

 While the LTE has been in widespread use and the line speed for data communications has also been improved,the exploding data traffic required by evolving… (more)

Subjects/Keywords: WiFi Service,Round-Trip Time,Assignment Problem.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

亀田, . (2018). 複数無線通信サービス環境におけるアプリケーション特性とネットワーク指標を考慮した基地局割り当て手法 : Studies on efficient assignment of base stations with considering application characteristics and network indexes in heterogeneous wireless communication services. (Thesis). Soka University / 創価大学. Retrieved from http://hdl.handle.net/10911/00039384

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

亀田, 栄一. “複数無線通信サービス環境におけるアプリケーション特性とネットワーク指標を考慮した基地局割り当て手法 : Studies on efficient assignment of base stations with considering application characteristics and network indexes in heterogeneous wireless communication services.” 2018. Thesis, Soka University / 創価大学. Accessed October 19, 2019. http://hdl.handle.net/10911/00039384.

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

MLA Handbook (7th Edition):

亀田, 栄一. “複数無線通信サービス環境におけるアプリケーション特性とネットワーク指標を考慮した基地局割り当て手法 : Studies on efficient assignment of base stations with considering application characteristics and network indexes in heterogeneous wireless communication services.” 2018. Web. 19 Oct 2019.

Vancouver:

亀田 . 複数無線通信サービス環境におけるアプリケーション特性とネットワーク指標を考慮した基地局割り当て手法 : Studies on efficient assignment of base stations with considering application characteristics and network indexes in heterogeneous wireless communication services. [Internet] [Thesis]. Soka University / 創価大学; 2018. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/10911/00039384.

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

Council of Science Editors:

亀田 . 複数無線通信サービス環境におけるアプリケーション特性とネットワーク指標を考慮した基地局割り当て手法 : Studies on efficient assignment of base stations with considering application characteristics and network indexes in heterogeneous wireless communication services. [Thesis]. Soka University / 創価大学; 2018. Available from: http://hdl.handle.net/10911/00039384

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


University of Ottawa

7. Montazeri, Amine. Developing a Pathologists’ Monthly Assignment Schedule: A Case Study at the Department of Pathology and Laboratory Medicine of The Ottawa Hospital .

Degree: 2015, University of Ottawa

 In the Department of Pathology and Laboratory Medicine, at the beginning of each month, the clinical managers use expert knowledge to assign pathologists to expected… (more)

Subjects/Keywords: Pathologists assignment problem; The Ottawa Hospital

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Montazeri, A. (2015). Developing a Pathologists’ Monthly Assignment Schedule: A Case Study at the Department of Pathology and Laboratory Medicine of The Ottawa Hospital . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/33028

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

Montazeri, Amine. “Developing a Pathologists’ Monthly Assignment Schedule: A Case Study at the Department of Pathology and Laboratory Medicine of The Ottawa Hospital .” 2015. Thesis, University of Ottawa. Accessed October 19, 2019. http://hdl.handle.net/10393/33028.

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

MLA Handbook (7th Edition):

Montazeri, Amine. “Developing a Pathologists’ Monthly Assignment Schedule: A Case Study at the Department of Pathology and Laboratory Medicine of The Ottawa Hospital .” 2015. Web. 19 Oct 2019.

Vancouver:

Montazeri A. Developing a Pathologists’ Monthly Assignment Schedule: A Case Study at the Department of Pathology and Laboratory Medicine of The Ottawa Hospital . [Internet] [Thesis]. University of Ottawa; 2015. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/10393/33028.

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

Council of Science Editors:

Montazeri A. Developing a Pathologists’ Monthly Assignment Schedule: A Case Study at the Department of Pathology and Laboratory Medicine of The Ottawa Hospital . [Thesis]. University of Ottawa; 2015. Available from: http://hdl.handle.net/10393/33028

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


University of Waterloo

8. Punjwani, Shahroz. A Feasible Lagrangian Approach with Application to the Generalized Assignment Problem.

Degree: 2019, University of Waterloo

 Lagrangian relaxation is a widely used decomposition approach to solve difficult optimization problems that exhibit special structure. It provides a lower bound on the optimal… (more)

Subjects/Keywords: Feasible Lagrangian Approach; Generalized Assignment Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Punjwani, S. (2019). A Feasible Lagrangian Approach with Application to the Generalized Assignment Problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14441

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

Punjwani, Shahroz. “A Feasible Lagrangian Approach with Application to the Generalized Assignment Problem.” 2019. Thesis, University of Waterloo. Accessed October 19, 2019. http://hdl.handle.net/10012/14441.

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

MLA Handbook (7th Edition):

Punjwani, Shahroz. “A Feasible Lagrangian Approach with Application to the Generalized Assignment Problem.” 2019. Web. 19 Oct 2019.

Vancouver:

Punjwani S. A Feasible Lagrangian Approach with Application to the Generalized Assignment Problem. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/10012/14441.

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

Council of Science Editors:

Punjwani S. A Feasible Lagrangian Approach with Application to the Generalized Assignment Problem. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14441

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


Laurentian University

9. Shamakhai, Hayat Abdullah. The 0 -1 multiple knapsack problem .

Degree: 2017, Laurentian University

 In operation research, the Multiple Knapsack Problem (MKP) is classified as a combinatorial optimization problem. It is a particular case of the Generalized Assignment Problem.… (more)

Subjects/Keywords: generalized assignment problem; assignment problem; knapsack problem; multiple knapsack problem; branch and bound algorithm; bound and bound algorithm; transportation problem; multiple assignment problem; adapted transportation problem; vogel approximation method; group role assignment problem.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shamakhai, H. A. (2017). The 0 -1 multiple knapsack problem . (Thesis). Laurentian University. Retrieved from https://zone.biblio.laurentian.ca/handle/10219/2762

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

Shamakhai, Hayat Abdullah. “The 0 -1 multiple knapsack problem .” 2017. Thesis, Laurentian University. Accessed October 19, 2019. https://zone.biblio.laurentian.ca/handle/10219/2762.

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

MLA Handbook (7th Edition):

Shamakhai, Hayat Abdullah. “The 0 -1 multiple knapsack problem .” 2017. Web. 19 Oct 2019.

Vancouver:

Shamakhai HA. The 0 -1 multiple knapsack problem . [Internet] [Thesis]. Laurentian University; 2017. [cited 2019 Oct 19]. Available from: https://zone.biblio.laurentian.ca/handle/10219/2762.

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

Council of Science Editors:

Shamakhai HA. The 0 -1 multiple knapsack problem . [Thesis]. Laurentian University; 2017. Available from: https://zone.biblio.laurentian.ca/handle/10219/2762

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


University of Southern California

10. Xu, Huayu. Traffic assignment models for a ridesharing transportation market.

Degree: PhD, Industrial and Systems Engineering, 2014, University of Southern California

 A nascent ridesharing industry is being enabled by new communication technologies and motivated by its many possible benefits, such as reduction in travel cost, pollution,… (more)

Subjects/Keywords: transportation; ridesharing; traffic assignment problem; convex optimization; mixed complementarity problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, H. (2014). Traffic assignment models for a ridesharing transportation market. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/440133/rec/7543

Chicago Manual of Style (16th Edition):

Xu, Huayu. “Traffic assignment models for a ridesharing transportation market.” 2014. Doctoral Dissertation, University of Southern California. Accessed October 19, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/440133/rec/7543.

MLA Handbook (7th Edition):

Xu, Huayu. “Traffic assignment models for a ridesharing transportation market.” 2014. Web. 19 Oct 2019.

Vancouver:

Xu H. Traffic assignment models for a ridesharing transportation market. [Internet] [Doctoral dissertation]. University of Southern California; 2014. [cited 2019 Oct 19]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/440133/rec/7543.

Council of Science Editors:

Xu H. Traffic assignment models for a ridesharing transportation market. [Doctoral Dissertation]. University of Southern California; 2014. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/440133/rec/7543


Laurentian University

11. Shamakhai, Hayat Abdullah. The 0 -1 multiple knapsack problem .

Degree: 2017, Laurentian University

 In operation research, the Multiple Knapsack Problem (MKP) is classified as a combinatorial optimization problem. It is a particular case of the Generalized Assignment Problem.… (more)

Subjects/Keywords: generalized assignment problem; assignment problem; knapsack problem; multiple knapsack problem; branch and bound algorithm; bound and bound algorithm; transportation problem; multiple assignment problem; adapted transportation problem; vogel approximation method; group role assignment problem.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shamakhai, H. A. (2017). The 0 -1 multiple knapsack problem . (Thesis). Laurentian University. Retrieved from https://zone.biblio.laurentian.ca/handle/10219/2762

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

Shamakhai, Hayat Abdullah. “The 0 -1 multiple knapsack problem .” 2017. Thesis, Laurentian University. Accessed October 19, 2019. https://zone.biblio.laurentian.ca/handle/10219/2762.

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

MLA Handbook (7th Edition):

Shamakhai, Hayat Abdullah. “The 0 -1 multiple knapsack problem .” 2017. Web. 19 Oct 2019.

Vancouver:

Shamakhai HA. The 0 -1 multiple knapsack problem . [Internet] [Thesis]. Laurentian University; 2017. [cited 2019 Oct 19]. Available from: https://zone.biblio.laurentian.ca/handle/10219/2762.

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

Council of Science Editors:

Shamakhai HA. The 0 -1 multiple knapsack problem . [Thesis]. Laurentian University; 2017. Available from: https://zone.biblio.laurentian.ca/handle/10219/2762

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

12. Jesus, Nuno Manuel Boléo Teles de. Programação da produção: Otimização de Layouts Industriais.

Degree: 2017, Instituto Politécnico do Porto

O problema conhecido na literatura como “Facility layout problem (FLP)”, em que se pretende determinar a disposição de recursos de produção e a sua interação… (more)

Subjects/Keywords: Facility layout problem; Quadratic Assignment Problem; Mixed Integer Programming Problem; Particle Swarm Optimization; Gestão Industrial

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jesus, N. M. B. T. d. (2017). Programação da produção: Otimização de Layouts Industriais. (Thesis). Instituto Politécnico do Porto. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/10350

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

Jesus, Nuno Manuel Boléo Teles de. “Programação da produção: Otimização de Layouts Industriais.” 2017. Thesis, Instituto Politécnico do Porto. Accessed October 19, 2019. https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/10350.

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

MLA Handbook (7th Edition):

Jesus, Nuno Manuel Boléo Teles de. “Programação da produção: Otimização de Layouts Industriais.” 2017. Web. 19 Oct 2019.

Vancouver:

Jesus NMBTd. Programação da produção: Otimização de Layouts Industriais. [Internet] [Thesis]. Instituto Politécnico do Porto; 2017. [cited 2019 Oct 19]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/10350.

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

Council of Science Editors:

Jesus NMBTd. Programação da produção: Otimização de Layouts Industriais. [Thesis]. Instituto Politécnico do Porto; 2017. Available from: https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/10350

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


Univerzitet u Beogradu

13. Danilović, Miloš D., 1985-. Унапређење конструктивних хеуристика за проблеме комбинаторне оптимизације у операционом менаџменту.

Degree: Fakultet organizacionih nauka, 2018, Univerzitet u Beogradu

Операциони менаџмент - Рачунарски интегрисана производња и логистика / Operations management - Computer integrated manufacturing and logistics

Операциони менаџер користи скуп поступака чији је циљ… (more)

Subjects/Keywords: NP-complete problems; Permutations; Partitions; Cell Formation Problem; Quadratic Assignment Problem; Permutation Flowshop Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Danilović, Miloš D., 1. (2018). Унапређење конструктивних хеуристика за проблеме комбинаторне оптимизације у операционом менаџменту. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:17027/bdef:Content/get

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

Danilović, Miloš D., 1985-. “Унапређење конструктивних хеуристика за проблеме комбинаторне оптимизације у операционом менаџменту.” 2018. Thesis, Univerzitet u Beogradu. Accessed October 19, 2019. https://fedorabg.bg.ac.rs/fedora/get/o:17027/bdef:Content/get.

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

MLA Handbook (7th Edition):

Danilović, Miloš D., 1985-. “Унапређење конструктивних хеуристика за проблеме комбинаторне оптимизације у операционом менаџменту.” 2018. Web. 19 Oct 2019.

Vancouver:

Danilović, Miloš D. 1. Унапређење конструктивних хеуристика за проблеме комбинаторне оптимизације у операционом менаџменту. [Internet] [Thesis]. Univerzitet u Beogradu; 2018. [cited 2019 Oct 19]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:17027/bdef:Content/get.

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

Council of Science Editors:

Danilović, Miloš D. 1. Унапређење конструктивних хеуристика за проблеме комбинаторне оптимизације у операционом менаџменту. [Thesis]. Univerzitet u Beogradu; 2018. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:17027/bdef:Content/get

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


University of Guelph

14. Dussault, Forest. Applications of low and high density SNP arrays to Atlantic salmon breeding: Parameters affecting parentage assignment accuracy and mapping quantitative trait loci for infectious salmon anemia resistance .

Degree: 2016, University of Guelph

 Applications of single nucleotide polymorphisms (SNPs) to the Atlantic salmon (Salmo salar) aquaculture industry can reduce genotyping costs while increasing sample throughput, thereby benefiting commercial… (more)

Subjects/Keywords: minor allele frequency; QTL mapping; atlantic salmon; SNP; parentage assignment; linkage map

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dussault, F. (2016). Applications of low and high density SNP arrays to Atlantic salmon breeding: Parameters affecting parentage assignment accuracy and mapping quantitative trait loci for infectious salmon anemia resistance . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/10033

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

Dussault, Forest. “Applications of low and high density SNP arrays to Atlantic salmon breeding: Parameters affecting parentage assignment accuracy and mapping quantitative trait loci for infectious salmon anemia resistance .” 2016. Thesis, University of Guelph. Accessed October 19, 2019. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/10033.

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

MLA Handbook (7th Edition):

Dussault, Forest. “Applications of low and high density SNP arrays to Atlantic salmon breeding: Parameters affecting parentage assignment accuracy and mapping quantitative trait loci for infectious salmon anemia resistance .” 2016. Web. 19 Oct 2019.

Vancouver:

Dussault F. Applications of low and high density SNP arrays to Atlantic salmon breeding: Parameters affecting parentage assignment accuracy and mapping quantitative trait loci for infectious salmon anemia resistance . [Internet] [Thesis]. University of Guelph; 2016. [cited 2019 Oct 19]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/10033.

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

Council of Science Editors:

Dussault F. Applications of low and high density SNP arrays to Atlantic salmon breeding: Parameters affecting parentage assignment accuracy and mapping quantitative trait loci for infectious salmon anemia resistance . [Thesis]. University of Guelph; 2016. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/10033

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


NSYSU

15. Tseng, Hsiu-ling. The Role of Internal Audit Independence on Performance in Public Family Business.

Degree: Master, Business Management, 2012, NSYSU

 Family-owned enterprise is a typical governance structure around the world. In addressing the governance issues in family business, the founding family usually utilizes the direct… (more)

Subjects/Keywords: agency theory; Internal audit; family business; principal-principal agency problem; independence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tseng, H. (2012). The Role of Internal Audit Independence on Performance in Public Family Business. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0718112-143915

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

Tseng, Hsiu-ling. “The Role of Internal Audit Independence on Performance in Public Family Business.” 2012. Thesis, NSYSU. Accessed October 19, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0718112-143915.

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

MLA Handbook (7th Edition):

Tseng, Hsiu-ling. “The Role of Internal Audit Independence on Performance in Public Family Business.” 2012. Web. 19 Oct 2019.

Vancouver:

Tseng H. The Role of Internal Audit Independence on Performance in Public Family Business. [Internet] [Thesis]. NSYSU; 2012. [cited 2019 Oct 19]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0718112-143915.

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

Council of Science Editors:

Tseng H. The Role of Internal Audit Independence on Performance in Public Family Business. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0718112-143915

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

16. ANG JUAY CHIN. Multiple knapsack problem with inter-related items and its applications to real world problems.

Degree: 2004, National University of Singapore

Subjects/Keywords: Multiple knapsack problem; Venue assignment problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

CHIN, A. J. (2004). Multiple knapsack problem with inter-related items and its applications to real world problems. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/13626

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

CHIN, ANG JUAY. “Multiple knapsack problem with inter-related items and its applications to real world problems.” 2004. Thesis, National University of Singapore. Accessed October 19, 2019. http://scholarbank.nus.edu.sg/handle/10635/13626.

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

MLA Handbook (7th Edition):

CHIN, ANG JUAY. “Multiple knapsack problem with inter-related items and its applications to real world problems.” 2004. Web. 19 Oct 2019.

Vancouver:

CHIN AJ. Multiple knapsack problem with inter-related items and its applications to real world problems. [Internet] [Thesis]. National University of Singapore; 2004. [cited 2019 Oct 19]. Available from: http://scholarbank.nus.edu.sg/handle/10635/13626.

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

Council of Science Editors:

CHIN AJ. Multiple knapsack problem with inter-related items and its applications to real world problems. [Thesis]. National University of Singapore; 2004. Available from: http://scholarbank.nus.edu.sg/handle/10635/13626

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


University of Illinois – Urbana-Champaign

17. Kaushik, Varsha Ravi Prakash. GPU accelerated Hungarian algorithm for traveling salesman problem.

Degree: MS, Industrial Engineering, 2017, University of Illinois – Urbana-Champaign

 In this thesis, we present a model of the Traveling Salesman Problem (TSP) cast in a quadratic assignment problem framework with linearized objective function and… (more)

Subjects/Keywords: Compute Unified Device Architecture (CUDA); Linear assignment problem; Traveling salesman problem; Reformulation Linearization Technique (RLT)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kaushik, V. R. P. (2017). GPU accelerated Hungarian algorithm for traveling salesman problem. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97805

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

Kaushik, Varsha Ravi Prakash. “GPU accelerated Hungarian algorithm for traveling salesman problem.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed October 19, 2019. http://hdl.handle.net/2142/97805.

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

MLA Handbook (7th Edition):

Kaushik, Varsha Ravi Prakash. “GPU accelerated Hungarian algorithm for traveling salesman problem.” 2017. Web. 19 Oct 2019.

Vancouver:

Kaushik VRP. GPU accelerated Hungarian algorithm for traveling salesman problem. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/2142/97805.

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

Council of Science Editors:

Kaushik VRP. GPU accelerated Hungarian algorithm for traveling salesman problem. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97805

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


Universiteit Utrecht

18. Puglierin, F. A Bandit-Inspired Memetic Algorithm for Quadratic Assignment Problems.

Degree: 2012, Universiteit Utrecht

 In this thesis a new metaheuristic for combinatorial optimization is proposed, with focus on the Quadratic Assignment Problem as the hard-problem of choice - a… (more)

Subjects/Keywords: combinatorial optimization; bandit; QAP; Quadratic Assignment Problem; metaheuristic; memetic; hybrid

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Puglierin, F. (2012). A Bandit-Inspired Memetic Algorithm for Quadratic Assignment Problems. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/255702

Chicago Manual of Style (16th Edition):

Puglierin, F. “A Bandit-Inspired Memetic Algorithm for Quadratic Assignment Problems.” 2012. Masters Thesis, Universiteit Utrecht. Accessed October 19, 2019. http://dspace.library.uu.nl:8080/handle/1874/255702.

MLA Handbook (7th Edition):

Puglierin, F. “A Bandit-Inspired Memetic Algorithm for Quadratic Assignment Problems.” 2012. Web. 19 Oct 2019.

Vancouver:

Puglierin F. A Bandit-Inspired Memetic Algorithm for Quadratic Assignment Problems. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2019 Oct 19]. Available from: http://dspace.library.uu.nl:8080/handle/1874/255702.

Council of Science Editors:

Puglierin F. A Bandit-Inspired Memetic Algorithm for Quadratic Assignment Problems. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/255702


Clemson University

19. Rupasinghe, Thashika. AN INVESTIGATION OF METAHEURISTICS USING PATH- RELINKING ON THE QUADRATIC ASSIGNMENT PROBLEM.

Degree: PhD, Industrial Engineering, 2010, Clemson University

 The Quadratic Assignment Problem (QAP) is a widely researched, yet complex, combinatorial optimization problem that is applicable in modeling many real-world problems. Specifically, many optimization… (more)

Subjects/Keywords: METAHEURISTICS; PATH- RELINKING; QUADRATIC ASSIGNMENT PROBLEM; Industrial Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rupasinghe, T. (2010). AN INVESTIGATION OF METAHEURISTICS USING PATH- RELINKING ON THE QUADRATIC ASSIGNMENT PROBLEM. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/625

Chicago Manual of Style (16th Edition):

Rupasinghe, Thashika. “AN INVESTIGATION OF METAHEURISTICS USING PATH- RELINKING ON THE QUADRATIC ASSIGNMENT PROBLEM.” 2010. Doctoral Dissertation, Clemson University. Accessed October 19, 2019. https://tigerprints.clemson.edu/all_dissertations/625.

MLA Handbook (7th Edition):

Rupasinghe, Thashika. “AN INVESTIGATION OF METAHEURISTICS USING PATH- RELINKING ON THE QUADRATIC ASSIGNMENT PROBLEM.” 2010. Web. 19 Oct 2019.

Vancouver:

Rupasinghe T. AN INVESTIGATION OF METAHEURISTICS USING PATH- RELINKING ON THE QUADRATIC ASSIGNMENT PROBLEM. [Internet] [Doctoral dissertation]. Clemson University; 2010. [cited 2019 Oct 19]. Available from: https://tigerprints.clemson.edu/all_dissertations/625.

Council of Science Editors:

Rupasinghe T. AN INVESTIGATION OF METAHEURISTICS USING PATH- RELINKING ON THE QUADRATIC ASSIGNMENT PROBLEM. [Doctoral Dissertation]. Clemson University; 2010. Available from: https://tigerprints.clemson.edu/all_dissertations/625


University of Illinois – Urbana-Champaign

20. Khatibi, Arash. Generalized sequential assignment problem.

Degree: PhD, Industrial Engineering, 2017, University of Illinois – Urbana-Champaign

 The Sequential Stochastic Assignment Problem (SSAP) deals with assigning sequentially arriving tasks with stochastic parameters to workers with fixed success rates. The reward of each… (more)

Subjects/Keywords: Linear program; Online matching; Secretary problem; Sequential assignment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khatibi, A. (2017). Generalized sequential assignment problem. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97329

Chicago Manual of Style (16th Edition):

Khatibi, Arash. “Generalized sequential assignment problem.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed October 19, 2019. http://hdl.handle.net/2142/97329.

MLA Handbook (7th Edition):

Khatibi, Arash. “Generalized sequential assignment problem.” 2017. Web. 19 Oct 2019.

Vancouver:

Khatibi A. Generalized sequential assignment problem. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/2142/97329.

Council of Science Editors:

Khatibi A. Generalized sequential assignment problem. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97329


University of New South Wales

21. Duell, Melissa. Strategic Traffic Assignment: Models and Applications to Capture Day-to-Day Flow Volatility.

Degree: Civil & Environmental Engineering, 2015, University of New South Wales

 Traffic assignment models continue to play a critical role in the transportation planning process. Furthermore, day-to-day traffic flow volatility is a well-acknowledged phenomenon that planners… (more)

Subjects/Keywords: Traffic network design problem; Traffic assignment; Uncertainty in modelling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duell, M. (2015). Strategic Traffic Assignment: Models and Applications to Capture Day-to-Day Flow Volatility. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/54800 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:35952/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Duell, Melissa. “Strategic Traffic Assignment: Models and Applications to Capture Day-to-Day Flow Volatility.” 2015. Doctoral Dissertation, University of New South Wales. Accessed October 19, 2019. http://handle.unsw.edu.au/1959.4/54800 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:35952/SOURCE02?view=true.

MLA Handbook (7th Edition):

Duell, Melissa. “Strategic Traffic Assignment: Models and Applications to Capture Day-to-Day Flow Volatility.” 2015. Web. 19 Oct 2019.

Vancouver:

Duell M. Strategic Traffic Assignment: Models and Applications to Capture Day-to-Day Flow Volatility. [Internet] [Doctoral dissertation]. University of New South Wales; 2015. [cited 2019 Oct 19]. Available from: http://handle.unsw.edu.au/1959.4/54800 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:35952/SOURCE02?view=true.

Council of Science Editors:

Duell M. Strategic Traffic Assignment: Models and Applications to Capture Day-to-Day Flow Volatility. [Doctoral Dissertation]. University of New South Wales; 2015. Available from: http://handle.unsw.edu.au/1959.4/54800 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:35952/SOURCE02?view=true


Iowa State University

22. Martinez-Rivera, Xavier. Principal rank characteristic sequences.

Degree: 2017, Iowa State University

The necessity to know certain information about the principal minors of a given/desired matrix is a situation that arises in several areas of mathematics. As… (more)

Subjects/Keywords: Enhanced principal rank characteristic sequence; Hermitian matrix; Minor; Rank; Signed enhanced principal rank characteristic sequence; Symmetric matrix; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Martinez-Rivera, X. (2017). Principal rank characteristic sequences. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/15365

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

Martinez-Rivera, Xavier. “Principal rank characteristic sequences.” 2017. Thesis, Iowa State University. Accessed October 19, 2019. https://lib.dr.iastate.edu/etd/15365.

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

MLA Handbook (7th Edition):

Martinez-Rivera, Xavier. “Principal rank characteristic sequences.” 2017. Web. 19 Oct 2019.

Vancouver:

Martinez-Rivera X. Principal rank characteristic sequences. [Internet] [Thesis]. Iowa State University; 2017. [cited 2019 Oct 19]. Available from: https://lib.dr.iastate.edu/etd/15365.

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

Council of Science Editors:

Martinez-Rivera X. Principal rank characteristic sequences. [Thesis]. Iowa State University; 2017. Available from: https://lib.dr.iastate.edu/etd/15365

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


Louisiana State University

23. Morgan, Evan. Some results on cubic graphs.

Degree: PhD, Applied Mathematics, 2009, Louisiana State University

 Pursuing a question of Oxley, we investigate whether the edge set of a graph admits a bipartition so that the contraction of either partite set… (more)

Subjects/Keywords: minor

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Morgan, E. (2009). Some results on cubic graphs. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-06302009-171138 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3553

Chicago Manual of Style (16th Edition):

Morgan, Evan. “Some results on cubic graphs.” 2009. Doctoral Dissertation, Louisiana State University. Accessed October 19, 2019. etd-06302009-171138 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3553.

MLA Handbook (7th Edition):

Morgan, Evan. “Some results on cubic graphs.” 2009. Web. 19 Oct 2019.

Vancouver:

Morgan E. Some results on cubic graphs. [Internet] [Doctoral dissertation]. Louisiana State University; 2009. [cited 2019 Oct 19]. Available from: etd-06302009-171138 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3553.

Council of Science Editors:

Morgan E. Some results on cubic graphs. [Doctoral Dissertation]. Louisiana State University; 2009. Available from: etd-06302009-171138 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3553

24. Ratli, Mustapha. Système de gestion du stationnement dans un environnement dynamique et multi-objectifs : Parking management system in a dynamic and multi-objective environment.

Degree: Docteur es, Informatique, 2014, Valenciennes

Aujourd'hui, le problème de stationnement devient l'un des enjeux majeurs de la recherche dans la planification des transports urbains et la gestion du trafic. En… (more)

Subjects/Keywords: Plus court chemin bi-Objectif; Affectation bi-Objectif; Parking intelligent; Affectation dynamique; Apprentissage; Métaheuristique.; Bi-Objective shortest path problem; Bi-Objective assignment problem; Smartparking; Dynamic assignment problem; Learning; Metaheuristic.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ratli, M. (2014). Système de gestion du stationnement dans un environnement dynamique et multi-objectifs : Parking management system in a dynamic and multi-objective environment. (Doctoral Dissertation). Valenciennes. Retrieved from http://www.theses.fr/2014VALE0035

Chicago Manual of Style (16th Edition):

Ratli, Mustapha. “Système de gestion du stationnement dans un environnement dynamique et multi-objectifs : Parking management system in a dynamic and multi-objective environment.” 2014. Doctoral Dissertation, Valenciennes. Accessed October 19, 2019. http://www.theses.fr/2014VALE0035.

MLA Handbook (7th Edition):

Ratli, Mustapha. “Système de gestion du stationnement dans un environnement dynamique et multi-objectifs : Parking management system in a dynamic and multi-objective environment.” 2014. Web. 19 Oct 2019.

Vancouver:

Ratli M. Système de gestion du stationnement dans un environnement dynamique et multi-objectifs : Parking management system in a dynamic and multi-objective environment. [Internet] [Doctoral dissertation]. Valenciennes; 2014. [cited 2019 Oct 19]. Available from: http://www.theses.fr/2014VALE0035.

Council of Science Editors:

Ratli M. Système de gestion du stationnement dans un environnement dynamique et multi-objectifs : Parking management system in a dynamic and multi-objective environment. [Doctoral Dissertation]. Valenciennes; 2014. Available from: http://www.theses.fr/2014VALE0035


Georgia Tech

25. Santiago, Claudio Prata. On the nonnegative least squares.

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

 In this document, we study the nonnegative least squares primal-dual method for solving linear programming problems. In particular, we investigate connections between this primal-dual method… (more)

Subjects/Keywords: Nonnegative Least Squares; Assignment problem; NNLS primal-dual; Least squares; Assignment problems (Programming); Linear programming; Maxima and minima; Non-negative matrices

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Santiago, C. P. (2009). On the nonnegative least squares. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/31768

Chicago Manual of Style (16th Edition):

Santiago, Claudio Prata. “On the nonnegative least squares.” 2009. Doctoral Dissertation, Georgia Tech. Accessed October 19, 2019. http://hdl.handle.net/1853/31768.

MLA Handbook (7th Edition):

Santiago, Claudio Prata. “On the nonnegative least squares.” 2009. Web. 19 Oct 2019.

Vancouver:

Santiago CP. On the nonnegative least squares. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2019 Oct 19]. Available from: http://hdl.handle.net/1853/31768.

Council of Science Editors:

Santiago CP. On the nonnegative least squares. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/31768

26. Cung, Quang Hong. THE EVACUATION PROBLEM IN MULTI-STORY BUILDINGS.

Degree: 2019, University of Massachusetts

  The pressure from high population density leads to the creation of high-rise structures within urban areas. Consequently, the design of facilities which confront the… (more)

Subjects/Keywords: Quadratic Assignment Problem (QAP); Quadratic Set Packing (QSP); Multi-Story Assignment Problem (MSAP); Stochastic Processes; Operations Research, Systems Engineering and Industrial Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cung, Q. H. (2019). THE EVACUATION PROBLEM IN MULTI-STORY BUILDINGS. (Thesis). University of Massachusetts. Retrieved from https://scholarworks.umass.edu/masters_theses_2/737

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

Cung, Quang Hong. “THE EVACUATION PROBLEM IN MULTI-STORY BUILDINGS.” 2019. Thesis, University of Massachusetts. Accessed October 19, 2019. https://scholarworks.umass.edu/masters_theses_2/737.

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

MLA Handbook (7th Edition):

Cung, Quang Hong. “THE EVACUATION PROBLEM IN MULTI-STORY BUILDINGS.” 2019. Web. 19 Oct 2019.

Vancouver:

Cung QH. THE EVACUATION PROBLEM IN MULTI-STORY BUILDINGS. [Internet] [Thesis]. University of Massachusetts; 2019. [cited 2019 Oct 19]. Available from: https://scholarworks.umass.edu/masters_theses_2/737.

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

Council of Science Editors:

Cung QH. THE EVACUATION PROBLEM IN MULTI-STORY BUILDINGS. [Thesis]. University of Massachusetts; 2019. Available from: https://scholarworks.umass.edu/masters_theses_2/737

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


Loughborough University

27. Woodcock, Andrew John. Solving the generalized assignment problem : a hybrid Tabu search/branch and bound algorithm.

Degree: PhD, 2007, Loughborough University

 The research reported in this thesis considers the classical combinatorial optimization problem known as the Generalized Assignment Problem (GAP). Since the mid 1970's researchers have… (more)

Subjects/Keywords: 519.614; Integer programming : Tabu search : Branch and bound : Generalized assignment problem : Heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Woodcock, A. J. (2007). Solving the generalized assignment problem : a hybrid Tabu search/branch and bound algorithm. (Doctoral Dissertation). Loughborough University. Retrieved from https://dspace.lboro.ac.uk/2134/17881 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.492822

Chicago Manual of Style (16th Edition):

Woodcock, Andrew John. “Solving the generalized assignment problem : a hybrid Tabu search/branch and bound algorithm.” 2007. Doctoral Dissertation, Loughborough University. Accessed October 19, 2019. https://dspace.lboro.ac.uk/2134/17881 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.492822.

MLA Handbook (7th Edition):

Woodcock, Andrew John. “Solving the generalized assignment problem : a hybrid Tabu search/branch and bound algorithm.” 2007. Web. 19 Oct 2019.

Vancouver:

Woodcock AJ. Solving the generalized assignment problem : a hybrid Tabu search/branch and bound algorithm. [Internet] [Doctoral dissertation]. Loughborough University; 2007. [cited 2019 Oct 19]. Available from: https://dspace.lboro.ac.uk/2134/17881 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.492822.

Council of Science Editors:

Woodcock AJ. Solving the generalized assignment problem : a hybrid Tabu search/branch and bound algorithm. [Doctoral Dissertation]. Loughborough University; 2007. Available from: https://dspace.lboro.ac.uk/2134/17881 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.492822

28. Lundquist, Josefin. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB.

Degree: Mathematics and Mathematical Statistics, 2017, Umeå University

  A key challenge for manufacturing companies is to store parts in an efficient way atthe lowest cost possible. As the demand of differentiated products… (more)

Subjects/Keywords: Inventory optimization; Integer programming; Generalized assignment problem; Combinatorial optimization; Greedy heuristic; Constructive algorithm; Mathematics; Matematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lundquist, J. (2017). An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB. (Thesis). Umeå University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825

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

Lundquist, Josefin. “An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB.” 2017. Thesis, Umeå University. Accessed October 19, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825.

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

MLA Handbook (7th Edition):

Lundquist, Josefin. “An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB.” 2017. Web. 19 Oct 2019.

Vancouver:

Lundquist J. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB. [Internet] [Thesis]. Umeå University; 2017. [cited 2019 Oct 19]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825.

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

Council of Science Editors:

Lundquist J. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB. [Thesis]. Umeå University; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825

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

29. Μπαλαφούτη, Παναγιώτα. Μορφές ανάλυσης ευαισθησίας για προβλήματα γραμμικού προγραμματισμού.

Degree: 2010, University of Patras

Ο γραμμικός προγραμματισμός είναι μια μεθοδολογία της Επιχειρησιακής Έρευνας η οποία ασχολείται με το πρόβλημα της κατανομής των περιορισμένων πόρων ενός συστήματος σε ανταγωνιζόμενες μεταξύ… (more)

Subjects/Keywords: Ανάλυση ευαισθησίας; Γραμμικός προγραμματισμός; Πρόβλημα καταμερισμού εργασίας (εκχώρησης); 519.72; Sensitivity analysis; Linear programming; Assignment problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Μπαλαφούτη, . (2010). Μορφές ανάλυσης ευαισθησίας για προβλήματα γραμμικού προγραμματισμού. (Masters Thesis). University of Patras. Retrieved from http://nemertes.lis.upatras.gr/jspui/handle/10889/3715

Chicago Manual of Style (16th Edition):

Μπαλαφούτη, Παναγιώτα. “Μορφές ανάλυσης ευαισθησίας για προβλήματα γραμμικού προγραμματισμού.” 2010. Masters Thesis, University of Patras. Accessed October 19, 2019. http://nemertes.lis.upatras.gr/jspui/handle/10889/3715.

MLA Handbook (7th Edition):

Μπαλαφούτη, Παναγιώτα. “Μορφές ανάλυσης ευαισθησίας για προβλήματα γραμμικού προγραμματισμού.” 2010. Web. 19 Oct 2019.

Vancouver:

Μπαλαφούτη . Μορφές ανάλυσης ευαισθησίας για προβλήματα γραμμικού προγραμματισμού. [Internet] [Masters thesis]. University of Patras; 2010. [cited 2019 Oct 19]. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/3715.

Council of Science Editors:

Μπαλαφούτη . Μορφές ανάλυσης ευαισθησίας για προβλήματα γραμμικού προγραμματισμού. [Masters Thesis]. University of Patras; 2010. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/3715


University of Louisville

30. Riley, Ashley S. Maximizing the efficiency of a speed rail for the preparation of alcoholic beverages.

Degree: MS, 2010, University of Louisville

 Typically bartenders will arrange liquor bottles in a bar based on their own preferences. This research project describes an alternative way to arrange the bottles… (more)

Subjects/Keywords: Block diagramming; Speed rails; Quadratic assignment problem; Maximizing efficiency of speed rail

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Riley, A. S. (2010). Maximizing the efficiency of a speed rail for the preparation of alcoholic beverages. (Masters Thesis). University of Louisville. Retrieved from 10.18297/etd/1209 ; https://ir.library.louisville.edu/etd/1209

Chicago Manual of Style (16th Edition):

Riley, Ashley S. “Maximizing the efficiency of a speed rail for the preparation of alcoholic beverages.” 2010. Masters Thesis, University of Louisville. Accessed October 19, 2019. 10.18297/etd/1209 ; https://ir.library.louisville.edu/etd/1209.

MLA Handbook (7th Edition):

Riley, Ashley S. “Maximizing the efficiency of a speed rail for the preparation of alcoholic beverages.” 2010. Web. 19 Oct 2019.

Vancouver:

Riley AS. Maximizing the efficiency of a speed rail for the preparation of alcoholic beverages. [Internet] [Masters thesis]. University of Louisville; 2010. [cited 2019 Oct 19]. Available from: 10.18297/etd/1209 ; https://ir.library.louisville.edu/etd/1209.

Council of Science Editors:

Riley AS. Maximizing the efficiency of a speed rail for the preparation of alcoholic beverages. [Masters Thesis]. University of Louisville; 2010. Available from: 10.18297/etd/1209 ; https://ir.library.louisville.edu/etd/1209

[1] [2] [3] [4] [5] … [408]

.