Advanced search options

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

You searched for `subject:(ASSIGNMENT PROBLEMS LINEAR PROGRAMMING )`

.
Showing records 1 – 30 of
30565 total matches.

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

Search Limiters

Dates

- 2017 – 2021 (7246)
- 2012 – 2016 (11356)
- 2007 – 2011 (6922)
- 2002 – 2006 (2894)
- 1997 – 2001 (1295)
- 1992 – 1996 (800)
- 1987 – 1991 (639)
- 1982 – 1986 (484)
- 1977 – 1981 (297)
- 1972 – 1976 (339)

Universities

- Universidad Nacional de Colombia (1737)
- Brno University of Technology (1193)
- ETH Zürich (754)
- University of São Paulo (634)
- University of Florida (500)
- Virginia Tech (449)
- Georgia Tech (434)
- Delft University of Technology (405)
- Texas A&M University (353)
- Pontifical Catholic University of Rio de Janeiro (334)
- Universidade Estadual de Campinas (310)
- University of Texas – Austin (302)
- University of Birmingham (274)
- University of Michigan (274)
- National University of Singapore (268)

Department

- Computer Science (708)
- Mathematics (500)
- Informatique (352)
- Electrical Engineering (329)
- Electrical and Computer Engineering (328)
- Mechanical Engineering (277)
- Industrial and Systems Engineering (246)
- Statistics (214)
- Psychology (200)
- Civil Engineering (178)
- Faculty of Engineering (140)
- Industrial Engineering (121)
- Aerospace Engineering (101)
- Applied Mathematics (100)
- Mathématiques (93)

Degrees

- PhD (6443)
- MS (1923)
- Docteur es (1700)
- Master (573)
- Mestrado (364)
- MA (246)
- phd (222)
- d_ph (100)
- MS(M.S.) (69)
- MSin Engineering (65)
- MSc (60)
- MSin Computer Science (48)
- EdD (47)
- MSc Engg (46)
- MS- MSc (29)

Levels

- doctoral (10929)
- masters (4909)
- thesis (409)
- d_ph (100)
- project (56)
- doctor of philosophy ph.d. (48)
- dissertation (32)
- thesis - unrestricted (23)
- doctor of philosophy (ph.d.) (22)
- m_ph (17)

Languages

Country

- US (9462)
- Brazil (2602)
- UK (2512)
- Colombia (1769)
- Canada (1702)
- France (1700)
- Sweden (1382)
- Czech Republic (1199)
- Netherlands (975)
- Australia (887)
- Greece (847)
- Switzerland (762)
- Portugal (693)
- India (615)
- South Africa (567)

▼ Search Limiters

University of Hong Kong

1.
余亮豪.
Matching *problems* in large
databases.

Degree: 2010, University of Hong Kong

URL: http://hdl.handle.net/10722/61072

Subjects/Keywords: Assignment problems (Programming)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

余亮豪.. (2010). Matching problems in large databases. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/61072

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

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

余亮豪.. “Matching problems in large databases.” 2010. Thesis, University of Hong Kong. Accessed March 07, 2021. http://hdl.handle.net/10722/61072.

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

余亮豪.. “Matching problems in large databases.” 2010. Web. 07 Mar 2021.

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

Author name may be incomplete

Vancouver:

余亮豪.. Matching problems in large databases. [Internet] [Thesis]. University of Hong Kong; 2010. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10722/61072.

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

余亮豪.. Matching problems in large databases. [Thesis]. University of Hong Kong; 2010. Available from: http://hdl.handle.net/10722/61072

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

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

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

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

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Santiago, Claudio Prata. “On the nonnegative least squares.” 2009. Web. 07 Mar 2021.

Vancouver:

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

Hong Kong University of Science and Technology

3. Mao, Yuchen CSE. Resource allocation in a fair manner.

Degree: 2019, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-102371 ; https://doi.org/10.14711/thesis-991012758169303412 ; http://repository.ust.hk/ir/bitstream/1783.1-102371/1/th_redirect.html

► The max-min fair allocation problem, also known as the Santa Claus problem, is a fundamental problem in combinatorial optimization. Given a set of players P,…
(more)

Subjects/Keywords: Resource allocation ; Mathematical models ; Assignment problems (Programming) ; Computer algorithms ; Approximation algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mao, Y. C. (2019). Resource allocation in a fair manner. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-102371 ; https://doi.org/10.14711/thesis-991012758169303412 ; http://repository.ust.hk/ir/bitstream/1783.1-102371/1/th_redirect.html

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

Not specified: Masters Thesis or Doctoral Dissertation

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

Mao, Yuchen CSE. “Resource allocation in a fair manner.” 2019. Thesis, Hong Kong University of Science and Technology. Accessed March 07, 2021. http://repository.ust.hk/ir/Record/1783.1-102371 ; https://doi.org/10.14711/thesis-991012758169303412 ; http://repository.ust.hk/ir/bitstream/1783.1-102371/1/th_redirect.html.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mao, Yuchen CSE. “Resource allocation in a fair manner.” 2019. Web. 07 Mar 2021.

Vancouver:

