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:(Assignment problems Programming ). Showing records 1 – 30 of 18836 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Hong Kong

1. U, Leong-Hou. Matching problems in large databases.

Degree: PhD, 2010, University of Hong Kong

published_or_final_version

Computer Science

Doctoral

Doctor of Philosophy

Advisors/Committee Members: Mamoulis, N.

Subjects/Keywords: Assignment problems (Programming)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

U, L. (2010). Matching problems in large databases. (Doctoral Dissertation). University of Hong Kong. Retrieved from U, L. H. [余亮豪]. (2010). Matching problems in large databases. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4391048 ; http://dx.doi.org/10.5353/th_b4391048 ; http://hdl.handle.net/10722/61072

Chicago Manual of Style (16th Edition):

U, Leong-Hou. “Matching problems in large databases.” 2010. Doctoral Dissertation, University of Hong Kong. Accessed October 23, 2019. U, L. H. [余亮豪]. (2010). Matching problems in large databases. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4391048 ; http://dx.doi.org/10.5353/th_b4391048 ; http://hdl.handle.net/10722/61072.

MLA Handbook (7th Edition):

U, Leong-Hou. “Matching problems in large databases.” 2010. Web. 23 Oct 2019.

Vancouver:

U L. Matching problems in large databases. [Internet] [Doctoral dissertation]. University of Hong Kong; 2010. [cited 2019 Oct 23]. Available from: U, L. H. [余亮豪]. (2010). Matching problems in large databases. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4391048 ; http://dx.doi.org/10.5353/th_b4391048 ; http://hdl.handle.net/10722/61072.

Council of Science Editors:

U L. Matching problems in large databases. [Doctoral Dissertation]. University of Hong Kong; 2010. Available from: U, L. H. [余亮豪]. (2010). Matching problems in large databases. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4391048 ; http://dx.doi.org/10.5353/th_b4391048 ; http://hdl.handle.net/10722/61072


Georgia Tech

2. Kaluskar, Vivek P. An aggressive live range splitting and coalescing framework for efficient registrar allocation.

Degree: MS, Computer science, 2003, Georgia Tech

Subjects/Keywords: Registers (Computers); Assignment problems (Programming)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kaluskar, V. P. (2003). An aggressive live range splitting and coalescing framework for efficient registrar allocation. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/5415

Chicago Manual of Style (16th Edition):

Kaluskar, Vivek P. “An aggressive live range splitting and coalescing framework for efficient registrar allocation.” 2003. Masters Thesis, Georgia Tech. Accessed October 23, 2019. http://hdl.handle.net/1853/5415.

MLA Handbook (7th Edition):

Kaluskar, Vivek P. “An aggressive live range splitting and coalescing framework for efficient registrar allocation.” 2003. Web. 23 Oct 2019.

Vancouver:

Kaluskar VP. An aggressive live range splitting and coalescing framework for efficient registrar allocation. [Internet] [Masters thesis]. Georgia Tech; 2003. [cited 2019 Oct 23]. Available from: http://hdl.handle.net/1853/5415.

Council of Science Editors:

Kaluskar VP. An aggressive live range splitting and coalescing framework for efficient registrar allocation. [Masters Thesis]. Georgia Tech; 2003. Available from: http://hdl.handle.net/1853/5415


Georgia Tech

3. 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 23, 2019. http://hdl.handle.net/1853/31768.

MLA Handbook (7th Edition):

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

Vancouver:

Santiago CP. On the nonnegative least squares. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2019 Oct 23]. 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


University of Illinois – Urbana-Champaign

4. Yu, Ge. Dynamic online resource allocation problems.

Degree: PhD, Electrical & Computer Engr, 2018, University of Illinois – Urbana-Champaign

 Online resource allocation problems consider assigning a limited number of available resources to sequentially arriving requests with the objective to maximize rewards. With the emergence… (more)

Subjects/Keywords: Online assignment; resource allocation problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yu, G. (2018). Dynamic online resource allocation problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/100930

Chicago Manual of Style (16th Edition):

Yu, Ge. “Dynamic online resource allocation problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed October 23, 2019. http://hdl.handle.net/2142/100930.

MLA Handbook (7th Edition):

Yu, Ge. “Dynamic online resource allocation problems.” 2018. Web. 23 Oct 2019.

Vancouver:

Yu G. Dynamic online resource allocation problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2019 Oct 23]. Available from: http://hdl.handle.net/2142/100930.

Council of Science Editors:

Yu G. Dynamic online resource allocation problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/100930


University of Windsor

5. Jaisingh, Suresh Chandra. Heuristic approaches to quadratic assignment problems.

Degree: PhD, Industrial and Manufacturing Systems Engineering, 1981, University of Windsor