Mao YC. Resource allocation in a fair manner. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2019. [cited 2021 Mar 07]. Available from: http://repository.ust.hk/ir/Record/1783.1-102371 ; https://doi.org/10.14711/thesis-991012758169303412 ; http://repository.ust.hk/ir/bitstream/1783.1-102371/1/th_redirect.html.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mao YC. Resource allocation in a fair manner. [Thesis]. Hong Kong University of Science and Technology; 2019. Available from: http://repository.ust.hk/ir/Record/1783.1-102371 ; https://doi.org/10.14711/thesis-991012758169303412 ; http://repository.ust.hk/ir/bitstream/1783.1-102371/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

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

Degree: MS, Computer science, 2003, Georgia Tech

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

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

Record Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Kaluskar, Vivek P. “An aggressive live range splitting and coalescing framework for efficient registrar allocation.” 2003. Web. 07 Mar 2021.

Vancouver:

Kaluskar VP. An aggressive live range splitting and coalescing framework for efficient registrar allocation. [Internet] [Masters thesis]. Georgia Tech; 2003. [cited 2021 Mar 07]. 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

5. 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

URL: http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/6564

►

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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} 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 March 07, 2021. http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/6564.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Costa, Serafim Jorge Graça Ribeiro da. “Resolução do problema de atribuição de salas a exames.” 2012. Web. 07 Mar 2021.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Northeastern University

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

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

URL: http://hdl.handle.net/2047/D20193938

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Karbeyaz, Ceyhun Efe. “Optimized participant assignment for an online experimental framework.” 2015. Web. 07 Mar 2021.

Vancouver:

Karbeyaz CE. Optimized participant assignment for an online experimental framework. [Internet] [Doctoral dissertation]. Northeastern University; 2015. [cited 2021 Mar 07]. 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

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

Degree: 2010, University of Patras

URL: http://nemertes.lis.upatras.gr/jspui/handle/10889/3715

►

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

8.
Bin Obaid, Hamoud.
Fair Resource Allocation in Macroscopic Evacuation Planning Using Mathematical *Programming*: Modeling and Optimization.

Degree: PhD, 2020, University of Oklahoma

URL: http://hdl.handle.net/11244/323822

► Evacuation is essential in the case of natural and manmade disasters such as hurricanes, nuclear disasters, fire accidents, and terrorism epidemics. Random evacuation plans can…
(more)

Subjects/Keywords: mixed integer linear programming; evacuation planning; dynamic traffic assignment; max-min fairness

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bin Obaid, H. (2020). Fair Resource Allocation in Macroscopic Evacuation Planning Using Mathematical Programming: Modeling and Optimization. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/323822

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

Bin Obaid, Hamoud. “Fair Resource Allocation in Macroscopic Evacuation Planning Using Mathematical Programming: Modeling and Optimization.” 2020. Doctoral Dissertation, University of Oklahoma. Accessed March 07, 2021. http://hdl.handle.net/11244/323822.

MLA Handbook (7^{th} Edition):

Bin Obaid, Hamoud. “Fair Resource Allocation in Macroscopic Evacuation Planning Using Mathematical Programming: Modeling and Optimization.” 2020. Web. 07 Mar 2021.

Vancouver:

Bin Obaid H. Fair Resource Allocation in Macroscopic Evacuation Planning Using Mathematical Programming: Modeling and Optimization. [Internet] [Doctoral dissertation]. University of Oklahoma; 2020. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/11244/323822.

Council of Science Editors:

Bin Obaid H. Fair Resource Allocation in Macroscopic Evacuation Planning Using Mathematical Programming: Modeling and Optimization. [Doctoral Dissertation]. University of Oklahoma; 2020. Available from: http://hdl.handle.net/11244/323822

University of Florida

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

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

URL: https://ufdc.ufl.edu/AA00038310

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

Pitsoulis, Leonidas S., 1969-. “Algorithms for nonlinear assignment problems.” 1998. Doctoral Dissertation, University of Florida. Accessed March 07, 2021. https://ufdc.ufl.edu/AA00038310.

MLA Handbook (7^{th} Edition):

Pitsoulis, Leonidas S., 1969-. “Algorithms for nonlinear assignment problems.” 1998. Web. 07 Mar 2021.

Vancouver:

Pitsoulis, Leonidas S. 1. Algorithms for nonlinear assignment problems. [Internet] [Doctoral dissertation]. University of Florida; 1998. [cited 2021 Mar 07]. Available from: https://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: https://ufdc.ufl.edu/AA00038310

Brno University of Technology

10.
Cabalka, Matouš.
Celočíselná optimalizace pro řešení dopravních úloh: Integer Optimization for Transportation * Problems*.

Degree: 2019, Brno University of Technology

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

► The thesis deals with optimization models in transportation *problems* with emphasis on traveling salesman problem. Brief introduction to the history is followed by theoretical part…
(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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

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

Cabalka, Matouš. “Celočíselná optimalizace pro řešení dopravních úloh: Integer Optimization for Transportation Problems.” 2019. Thesis, Brno University of Technology. Accessed March 07, 2021. http://hdl.handle.net/11012/61130.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cabalka, Matouš. “Celočíselná optimalizace pro řešení dopravních úloh: Integer Optimization for Transportation Problems.” 2019. Web. 07 Mar 2021.

Vancouver:

Cabalka M. Celočíselná optimalizace pro řešení dopravních úloh: Integer Optimization for Transportation Problems. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/11012/61130.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Not specified: Masters Thesis or Doctoral Dissertation

11.
Iglesias, Jennifer.
Approximation Algorithms for Faster Communication and Cheaper Networks Using *Linear* * Programming*.

Degree: 2017, Carnegie Mellon University

URL: http://repository.cmu.edu/dissertations/1050

► As we are currently in the information age, people expect access to information to exist by default. In order to facilitate the communication of knowledge,…
(more)

Subjects/Keywords: approximation algorithms; communication problems; network design; linear programming; poise; radio model

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Iglesias, J. (2017). Approximation Algorithms for Faster Communication and Cheaper Networks Using Linear Programming. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/1050

Not specified: Masters Thesis or Doctoral Dissertation

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

Iglesias, Jennifer. “Approximation Algorithms for Faster Communication and Cheaper Networks Using Linear Programming.” 2017. Thesis, Carnegie Mellon University. Accessed March 07, 2021. http://repository.cmu.edu/dissertations/1050.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Iglesias, Jennifer. “Approximation Algorithms for Faster Communication and Cheaper Networks Using Linear Programming.” 2017. Web. 07 Mar 2021.

Vancouver:

Iglesias J. Approximation Algorithms for Faster Communication and Cheaper Networks Using Linear Programming. [Internet] [Thesis]. Carnegie Mellon University; 2017. [cited 2021 Mar 07]. Available from: http://repository.cmu.edu/dissertations/1050.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Iglesias J. Approximation Algorithms for Faster Communication and Cheaper Networks Using Linear Programming. [Thesis]. Carnegie Mellon University; 2017. Available from: http://repository.cmu.edu/dissertations/1050

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

12.
Yu, Ge.
Dynamic online resource allocation * problems*.

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

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

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Yu, Ge. “Dynamic online resource allocation problems.” 2018. Web. 07 Mar 2021.

Vancouver:

Yu G. Dynamic online resource allocation problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Mar 07]. 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

ETH Zürich

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

Degree: 2000, ETH Zürich

URL: http://hdl.handle.net/20.500.11850/144671

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Burkard, Michael. “A continuous relaxation based heuristic for a class of constrained semi-assignment problems.” 2000. Web. 07 Mar 2021.

Vancouver:

Burkard M. A continuous relaxation based heuristic for a class of constrained semi-assignment problems. [Internet] [Doctoral dissertation]. ETH Zürich; 2000. [cited 2021 Mar 07]. 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

RMIT University

14.
Xie, J.
On the investigation of the large-scale grouping constrained storage location *assignment* problem.

Degree: 2017, RMIT University

URL: http://researchbank.rmit.edu.au/view/rmit:162142

► The primary focus of this study is a novel optimisation problem, namely Storage Location *Assignment* Problem with Grouping Constraint (SLAP-GC). The problem stems from real-world…
(more)

Subjects/Keywords: Fields of Research; SLAP-GC; grouping constraint; warehouse storage location assignment; complexity; heuristic; integer linear programming; decomposition; tabu search; large-scale

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xie, J. (2017). On the investigation of the large-scale grouping constrained storage location assignment problem. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:162142

Not specified: Masters Thesis or Doctoral Dissertation

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

Xie, J. “On the investigation of the large-scale grouping constrained storage location assignment problem.” 2017. Thesis, RMIT University. Accessed March 07, 2021. http://researchbank.rmit.edu.au/view/rmit:162142.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Xie, J. “On the investigation of the large-scale grouping constrained storage location assignment problem.” 2017. Web. 07 Mar 2021.

Vancouver:

Xie J. On the investigation of the large-scale grouping constrained storage location assignment problem. [Internet] [Thesis]. RMIT University; 2017. [cited 2021 Mar 07]. Available from: http://researchbank.rmit.edu.au/view/rmit:162142.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xie J. On the investigation of the large-scale grouping constrained storage location assignment problem. [Thesis]. RMIT University; 2017. Available from: http://researchbank.rmit.edu.au/view/rmit:162142

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

15.
Ramirez Calderon, Jose Ernesto.
Robust Binary *Linear* *Programming* Under Implementation Uncertainty.

Degree: PhD, Industrial Engineering, 2018, Texas A&M University

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

► This dissertation focuses on binary *linear* *programming* *problems* (BLP) affected by uncertainties preventing the implementation of the solutions exactly as prescribed. This type of uncertainty…
(more)

Subjects/Keywords: Robust optimization; binary linear programming; implementation uncertainty; knapsack problem; assignment problem; shortest path problem; optimization under uncertainty

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ramirez Calderon, J. E. (2018). Robust Binary Linear Programming Under Implementation Uncertainty. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/173513

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

Ramirez Calderon, Jose Ernesto. “Robust Binary Linear Programming Under Implementation Uncertainty.” 2018. Doctoral Dissertation, Texas A&M University. Accessed March 07, 2021. http://hdl.handle.net/1969.1/173513.

MLA Handbook (7^{th} Edition):

Ramirez Calderon, Jose Ernesto. “Robust Binary Linear Programming Under Implementation Uncertainty.” 2018. Web. 07 Mar 2021.