Subjects/Keywords: APPROACHES; ASSIGNMENT; HEURISTIC; PROBLEMS; QUADRATIC; QUADRATIC ASSIGNMENT; Quadratic assignment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jaisingh, S. C. (1981). Heuristic approaches to quadratic assignment problems. (Doctoral Dissertation). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/6123

Chicago Manual of Style (16th Edition):

Jaisingh, Suresh Chandra. “Heuristic approaches to quadratic assignment problems.” 1981. Doctoral Dissertation, University of Windsor. Accessed October 23, 2019. https://scholar.uwindsor.ca/etd/6123.

MLA Handbook (7th Edition):

Jaisingh, Suresh Chandra. “Heuristic approaches to quadratic assignment problems.” 1981. Web. 23 Oct 2019.

Vancouver:

Jaisingh SC. Heuristic approaches to quadratic assignment problems. [Internet] [Doctoral dissertation]. University of Windsor; 1981. [cited 2019 Oct 23]. Available from: https://scholar.uwindsor.ca/etd/6123.

Council of Science Editors:

Jaisingh SC. Heuristic approaches to quadratic assignment problems. [Doctoral Dissertation]. University of Windsor; 1981. Available from: https://scholar.uwindsor.ca/etd/6123


Georgia Tech

6. Viguria Jimenez, Luis Antidio. Distributed Task Allocation Methodologies for Solving the Initial Formation Problem.

Degree: MS, Electrical and Computer Engineering, 2008, Georgia Tech

 Mobile sensor networks have been shown to be a powerful tool for enabling a number of activities that require recording of environmental parameters at various… (more)

Subjects/Keywords: Robotics; Multi-robot cooperation; Market-based approach; Wireless sensor networks; Robotics; Detectors; Algorithms; Assignment problems (Programming)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Viguria Jimenez, L. A. (2008). Distributed Task Allocation Methodologies for Solving the Initial Formation Problem. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/24731

Chicago Manual of Style (16th Edition):

Viguria Jimenez, Luis Antidio. “Distributed Task Allocation Methodologies for Solving the Initial Formation Problem.” 2008. Masters Thesis, Georgia Tech. Accessed October 23, 2019. http://hdl.handle.net/1853/24731.

MLA Handbook (7th Edition):

Viguria Jimenez, Luis Antidio. “Distributed Task Allocation Methodologies for Solving the Initial Formation Problem.” 2008. Web. 23 Oct 2019.

Vancouver:

Viguria Jimenez LA. Distributed Task Allocation Methodologies for Solving the Initial Formation Problem. [Internet] [Masters thesis]. Georgia Tech; 2008. [cited 2019 Oct 23]. Available from: http://hdl.handle.net/1853/24731.

Council of Science Editors:

Viguria Jimenez LA. Distributed Task Allocation Methodologies for Solving the Initial Formation Problem. [Masters Thesis]. Georgia Tech; 2008. Available from: http://hdl.handle.net/1853/24731

7. Costa, Serafim Jorge Graça Ribeiro da. Resolução do problema de atribuição de salas a exames.

Degree: 2012, Instituto Politécnico do Porto

Este trabalho pretende resolver o problema das alocações de salas a exames no Departamento de Engenharia Mecânica do Instituto Superior de Engenharia do Porto. A… (more)

Subjects/Keywords: Problema de horários; Problema de horários universitários; Programação linear inteira; Atribuição de salas de aula a exames; Calendário de exames; Scheduling problems; University Class Scheduling,; Integer Linear Programming; Classroom assignment for exam timetabling; Exam timetabling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Costa, S. J. G. R. d. (2012). Resolução do problema de atribuição de salas a exames. (Thesis). Instituto Politécnico do Porto. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/6564

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

Costa, Serafim Jorge Graça Ribeiro da. “Resolução do problema de atribuição de salas a exames.” 2012. Thesis, Instituto Politécnico do Porto. Accessed October 23, 2019. http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/6564.

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

MLA Handbook (7th Edition):

Costa, Serafim Jorge Graça Ribeiro da. “Resolução do problema de atribuição de salas a exames.” 2012. Web. 23 Oct 2019.

Vancouver:

Costa SJGRd. Resolução do problema de atribuição de salas a exames. [Internet] [Thesis]. Instituto Politécnico do Porto; 2012. [cited 2019 Oct 23]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/6564.

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

Council of Science Editors:

Costa SJGRd. Resolução do problema de atribuição de salas a exames. [Thesis]. Instituto Politécnico do Porto; 2012. Available from: http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/6564

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


University of Florida

8. Pitsoulis, Leonidas S., 1969-. Algorithms for nonlinear assignment problems.

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

Subjects/Keywords: Algorithms; Combinatorial optimization; Cost allocation; Heuristics; Linear programming; Matrices; Objective functions; Optimal solutions; Permutations; Sensors; Nonlinear assignment problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pitsoulis, Leonidas S., 1. (1998). Algorithms for nonlinear assignment problems. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00038310