Vancouver:

Ramirez Calderon JE. Robust Binary Linear Programming Under Implementation Uncertainty. [Internet] [Doctoral dissertation]. Texas A&M University; 2018. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1969.1/173513.

Council of Science Editors:

Ramirez Calderon JE. Robust Binary Linear Programming Under Implementation Uncertainty. [Doctoral Dissertation]. Texas A&M University; 2018. Available from: http://hdl.handle.net/1969.1/173513

Rutgers University

16.
Yamangil, Emre, 1984-.
Valid inequalities for mixed-integer *linear* *programming* * problems*.

Degree: PhD, Operations Research, 2015, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/48729/

►

In this work we focus on various cutting-plane methods for Mixed-integer *Linear* *Programming* (MILP) *problems*. It is well-known that MILP is a fundamental hard problem…
(more)

Subjects/Keywords: Linear programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yamangil, Emre, 1. (2015). Valid inequalities for mixed-integer linear programming problems. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/48729/

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

Yamangil, Emre, 1984-. “Valid inequalities for mixed-integer linear programming problems.” 2015. Doctoral Dissertation, Rutgers University. Accessed March 07, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/48729/.

MLA Handbook (7^{th} Edition):

Yamangil, Emre, 1984-. “Valid inequalities for mixed-integer linear programming problems.” 2015. Web. 07 Mar 2021.

Vancouver:

Yamangil, Emre 1. Valid inequalities for mixed-integer linear programming problems. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2021 Mar 07]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48729/.

Council of Science Editors:

Yamangil, Emre 1. Valid inequalities for mixed-integer linear programming problems. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48729/

Technical University of Lisbon

17. Grilo, Carina Filipa Quintino Mota. Um problema de afetação de pessoal a clientes de uma empresa de serviços domésticos.

Degree: 2014, Technical University of Lisbon

URL: https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/7709

►

Mestrado em Decisão Económica e Empresarial

O presente trabalho final de mestrado é apresentado sob a forma de trabalho de projeto, em que se aplicam… (more)

Subjects/Keywords: Escalonamento de pessoal; afetação de tarefas; métodos heurísticos; programação linear binária (PLB); gestão de recursos humanos; Personal scheduling; assignment of tasks; heuristic methods; binary linear programming; human resources management

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Grilo, C. F. Q. M. (2014). Um problema de afetação de pessoal a clientes de uma empresa de serviços domésticos. (Thesis). Technical University of Lisbon. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/7709

Not specified: Masters Thesis or Doctoral Dissertation

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

Grilo, Carina Filipa Quintino Mota. “Um problema de afetação de pessoal a clientes de uma empresa de serviços domésticos.” 2014. Thesis, Technical University of Lisbon. Accessed March 07, 2021. https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/7709.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Grilo, Carina Filipa Quintino Mota. “Um problema de afetação de pessoal a clientes de uma empresa de serviços domésticos.” 2014. Web. 07 Mar 2021.

Vancouver:

Grilo CFQM. Um problema de afetação de pessoal a clientes de uma empresa de serviços domésticos. [Internet] [Thesis]. Technical University of Lisbon; 2014. [cited 2021 Mar 07]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/7709.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Grilo CFQM. Um problema de afetação de pessoal a clientes de uma empresa de serviços domésticos. [Thesis]. Technical University of Lisbon; 2014. Available from: https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/7709

Not specified: Masters Thesis or Doctoral Dissertation

Macquarie University

18.
Manic, Ludmila.
*Linear**programming* based approaches to optimal control *problems* with long run average optimality criteria.

Degree: 2015, Macquarie University

URL: http://hdl.handle.net/1959.14/1069099

►

"August 31, 2015"

Empirical thesis.

I. Use of approximations of Hamilton-Jacobi-Bellman inequality for solving long run average *problems* of optimal control – II. On near…
(more)

Subjects/Keywords: Mathematical optimization; Hamilton-Jacobi equations; Linear programming; optimal control problems; singularly perturbed optimal control problems; averaging; occupational measures; numerical solution

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Manic, L. (2015). Linear programming based approaches to optimal control problems with long run average optimality criteria. (Doctoral Dissertation). Macquarie University. Retrieved from http://hdl.handle.net/1959.14/1069099

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

Manic, Ludmila. “Linear programming based approaches to optimal control problems with long run average optimality criteria.” 2015. Doctoral Dissertation, Macquarie University. Accessed March 07, 2021. http://hdl.handle.net/1959.14/1069099.

MLA Handbook (7^{th} Edition):

Manic, Ludmila. “Linear programming based approaches to optimal control problems with long run average optimality criteria.” 2015. Web. 07 Mar 2021.

Vancouver:

Manic L. Linear programming based approaches to optimal control problems with long run average optimality criteria. [Internet] [Doctoral dissertation]. Macquarie University; 2015. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1959.14/1069099.

Council of Science Editors:

Manic L. Linear programming based approaches to optimal control problems with long run average optimality criteria. [Doctoral Dissertation]. Macquarie University; 2015. Available from: http://hdl.handle.net/1959.14/1069099

Universidade do Rio Grande do Sul

19.
Melo, Jorge Nazareno Batista.
Uma proposta de ensino e aprendizagem de programação *linear* no Ensino Médio.

Degree: 2012, Universidade do Rio Grande do Sul

URL: http://hdl.handle.net/10183/61731

►

O presente trabalho tem como principal objetivo apresentar uma proposta de estudo do assunto Programação *Linear* no currículo do Ensino Médio na disciplina de matemática.…
(more)

Subjects/Keywords: Teaching proposal; Ensino-aprendizagem; Linear programming; Ensino medio : Matematica; Programação linear; Resolution of problems; Mathematics education; Mathematics teaching

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Melo, J. N. B. (2012). Uma proposta de ensino e aprendizagem de programação linear no Ensino Médio. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/61731

Not specified: Masters Thesis or Doctoral Dissertation

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

Melo, Jorge Nazareno Batista. “Uma proposta de ensino e aprendizagem de programação linear no Ensino Médio.” 2012. Thesis, Universidade do Rio Grande do Sul. Accessed March 07, 2021. http://hdl.handle.net/10183/61731.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Melo, Jorge Nazareno Batista. “Uma proposta de ensino e aprendizagem de programação linear no Ensino Médio.” 2012. Web. 07 Mar 2021.

Vancouver:

Melo JNB. Uma proposta de ensino e aprendizagem de programação linear no Ensino Médio. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2012. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10183/61731.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Melo JNB. Uma proposta de ensino e aprendizagem de programação linear no Ensino Médio. [Thesis]. Universidade do Rio Grande do Sul; 2012. Available from: http://hdl.handle.net/10183/61731

Not specified: Masters Thesis or Doctoral Dissertation

Technical University of Lisbon

20. Anjos, Mafalda Patrícia Carvalho. Distribuição dos utentes na Rede Nacional de Cuidados Continuados Integrados do Alentejo.

Degree: 2016, Technical University of Lisbon

URL: https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/13115

►

Mestrado em Decisão Económica e Empresarial

Esta pesquisa aborda a Rede Nacional de Cuidados Continuados Integrados (RNCCI) em Portugal, focando-se na especialidade de unidade de… (more)

Subjects/Keywords: Rede Nacional de Cuidados Continuados Integrados; Programação Linear; Problema de transporte; National Network for Continuous Care; Linear programming; Transportation problems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Anjos, M. P. C. (2016). Distribuição dos utentes na Rede Nacional de Cuidados Continuados Integrados do Alentejo. (Thesis). Technical University of Lisbon. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/13115

Not specified: Masters Thesis or Doctoral Dissertation

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

Anjos, Mafalda Patrícia Carvalho. “Distribuição dos utentes na Rede Nacional de Cuidados Continuados Integrados do Alentejo.” 2016. Thesis, Technical University of Lisbon. Accessed March 07, 2021. https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/13115.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Anjos, Mafalda Patrícia Carvalho. “Distribuição dos utentes na Rede Nacional de Cuidados Continuados Integrados do Alentejo.” 2016. Web. 07 Mar 2021.

Vancouver:

Anjos MPC. Distribuição dos utentes na Rede Nacional de Cuidados Continuados Integrados do Alentejo. [Internet] [Thesis]. Technical University of Lisbon; 2016. [cited 2021 Mar 07]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/13115.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Anjos MPC. Distribuição dos utentes na Rede Nacional de Cuidados Continuados Integrados do Alentejo. [Thesis]. Technical University of Lisbon; 2016. Available from: https://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/13115

Not specified: Masters Thesis or Doctoral Dissertation

21.
Ilyes, Amy Louise.
Using *linear* *programming* to solve convex quadratic
*programming* * problems*.

Degree: PhD, Operations Research, 1993, Case Western Reserve University School of Graduate Studies

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

► Convex quadratic *programming* is a very important topic in mathematical *programming* because of its numerous applications in such diverse fields as economics, statistics and engineering.…
(more)

Subjects/Keywords: Using linear programming solve convex quadratic programming problems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ilyes, A. L. (1993). Using linear programming to solve convex quadratic programming problems. (Doctoral Dissertation). Case Western Reserve University School of Graduate Studies. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1056644216

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

Ilyes, Amy Louise. “Using linear programming to solve convex quadratic programming problems.” 1993. Doctoral Dissertation, Case Western Reserve University School of Graduate Studies. Accessed March 07, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=case1056644216.

MLA Handbook (7^{th} Edition):

Ilyes, Amy Louise. “Using linear programming to solve convex quadratic programming problems.” 1993. Web. 07 Mar 2021.

Vancouver:

Ilyes AL. Using linear programming to solve convex quadratic programming problems. [Internet] [Doctoral dissertation]. Case Western Reserve University School of Graduate Studies; 1993. [cited 2021 Mar 07]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1056644216.

Council of Science Editors:

Ilyes AL. Using linear programming to solve convex quadratic programming problems. [Doctoral Dissertation]. Case Western Reserve University School of Graduate Studies; 1993. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1056644216

ETH Zürich

22. Frank, Mario. Probabilistic Role Mining.

Degree: 2011, ETH Zürich

URL: http://hdl.handle.net/20.500.11850/72860