Chicago Manual of Style (16th Edition):

Pitsoulis, Leonidas S., 1969-. “Algorithms for nonlinear assignment problems.” 1998. Doctoral Dissertation, University of Florida. Accessed October 23, 2019. http://ufdc.ufl.edu/AA00038310.

MLA Handbook (7th Edition):

Pitsoulis, Leonidas S., 1969-. “Algorithms for nonlinear assignment problems.” 1998. Web. 23 Oct 2019.

Vancouver:

Pitsoulis, Leonidas S. 1. Algorithms for nonlinear assignment problems. [Internet] [Doctoral dissertation]. University of Florida; 1998. [cited 2019 Oct 23]. Available from: http://ufdc.ufl.edu/AA00038310.

Council of Science Editors:

Pitsoulis, Leonidas S. 1. Algorithms for nonlinear assignment problems. [Doctoral Dissertation]. University of Florida; 1998. Available from: http://ufdc.ufl.edu/AA00038310


Ohio University

9. Wu, Xinying. Heuristic for Multi-type Component Assignment Problems through the Birnbaum Importance.

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

 This thesis proposes a heuristic for solving multi-type component assignment problems (CAP) to maximize the whole system reliability. Birnbaum importance (BI) is applied in this… (more)

Subjects/Keywords: Engineering; Industrial Engineering; Component assignment problems; system reliability; BI; heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, X. (2014). Heuristic for Multi-type Component Assignment Problems through the Birnbaum Importance. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1405257163

Chicago Manual of Style (16th Edition):

Wu, Xinying. “Heuristic for Multi-type Component Assignment Problems through the Birnbaum Importance.” 2014. Masters Thesis, Ohio University. Accessed October 23, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1405257163.

MLA Handbook (7th Edition):

Wu, Xinying. “Heuristic for Multi-type Component Assignment Problems through the Birnbaum Importance.” 2014. Web. 23 Oct 2019.

Vancouver:

Wu X. Heuristic for Multi-type Component Assignment Problems through the Birnbaum Importance. [Internet] [Masters thesis]. Ohio University; 2014. [cited 2019 Oct 23]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1405257163.

Council of Science Editors:

Wu X. Heuristic for Multi-type Component Assignment Problems through the Birnbaum Importance. [Masters Thesis]. Ohio University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1405257163


McMaster University

10. Li, Jingqun. EFFICIENT DATA ASSOCIATION ALGORITHMS FOR MULTI-TARGET TRACKING.

Degree: PhD, 2019, McMaster University

Efficient multi-dimensional assignment algorithms and their application in multi-frame tracking

In this work, we propose a novel convex dual approach to the multidimensional dimensional assignment(more)

Subjects/Keywords: Binary programming; Optimization; Multi-target tracking; assignment problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, J. (2019). EFFICIENT DATA ASSOCIATION ALGORITHMS FOR MULTI-TARGET TRACKING. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/25001

Chicago Manual of Style (16th Edition):

Li, Jingqun. “EFFICIENT DATA ASSOCIATION ALGORITHMS FOR MULTI-TARGET TRACKING.” 2019. Doctoral Dissertation, McMaster University. Accessed October 23, 2019. http://hdl.handle.net/11375/25001.

MLA Handbook (7th Edition):

Li, Jingqun. “EFFICIENT DATA ASSOCIATION ALGORITHMS FOR MULTI-TARGET TRACKING.” 2019. Web. 23 Oct 2019.

Vancouver:

Li J. EFFICIENT DATA ASSOCIATION ALGORITHMS FOR MULTI-TARGET TRACKING. [Internet] [Doctoral dissertation]. McMaster University; 2019. [cited 2019 Oct 23]. Available from: http://hdl.handle.net/11375/25001.

Council of Science Editors:

Li J. EFFICIENT DATA ASSOCIATION ALGORITHMS FOR MULTI-TARGET TRACKING. [Doctoral Dissertation]. McMaster University; 2019. Available from: http://hdl.handle.net/11375/25001


ETH Zürich

11. Burkard, Michael. A continuous relaxation based heuristic for a class of constrained semi-assignment problems.

Degree: 2000, ETH Zürich

Subjects/Keywords: KOMBINATORISCHE PROBLEME (DISKRETE OPTIMIERUNG); DISKRETE DYNAMISCHE SYSTEME (ANALYSIS); ZUORDNUNGSPROBLEME (LINEARE OPTIMIERUNG); COMBINATORIAL PROBLEMS (DISCRETE PROGRAMMING); DISCRETE DYNAMICAL SYSTEMS (MATHEMATICAL ANALYSIS); ASSIGNMENT PROBLEMS (LINEAR PROGRAMMING); info:eu-repo/classification/ddc/510; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Burkard, M. (2000). A continuous relaxation based heuristic for a class of constrained semi-assignment problems. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/144671