Subjects/Keywords: ACCESS CONTROL (OPERATING SYSTEMS); ASSIGNMENT PROBLEMS (LINEAR PROGRAMMING); STOCHASTIC MODELS + STOCHASTIC SIMULATION (PROBABILITY THEORY); STOCHASTISCHE MODELLE + STOCHASTISCHE SIMULATION (WAHRSCHEINLICHKEITSRECHNUNG); ZUORDNUNGSPROBLEME (LINEARE OPTIMIERUNG); ZUGRIFFSKONTROLLE (BETRIEBSSYSTEME); info:eu-repo/classification/ddc/004; Data processing, computer science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Frank, M. (2011). Probabilistic Role Mining. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/72860

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

Frank, Mario. “Probabilistic Role Mining.” 2011. Doctoral Dissertation, ETH Zürich. Accessed March 07, 2021. http://hdl.handle.net/20.500.11850/72860.

MLA Handbook (7^{th} Edition):

Frank, Mario. “Probabilistic Role Mining.” 2011. Web. 07 Mar 2021.

Vancouver:

Frank M. Probabilistic Role Mining. [Internet] [Doctoral dissertation]. ETH Zürich; 2011. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/20.500.11850/72860.

Council of Science Editors:

Frank M. Probabilistic Role Mining. [Doctoral Dissertation]. ETH Zürich; 2011. Available from: http://hdl.handle.net/20.500.11850/72860

Iowa State University

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

Degree: 2010, Iowa State University

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

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Xu, Songyan. “Energy-efficient task assignment of wireless sensor network with the application to agriculture.” 2010. Web. 07 Mar 2021.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

New Jersey Institute of Technology

24.
Zamka, Ahmad Basem.
* Assignment* of e-commerce orders to fulfillment warehouses.

Degree: MSin Industrial Engineering - (M.S.), Mechanical and Industrial Engineering, 2019, New Jersey Institute of Technology

URL: https://digitalcommons.njit.edu/theses/1687

► For large e-commerce companies such as Amazon, when an order comes, this order might be available at more than one fulfillment centers. Therefore, the…
(more)

Subjects/Keywords: E-commerce; Orders assignment; Online supply chain; Fulfillment warehouses; Linear programming and transportation; E-Commerce; Industrial Engineering; Operations and Supply Chain Management

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zamka, A. B. (2019). Assignment of e-commerce orders to fulfillment warehouses. (Thesis). New Jersey Institute of Technology. Retrieved from https://digitalcommons.njit.edu/theses/1687

Not specified: Masters Thesis or Doctoral Dissertation

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

Zamka, Ahmad Basem. “Assignment of e-commerce orders to fulfillment warehouses.” 2019. Thesis, New Jersey Institute of Technology. Accessed March 07, 2021. https://digitalcommons.njit.edu/theses/1687.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zamka, Ahmad Basem. “Assignment of e-commerce orders to fulfillment warehouses.” 2019. Web. 07 Mar 2021.

Vancouver:

Zamka AB. Assignment of e-commerce orders to fulfillment warehouses. [Internet] [Thesis]. New Jersey Institute of Technology; 2019. [cited 2021 Mar 07]. Available from: https://digitalcommons.njit.edu/theses/1687.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zamka AB. Assignment of e-commerce orders to fulfillment warehouses. [Thesis]. New Jersey Institute of Technology; 2019. Available from: https://digitalcommons.njit.edu/theses/1687

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

25.
Walteros, Jose Luis.
Integer *Programming* Models for Solving Critical Element Detection and Data Association * Problems*.

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

URL: https://ufdc.ufl.edu/UFE0046999

► In this dissertation we study three *problems* that arise in the contexts of critical element detection and data association. The principal motivation and common interest…
(more)

Subjects/Keywords: Algorithms; Cost allocation; Heuristics; Integers; Linear programming; Minimization of cost; Operations research; Optimal solutions; Vertices; Whips; assignment – association – cliques – complexity – data – decomposition – formulation – graphs – heuristics – interdiction – networks – optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Walteros, J. L. (2014). Integer Programming Models for Solving Critical Element Detection and Data Association Problems. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0046999

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

Walteros, Jose Luis. “Integer Programming Models for Solving Critical Element Detection and Data Association Problems.” 2014. Doctoral Dissertation, University of Florida. Accessed March 07, 2021. https://ufdc.ufl.edu/UFE0046999.

MLA Handbook (7^{th} Edition):

Walteros, Jose Luis. “Integer Programming Models for Solving Critical Element Detection and Data Association Problems.” 2014. Web. 07 Mar 2021.

Vancouver:

Walteros JL. Integer Programming Models for Solving Critical Element Detection and Data Association Problems. [Internet] [Doctoral dissertation]. University of Florida; 2014. [cited 2021 Mar 07]. Available from: https://ufdc.ufl.edu/UFE0046999.

Council of Science Editors:

Walteros JL. Integer Programming Models for Solving Critical Element Detection and Data Association Problems. [Doctoral Dissertation]. University of Florida; 2014. Available from: https://ufdc.ufl.edu/UFE0046999

26. Gardenghi, John Lenon Cardoso. Um método de pontos interiores primal-dual viável para minimização com restrições lineares de grande porte.

Degree: Mestrado, Ciência da Computação, 2014, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-11072014-084756/ ;

►

Neste trabalho, propomos um método de pontos interiores para minimização com restrições lineares de grande porte. Este método explora a linearidade das restrições, partindo de… (more)

Subjects/Keywords: busca linear; feasible interior-point; large-scale problems; line search; linear constraints; nonlinear programming; pontos interiores viáveis; problemas de grande porte; programação não linear; restrições lineares

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gardenghi, J. L. C. (2014). Um método de pontos interiores primal-dual viável para minimização com restrições lineares de grande porte. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-11072014-084756/ ;

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

Gardenghi, John Lenon Cardoso. “Um método de pontos interiores primal-dual viável para minimização com restrições lineares de grande porte.” 2014. Masters Thesis, University of São Paulo. Accessed March 07, 2021. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-11072014-084756/ ;.

MLA Handbook (7^{th} Edition):

Gardenghi, John Lenon Cardoso. “Um método de pontos interiores primal-dual viável para minimização com restrições lineares de grande porte.” 2014. Web. 07 Mar 2021.

Vancouver:

Gardenghi JLC. Um método de pontos interiores primal-dual viável para minimização com restrições lineares de grande porte. [Internet] [Masters thesis]. University of São Paulo; 2014. [cited 2021 Mar 07]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-11072014-084756/ ;.

Council of Science Editors:

Gardenghi JLC. Um método de pontos interiores primal-dual viável para minimização com restrições lineares de grande porte. [Masters Thesis]. University of São Paulo; 2014. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-11072014-084756/ ;

27. Khorbatly, Mohamad. Optimisation numérique appliquée à la gestion de crise : Approche basée sur un algorithme hybride pour la résolution du problème intégré d'ordonnancement et d'allocation des ressources. : Numerical optimization applied to crisis management : A hybrid approach for solving the integrated problem of scheduling and resource allocation.

Degree: Docteur es, Mathématiques appliquées et Informatique, 2018, Normandie

URL: http://www.theses.fr/2018NORMLH18

►

Les travaux présentes dans cette thèse s'inscrivent dans le cadre des méthodes d'évacuation des populations. Ils visent à étudier les capacités et modéliser le problème… (more)

Subjects/Keywords: Gestion de crise; Organisation sécurisée; Problème d'affectation; Problème d'ordonnancement; GRASP; Recherche Tabu; Programmation linéaire; Programmation linéaire binaire; Crisis management; Secure organization; Assignment problem; Scheduling problem; GRASP; Tabu search; Linear programming; Binary linear programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Khorbatly, M. (2018). Optimisation numérique appliquée à la gestion de crise : Approche basée sur un algorithme hybride pour la résolution du problème intégré d'ordonnancement et d'allocation des ressources. : Numerical optimization applied to crisis management : A hybrid approach for solving the integrated problem of scheduling and resource allocation. (Doctoral Dissertation). Normandie. Retrieved from http://www.theses.fr/2018NORMLH18

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

Khorbatly, Mohamad. “Optimisation numérique appliquée à la gestion de crise : Approche basée sur un algorithme hybride pour la résolution du problème intégré d'ordonnancement et d'allocation des ressources. : Numerical optimization applied to crisis management : A hybrid approach for solving the integrated problem of scheduling and resource allocation.” 2018. Doctoral Dissertation, Normandie. Accessed March 07, 2021. http://www.theses.fr/2018NORMLH18.

MLA Handbook (7^{th} Edition):

Khorbatly, Mohamad. “Optimisation numérique appliquée à la gestion de crise : Approche basée sur un algorithme hybride pour la résolution du problème intégré d'ordonnancement et d'allocation des ressources. : Numerical optimization applied to crisis management : A hybrid approach for solving the integrated problem of scheduling and resource allocation.” 2018. Web. 07 Mar 2021.

Vancouver:

Khorbatly M. Optimisation numérique appliquée à la gestion de crise : Approche basée sur un algorithme hybride pour la résolution du problème intégré d'ordonnancement et d'allocation des ressources. : Numerical optimization applied to crisis management : A hybrid approach for solving the integrated problem of scheduling and resource allocation. [Internet] [Doctoral dissertation]. Normandie; 2018. [cited 2021 Mar 07]. Available from: http://www.theses.fr/2018NORMLH18.

Council of Science Editors:

Khorbatly M. Optimisation numérique appliquée à la gestion de crise : Approche basée sur un algorithme hybride pour la résolution du problème intégré d'ordonnancement et d'allocation des ressources. : Numerical optimization applied to crisis management : A hybrid approach for solving the integrated problem of scheduling and resource allocation. [Doctoral Dissertation]. Normandie; 2018. Available from: http://www.theses.fr/2018NORMLH18

California State University – Northridge

28. McGarry, John Martin. Experimental studies of the transportation problem.

Degree: MS, Business Administration, 1973, California State University – Northridge

URL: http://hdl.handle.net/10211.2/4497

► The study investigates the Transportation Problem. Specifically, it considers the interaction of four initial solution algorithms, Northwest Corner, Column minimization, Vogel Approximation Method, and Matrix…
(more)