Chicago Manual of Style (16th Edition):

Burkard, Michael. “A continuous relaxation based heuristic for a class of constrained semi-assignment problems.” 2000. Doctoral Dissertation, ETH Zürich. Accessed October 23, 2019. http://hdl.handle.net/20.500.11850/144671.

MLA Handbook (7th Edition):

Burkard, Michael. “A continuous relaxation based heuristic for a class of constrained semi-assignment problems.” 2000. Web. 23 Oct 2019.

Vancouver:

Burkard M. A continuous relaxation based heuristic for a class of constrained semi-assignment problems. [Internet] [Doctoral dissertation]. ETH Zürich; 2000. [cited 2019 Oct 23]. Available from: http://hdl.handle.net/20.500.11850/144671.

Council of Science Editors:

Burkard M. A continuous relaxation based heuristic for a class of constrained semi-assignment problems. [Doctoral Dissertation]. ETH Zürich; 2000. Available from: http://hdl.handle.net/20.500.11850/144671


University of Iowa

12. Jin, Huan. Workforce planning in manufacturing and healthcare systems.

Degree: PhD, Business Administration, 2016, University of Iowa

  This dissertation explores workforce planning in manufacturing and healthcare systems. In manufacturing systems, the existing workforce planning models often lack fidelity with respect to… (more)

Subjects/Keywords: Dynamic programming; Human Learning; Integer programming; Nonlinear programming; Task assignment; Technician routing; Business Administration, Management, and Operations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jin, H. (2016). Workforce planning in manufacturing and healthcare systems. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/5784

Chicago Manual of Style (16th Edition):

Jin, Huan. “Workforce planning in manufacturing and healthcare systems.” 2016. Doctoral Dissertation, University of Iowa. Accessed October 23, 2019. https://ir.uiowa.edu/etd/5784.

MLA Handbook (7th Edition):

Jin, Huan. “Workforce planning in manufacturing and healthcare systems.” 2016. Web. 23 Oct 2019.

Vancouver:

Jin H. Workforce planning in manufacturing and healthcare systems. [Internet] [Doctoral dissertation]. University of Iowa; 2016. [cited 2019 Oct 23]. Available from: https://ir.uiowa.edu/etd/5784.

Council of Science Editors:

Jin H. Workforce planning in manufacturing and healthcare systems. [Doctoral Dissertation]. University of Iowa; 2016. Available from: https://ir.uiowa.edu/etd/5784


Northeastern University

13. Karbeyaz, Ceyhun Efe. Optimized participant assignment for an online experimental framework.

Degree: PhD, Department of Electrical and Computer Engineering, 2015, Northeastern University

 Experimental research is being transformed from being based in physical laboratories centered in research universities into web-based experimental platforms. Our group has built a web-based… (more)

Subjects/Keywords: job scheduling; optimization; participant assignment; Heuristic algorithms; Computer algorithms; Dynamic programming; Linear programming; Integer programming; Scheduling; Mathematical models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Karbeyaz, C. E. (2015). Optimized participant assignment for an online experimental framework. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20193938

Chicago Manual of Style (16th Edition):

Karbeyaz, Ceyhun Efe. “Optimized participant assignment for an online experimental framework.” 2015. Doctoral Dissertation, Northeastern University. Accessed October 23, 2019. http://hdl.handle.net/2047/D20193938.

MLA Handbook (7th Edition):

Karbeyaz, Ceyhun Efe. “Optimized participant assignment for an online experimental framework.” 2015. Web. 23 Oct 2019.

Vancouver:

Karbeyaz CE. Optimized participant assignment for an online experimental framework. [Internet] [Doctoral dissertation]. Northeastern University; 2015. [cited 2019 Oct 23]. Available from: http://hdl.handle.net/2047/D20193938.

Council of Science Editors:

Karbeyaz CE. Optimized participant assignment for an online experimental framework. [Doctoral Dissertation]. Northeastern University; 2015. Available from: http://hdl.handle.net/2047/D20193938


University of Hong Kong

14. 洪媛媛.; Hong, Yuanyaun. Localization for wireless sensor networks of diversified topologies.

Degree: M. Phil., 2010, University of Hong Kong

published_or_final_version

Electrical and Electronic Engineering

Master

Master of Philosophy

Subjects/Keywords: Wireless sensor networks.; Location problems (Programming)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

洪媛媛.; Hong, Y. (2010). Localization for wireless sensor networks of diversified topologies. (Masters Thesis). University of Hong Kong. Retrieved from Hong, Y. [洪媛媛]. (2010). Localization for wireless sensor networks of diversified topologies. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4516159 ; http://dx.doi.org/10.5353/th_b4516159 ; http://hdl.handle.net/10722/131767