Subjects/Keywords: Linear programming – Problems, exercises, etc.; Dissertations, Academic – CSUN – Business.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

McGarry, J. M. (1973). Experimental studies of the transportation problem. (Masters Thesis). California State University – Northridge. Retrieved from http://hdl.handle.net/10211.2/4497

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

McGarry, John Martin. “Experimental studies of the transportation problem.” 1973. Masters Thesis, California State University – Northridge. Accessed March 07, 2021. http://hdl.handle.net/10211.2/4497.

MLA Handbook (7^{th} Edition):

McGarry, John Martin. “Experimental studies of the transportation problem.” 1973. Web. 07 Mar 2021.

Vancouver:

McGarry JM. Experimental studies of the transportation problem. [Internet] [Masters thesis]. California State University – Northridge; 1973. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10211.2/4497.

Council of Science Editors:

McGarry JM. Experimental studies of the transportation problem. [Masters Thesis]. California State University – Northridge; 1973. Available from: http://hdl.handle.net/10211.2/4497

29.
Zachi, Juliana Mallia [UNESP].
Problemas de Programação *Linear*: uma proposta de resolução geométrica para o ensino médio com o uso do GeoGebra.

Degree: 2016, Universidade Estadual Paulista

URL: http://hdl.handle.net/11449/144220

►

Neste trabalho são apresentados os fundamentos da Programação *Linear*, em especial, da Programação *Linear* Geométrica, instrumento importante de otimização para problemas de Economia, gestão de…
(more)

Subjects/Keywords: Programação linear; Programação linear geométrica; Algebra linear; Linear programming; Linear geometric programming; Linear algebra

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zachi, J. M. [. (2016). Problemas de Programação Linear: uma proposta de resolução geométrica para o ensino médio com o uso do GeoGebra. (Thesis). Universidade Estadual Paulista. Retrieved from http://hdl.handle.net/11449/144220

Not specified: Masters Thesis or Doctoral Dissertation

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

Zachi, Juliana Mallia [UNESP]. “Problemas de Programação Linear: uma proposta de resolução geométrica para o ensino médio com o uso do GeoGebra.” 2016. Thesis, Universidade Estadual Paulista. Accessed March 07, 2021. http://hdl.handle.net/11449/144220.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zachi, Juliana Mallia [UNESP]. “Problemas de Programação Linear: uma proposta de resolução geométrica para o ensino médio com o uso do GeoGebra.” 2016. Web. 07 Mar 2021.

Vancouver:

Zachi JM[. Problemas de Programação Linear: uma proposta de resolução geométrica para o ensino médio com o uso do GeoGebra. [Internet] [Thesis]. Universidade Estadual Paulista; 2016. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/11449/144220.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zachi JM[. Problemas de Programação Linear: uma proposta de resolução geométrica para o ensino médio com o uso do GeoGebra. [Thesis]. Universidade Estadual Paulista; 2016. Available from: http://hdl.handle.net/11449/144220

Not specified: Masters Thesis or Doctoral Dissertation

Universidade Estadual de Campinas

30.
Hokama, Pedro Henrique Del Bianco, 1986-.
Algoritmos para problemas com restrições de empacotamento = Algorithms for *problems* with loading constraints: Algorithms for *problems* with loading constraints.

Degree: 2016, Universidade Estadual de Campinas

URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/322686

► Abstract: In this thesis we investigate classes of *problems* with loading constraints. Three different *problems* were investigated, and algorithms were proposed for each one of…
(more)

Subjects/Keywords: Problema de roteamento de veículos; Problemas de empacotamento; Programação por restrições; Programação linear; Programação inteira; Algoritmos; Vehicle routing problem; Packing problems; Constraint programing; Linear programing; Integer programming; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hokama, Pedro Henrique Del Bianco, 1. (2016). Algoritmos para problemas com restrições de empacotamento = Algorithms for problems with loading constraints: Algorithms for problems with loading constraints. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/322686

Not specified: Masters Thesis or Doctoral Dissertation

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

Hokama, Pedro Henrique Del Bianco, 1986-. “Algoritmos para problemas com restrições de empacotamento = Algorithms for problems with loading constraints: Algorithms for problems with loading constraints.” 2016. Thesis, Universidade Estadual de Campinas. Accessed March 07, 2021. http://repositorio.unicamp.br/jspui/handle/REPOSIP/322686.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hokama, Pedro Henrique Del Bianco, 1986-. “Algoritmos para problemas com restrições de empacotamento = Algorithms for problems with loading constraints: Algorithms for problems with loading constraints.” 2016. Web. 07 Mar 2021.

Vancouver:

Hokama, Pedro Henrique Del Bianco 1. Algoritmos para problemas com restrições de empacotamento = Algorithms for problems with loading constraints: Algorithms for problems with loading constraints. [Internet] [Thesis]. Universidade Estadual de Campinas; 2016. [cited 2021 Mar 07]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/322686.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hokama, Pedro Henrique Del Bianco 1. Algoritmos para problemas com restrições de empacotamento = Algorithms for problems with loading constraints: Algorithms for problems with loading constraints. [Thesis]. Universidade Estadual de Campinas; 2016. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/322686

Not specified: Masters Thesis or Doctoral Dissertation