Chicago Manual of Style (16th Edition):

洪媛媛.; Hong, Yuanyaun. “Localization for wireless sensor networks of diversified topologies.” 2010. Masters Thesis, University of Hong Kong. Accessed October 23, 2019. Hong, Y. [洪媛媛]. (2010). Localization for wireless sensor networks of diversified topologies. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4516159 ; http://dx.doi.org/10.5353/th_b4516159 ; http://hdl.handle.net/10722/131767.

MLA Handbook (7th Edition):

洪媛媛.; Hong, Yuanyaun. “Localization for wireless sensor networks of diversified topologies.” 2010. Web. 23 Oct 2019.

Vancouver:

洪媛媛.; Hong Y. Localization for wireless sensor networks of diversified topologies. [Internet] [Masters thesis]. University of Hong Kong; 2010. [cited 2019 Oct 23]. Available from: Hong, Y. [洪媛媛]. (2010). Localization for wireless sensor networks of diversified topologies. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4516159 ; http://dx.doi.org/10.5353/th_b4516159 ; http://hdl.handle.net/10722/131767.

Council of Science Editors:

洪媛媛.; Hong Y. Localization for wireless sensor networks of diversified topologies. [Masters Thesis]. University of Hong Kong; 2010. Available from: Hong, Y. [洪媛媛]. (2010). Localization for wireless sensor networks of diversified topologies. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4516159 ; http://dx.doi.org/10.5353/th_b4516159 ; http://hdl.handle.net/10722/131767


University of Hong Kong

15. Qiao, Dapeng. Solutions for wireless sensor network localization.

Degree: PhD, 2012, University of Hong Kong

 Wireless sensor network localization opens the door to many location based applications. In this thesis, some solutions obtained from localization algorithms are investigated. There are… (more)

Subjects/Keywords: Wireless sensor networks.; Location problems (Programming)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Qiao, D. (2012). Solutions for wireless sensor network localization. (Doctoral Dissertation). University of Hong Kong. Retrieved from Qiao, D. [乔大鹏]. (2012). Solutions for wireless sensor network localization. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4784953 ; http://dx.doi.org/10.5353/th_b4784953 ; http://hdl.handle.net/10722/174511

Chicago Manual of Style (16th Edition):

Qiao, Dapeng. “Solutions for wireless sensor network localization.” 2012. Doctoral Dissertation, University of Hong Kong. Accessed October 23, 2019. Qiao, D. [乔大鹏]. (2012). Solutions for wireless sensor network localization. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4784953 ; http://dx.doi.org/10.5353/th_b4784953 ; http://hdl.handle.net/10722/174511.

MLA Handbook (7th Edition):

Qiao, Dapeng. “Solutions for wireless sensor network localization.” 2012. Web. 23 Oct 2019.

Vancouver:

Qiao D. Solutions for wireless sensor network localization. [Internet] [Doctoral dissertation]. University of Hong Kong; 2012. [cited 2019 Oct 23]. Available from: Qiao, D. [乔大鹏]. (2012). Solutions for wireless sensor network localization. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4784953 ; http://dx.doi.org/10.5353/th_b4784953 ; http://hdl.handle.net/10722/174511.

Council of Science Editors:

Qiao D. Solutions for wireless sensor network localization. [Doctoral Dissertation]. University of Hong Kong; 2012. Available from: Qiao, D. [乔大鹏]. (2012). Solutions for wireless sensor network localization. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4784953 ; http://dx.doi.org/10.5353/th_b4784953 ; http://hdl.handle.net/10722/174511

16. Kalaitzis, Christos. Applications of Strong Convex Relaxations to Allocation Problems.

Degree: 2017, EPFL

 Approximation algorithms are a commonly used tool for designing efficient algorithmic solutions for intractable problems, at the expense of the quality of the output solution.… (more)

Subjects/Keywords: Approximation Algorithms; Linear Programming; NP-hard problems; Allocation Problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kalaitzis, C. (2017). Applications of Strong Convex Relaxations to Allocation Problems. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/226171

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

Kalaitzis, Christos. “Applications of Strong Convex Relaxations to Allocation Problems.” 2017. Thesis, EPFL. Accessed October 23, 2019. http://infoscience.epfl.ch/record/226171.

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

MLA Handbook (7th Edition):

Kalaitzis, Christos. “Applications of Strong Convex Relaxations to Allocation Problems.” 2017. Web. 23 Oct 2019.

Vancouver:

Kalaitzis C. Applications of Strong Convex Relaxations to Allocation Problems. [Internet] [Thesis]. EPFL; 2017. [cited 2019 Oct 23]. Available from: http://infoscience.epfl.ch/record/226171.

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

Council of Science Editors:

Kalaitzis C. Applications of Strong Convex Relaxations to Allocation Problems. [Thesis]. EPFL; 2017. Available from: http://infoscience.epfl.ch/record/226171

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


Univerzitet u Beogradu

17. 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 23, 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. 23 Oct 2019.

Vancouver:

Danilović, Miloš D. 1. Унапређење конструктивних хеуристика за проблеме комбинаторне оптимизације у операционом менаџменту. [Internet] [Thesis]. Univerzitet u Beogradu; 2018. [cited 2019 Oct 23]. 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


Loughborough University

18. 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 23, 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. 23 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 23]. 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

19. 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 23, 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. 23 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 23]. 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

20. 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 23, 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. 23 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 23]. 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

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

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 23, 2019. http://nemertes.lis.upatras.gr/jspui/handle/10889/3715.

MLA Handbook (7th Edition):

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

Vancouver:

Μπαλαφούτη . Μορφές ανάλυσης ευαισθησίας για προβλήματα γραμμικού προγραμματισμού. [Internet] [Masters thesis]. University of Patras; 2010. [cited 2019 Oct 23]. 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

22. Elmes, Brandon B. A multi-objective decision support system for worker-task assignments and workforce training.

Degree: M. Eng., 2011, University of Louisville

 This paper models a realistic problem involving workforce assignment and training for a large manufacturing environment. In this particular environment, the workforce is undertrained and… (more)

Subjects/Keywords: Worker assignment; Hueristic; Decision support system; Meta-RaPS; Compromise programming; Multi-objective

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Elmes, B. B. (2011). A multi-objective decision support system for worker-task assignments and workforce training. (Masters Thesis). University of Louisville. Retrieved from 10.18297/etd/401 ; https://ir.library.louisville.edu/etd/401

Chicago Manual of Style (16th Edition):

Elmes, Brandon B. “A multi-objective decision support system for worker-task assignments and workforce training.” 2011. Masters Thesis, University of Louisville. Accessed October 23, 2019. 10.18297/etd/401 ; https://ir.library.louisville.edu/etd/401.

MLA Handbook (7th Edition):

Elmes, Brandon B. “A multi-objective decision support system for worker-task assignments and workforce training.” 2011. Web. 23 Oct 2019.

Vancouver:

Elmes BB. A multi-objective decision support system for worker-task assignments and workforce training. [Internet] [Masters thesis]. University of Louisville; 2011. [cited 2019 Oct 23]. Available from: 10.18297/etd/401 ; https://ir.library.louisville.edu/etd/401.

Council of Science Editors:

Elmes BB. A multi-objective decision support system for worker-task assignments and workforce training. [Masters Thesis]. University of Louisville; 2011. Available from: 10.18297/etd/401 ; https://ir.library.louisville.edu/etd/401


Case Western Reserve University

23. Rakkarn, Sakchai. OPERATION ASSIGNMENT WITH BOARD SPLITTING AND MULTIPLE MACHINES IN PRINTED CIRCUIT BOARD ASSEMBLY.

Degree: PhD, Systems and Control Engineering, 2008, Case Western Reserve University

 This research considers an operation assignment problem arising from printed circuit board (PCB) assembly process. We focus on the case most prevalent in today’s PCB… (more)

Subjects/Keywords: Engineering, Industrial; Operation Assignment; Printed Circuit Board Assembly; Binary Programming; Lagrangian Relaxation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rakkarn, S. (2008). OPERATION ASSIGNMENT WITH BOARD SPLITTING AND MULTIPLE MACHINES IN PRINTED CIRCUIT BOARD ASSEMBLY. (Doctoral Dissertation). Case Western Reserve University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1201021027

Chicago Manual of Style (16th Edition):

Rakkarn, Sakchai. “OPERATION ASSIGNMENT WITH BOARD SPLITTING AND MULTIPLE MACHINES IN PRINTED CIRCUIT BOARD ASSEMBLY.” 2008. Doctoral Dissertation, Case Western Reserve University. Accessed October 23, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=case1201021027.

MLA Handbook (7th Edition):

Rakkarn, Sakchai. “OPERATION ASSIGNMENT WITH BOARD SPLITTING AND MULTIPLE MACHINES IN PRINTED CIRCUIT BOARD ASSEMBLY.” 2008. Web. 23 Oct 2019.

Vancouver:

Rakkarn S. OPERATION ASSIGNMENT WITH BOARD SPLITTING AND MULTIPLE MACHINES IN PRINTED CIRCUIT BOARD ASSEMBLY. [Internet] [Doctoral dissertation]. Case Western Reserve University; 2008. [cited 2019 Oct 23]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1201021027.

Council of Science Editors:

Rakkarn S. OPERATION ASSIGNMENT WITH BOARD SPLITTING AND MULTIPLE MACHINES IN PRINTED CIRCUIT BOARD ASSEMBLY. [Doctoral Dissertation]. Case Western Reserve University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1201021027


University of Southern California

24. Wu, Teng. A stochastic employment problem.

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

 This dissertation studied a Stochastic Assignment Problem, called “A Stochastic Employment Problem(SEP)”. There are n boxes having quota S =(S₁...Sn), that is box i needs… (more)

Subjects/Keywords: stochastic; assignment problem; sequential decision process; dynamic programming; simulation; optimization; applied probability modeling; stochastic dominance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, T. (2013). A stochastic employment problem. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/245624/rec/370

Chicago Manual of Style (16th Edition):

Wu, Teng. “A stochastic employment problem.” 2013. Doctoral Dissertation, University of Southern California. Accessed October 23, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/245624/rec/370.

MLA Handbook (7th Edition):

Wu, Teng. “A stochastic employment problem.” 2013. Web. 23 Oct 2019.

Vancouver:

Wu T. A stochastic employment problem. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2019 Oct 23]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/245624/rec/370.

Council of Science Editors:

Wu T. A stochastic employment problem. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/245624/rec/370


Iowa State University

25. Xu, Songyan. Energy-efficient task assignment of wireless sensor network with the application to agriculture.

Degree: 2010, Iowa State University

 Wireless sensor networks have attracted considerable attention from academia as well as industry. The applications of wireless sensor networks encompass the domains of industrial process… (more)

Subjects/Keywords: enery efficiency; Integer Linear Programming; task assignment; wireless sensor network; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, S. (2010). Energy-efficient task assignment of wireless sensor network with the application to agriculture. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/11763

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

Xu, Songyan. “Energy-efficient task assignment of wireless sensor network with the application to agriculture.” 2010. Thesis, Iowa State University. Accessed October 23, 2019. https://lib.dr.iastate.edu/etd/11763.

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

MLA Handbook (7th Edition):

Xu, Songyan. “Energy-efficient task assignment of wireless sensor network with the application to agriculture.” 2010. Web. 23 Oct 2019.

Vancouver:

Xu S. Energy-efficient task assignment of wireless sensor network with the application to agriculture. [Internet] [Thesis]. Iowa State University; 2010. [cited 2019 Oct 23]. Available from: https://lib.dr.iastate.edu/etd/11763.

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

Council of Science Editors:

Xu S. Energy-efficient task assignment of wireless sensor network with the application to agriculture. [Thesis]. Iowa State University; 2010. Available from: https://lib.dr.iastate.edu/etd/11763

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


University of Toronto

26. Tam, Johnny Wing-Yiu. Vehicle Routing Approaches for Solving an Order Cutoff Assignment Problem.

Degree: 2011, University of Toronto

We define an order cutoff for a retailer as a time in the day such that orders sent to the depot before this point will… (more)

Subjects/Keywords: distance constrained vehicle routing problem; branch-and-price; column generation; mixed integer programming; constraint programming; order cutoff assignment problem; 0546

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tam, J. W. (2011). Vehicle Routing Approaches for Solving an Order Cutoff Assignment Problem. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/31461

Chicago Manual of Style (16th Edition):

Tam, Johnny Wing-Yiu. “Vehicle Routing Approaches for Solving an Order Cutoff Assignment Problem.” 2011. Masters Thesis, University of Toronto. Accessed October 23, 2019. http://hdl.handle.net/1807/31461.

MLA Handbook (7th Edition):

Tam, Johnny Wing-Yiu. “Vehicle Routing Approaches for Solving an Order Cutoff Assignment Problem.” 2011. Web. 23 Oct 2019.

Vancouver:

Tam JW. Vehicle Routing Approaches for Solving an Order Cutoff Assignment Problem. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2019 Oct 23]. Available from: http://hdl.handle.net/1807/31461.

Council of Science Editors:

Tam JW. Vehicle Routing Approaches for Solving an Order Cutoff Assignment Problem. [Masters Thesis]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/31461


Brno University of Technology

27. Cabalka, Matouš. Celočíselná optimalizace pro řešení dopravních úloh .

Degree: 2016, Brno University of Technology

 Práce se zabývá optimalizačními modely v dopravních úlohách s důrazem na úlohu obchodního cestujícího. Po stručném úvodu do historie následuje část popisující základy lineárního a… (more)

Subjects/Keywords: Lineární programování; celočíselné programování; přiřazovací problém; úloha obchodního cestujícího; GAMS; Linear programming; integer programming; assignment problem; traveling salesman problem; GAMS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cabalka, M. (2016). Celočíselná optimalizace pro řešení dopravních úloh . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/61130

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

Cabalka, Matouš. “Celočíselná optimalizace pro řešení dopravních úloh .” 2016. Thesis, Brno University of Technology. Accessed October 23, 2019. http://hdl.handle.net/11012/61130.

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

MLA Handbook (7th Edition):

Cabalka, Matouš. “Celočíselná optimalizace pro řešení dopravních úloh .” 2016. Web. 23 Oct 2019.

Vancouver:

Cabalka M. Celočíselná optimalizace pro řešení dopravních úloh . [Internet] [Thesis]. Brno University of Technology; 2016. [cited 2019 Oct 23]. Available from: http://hdl.handle.net/11012/61130.

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

Council of Science Editors:

Cabalka M. Celočíselná optimalizace pro řešení dopravních úloh . [Thesis]. Brno University of Technology; 2016. Available from: http://hdl.handle.net/11012/61130

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


EPFL

28. Bazzi, Abbas. Strengths and Limitations of Linear Programming Relaxations.

Degree: 2017, EPFL

 Many of the currently best-known approximation algorithms for NP-hard optimization problems are based on Linear Programming (LP) and Semi-definite Programming (SDP) relaxations. Given its power,… (more)

Subjects/Keywords: Linear Programming; Approximation Algorithms; Integrality Gap; Graph Problems; Knapsack Problem; Scheduling Problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bazzi, A. (2017). Strengths and Limitations of Linear Programming Relaxations. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/231945

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

Bazzi, Abbas. “Strengths and Limitations of Linear Programming Relaxations.” 2017. Thesis, EPFL. Accessed October 23, 2019. http://infoscience.epfl.ch/record/231945.

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

MLA Handbook (7th Edition):

Bazzi, Abbas. “Strengths and Limitations of Linear Programming Relaxations.” 2017. Web. 23 Oct 2019.

Vancouver:

Bazzi A. Strengths and Limitations of Linear Programming Relaxations. [Internet] [Thesis]. EPFL; 2017. [cited 2019 Oct 23]. Available from: http://infoscience.epfl.ch/record/231945.

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

Council of Science Editors:

Bazzi A. Strengths and Limitations of Linear Programming Relaxations. [Thesis]. EPFL; 2017. Available from: http://infoscience.epfl.ch/record/231945

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

29. Jain, Vikas Kumar. On some aspects of multi objective mathematical programming;.

Degree: Mathematics, 2014, Jaypee University of Engineering and Technology, Guna

The thesis comprises seven chapters and the gist of each chapter is given below: newlineThe first chapter is an introductory one and contains a brief… (more)

Subjects/Keywords: Multi objective mathematical programming; Non differentiable multi objective control Problems; Vector-valued variational problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jain, V. K. (2014). On some aspects of multi objective mathematical programming;. (Thesis). Jaypee University of Engineering and Technology, Guna. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/18187

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

Jain, Vikas Kumar. “On some aspects of multi objective mathematical programming;.” 2014. Thesis, Jaypee University of Engineering and Technology, Guna. Accessed October 23, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/18187.

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

MLA Handbook (7th Edition):

Jain, Vikas Kumar. “On some aspects of multi objective mathematical programming;.” 2014. Web. 23 Oct 2019.

Vancouver:

Jain VK. On some aspects of multi objective mathematical programming;. [Internet] [Thesis]. Jaypee University of Engineering and Technology, Guna; 2014. [cited 2019 Oct 23]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/18187.

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

Council of Science Editors:

Jain VK. On some aspects of multi objective mathematical programming;. [Thesis]. Jaypee University of Engineering and Technology, Guna; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/18187

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


Australian National University

30. Bertoli, Francesco. Tactical Problems in Vehicle Routing Applications .

Degree: 2018, Australian National University

 The class of Vehicle Routing Problems (VRPs) is one the most studied topics in the Operations Research community. The vast majority of the published papers… (more)

Subjects/Keywords: Vehicle Routing Problems; Tactical Problems; Operations Research; Mathematical Programming; Metaheuristic; Discrete Optimization; Discrete Optimisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bertoli, F. (2018). Tactical Problems in Vehicle Routing Applications . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/146047

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

Bertoli, Francesco. “Tactical Problems in Vehicle Routing Applications .” 2018. Thesis, Australian National University. Accessed October 23, 2019. http://hdl.handle.net/1885/146047.

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

MLA Handbook (7th Edition):

Bertoli, Francesco. “Tactical Problems in Vehicle Routing Applications .” 2018. Web. 23 Oct 2019.

Vancouver:

Bertoli F. Tactical Problems in Vehicle Routing Applications . [Internet] [Thesis]. Australian National University; 2018. [cited 2019 Oct 23]. Available from: http://hdl.handle.net/1885/146047.

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

Council of Science Editors:

Bertoli F. Tactical Problems in Vehicle Routing Applications . [Thesis]. Australian National University; 2018. Available from: http://hdl.handle.net/1885/146047

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

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

.