subject:(ASSIGNMENT PROBLEMS LINEAR PROGRAMMING )

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 Cite « Share

❌

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

Note: this citation may be lacking information needed for this citation format:
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 Cite « Share

❌

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)

▼ 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, a set of indivisible resources R, and a set of non-negative values {v_pr}_p∈P,r∈R, an allocation is a partition of R into disjoint subsets {C_p}_p∈P so that each player p is assigned the resources in C_p. We hope to find a fair allocation of resources to players so that the welfare of the least lucky player is maximized. More precisely, we want to maximize min_pΣ_r∈Cp v_pr. In the restricted case of this problem, we have v_pr ∈ {v_r, 0}. That is, each resource r has an intrinsic value v_r, and it is worth value v_r to those players who desire it and value 0 to those who do not. This thesis investigates the restricted case of the problem, namely, the restricted max-min fair allocation. With regard to this problem, the configuration LP is the only LP relaxation known to have a constant integrality gap, and it plays an important role in estimating and approximating the optimal solution. Our first result is an improvement of the upper bound for the integrality gap from 4 to 3+21/26. It is obtained by giving a tighter analysis of a local search algorithm in the literature. Hence, by solving the configuration LP, we can estimate the optimal solution value of within a factor of 3+21/26. However, as the local search is not known to run in polynomial time, it does not lead to a polynomial-time approximation algorithm. Prior to our work, the best approximation ratio that can be achieved in polynomial time is 6 + 2√3 + δ, where δ is an arbitrarily small constant. We proposed two polynomial-time approximation algorithms. Our first algorithm achieves an approximation ratio of 6 + δ. The algorithm and its analysis are purely combinatorial. Our second algorithm achieves an approximation ratio of 4 + δ. This algorithm is also purely combinatorial while its analysis make use of the configuration LP. It generalizes the local search used in the integrality gap result.

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

Record Details Similar Records Cite « Share

❌

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

Note: this citation may be lacking information needed for this citation format:
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 Cite « Share

❌

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)

▼

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 solução desenvolvida atribui salas a exames respeitando as restrições de capacidade de salas e a restrição de realização dum único exame por sala num determinado período, por forma a minimizar a atribuição de salas e, consequentemente, docentes a exames. Foi criado um modelo matemático, que representa as variáveis relevantes do problema, e realiza a sua implementação numa plataforma informática amigável para o utilizador. O modelo matemático foi validado comparando as suas soluções com as obtidas através do processo manual. Os resultados do novo método demonstram a sua supremacia relativamente ao modelo atual. No futuro, poderá ser estudada a possibilidade de usar esta ferramenta na resolução do mesmo problema em realidades diferentes da do Departamento de Engenharia Mecânica do ISEP.

This paper intends to solve the problem of allocation of classrooms to exams in the department of Mechanical Engineering of the Instituto Superior de Engenharia do Porto. The model applied assigns classrooms to exams respecting the capacity constraints and restricted realization of a single exam per classroom for a time, to minimize the allocation of classrooms to exams. The solution developed assigns classrooms to exams respecting the capacity constraints and restricted realization of a single exam per classroom for a certain period, in order to minimize the allocation of classrooms and consequently the teachers to exams. We created a mathematical model that represents the relevant variables of the problem, and holds its implementation in a computer platform user-friendly. The mathematical model was validated by comparing its solutions with those obtained by manual process. The results of the new method demonstrate its supremacy for the current model. In the future, it may be envisaged to use this tool in solving the same problem in different realities of the Mechanical Engineering Department of ISEP.

Advisors/Committee Members: Lopes, Manuel Pereira.

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 Cite « Share

❌

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

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

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.

Note: this citation may be lacking information needed for this citation format:
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.

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

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)

▼ 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 analog of a university's shared laboratory for behavioural research. Our platform is an experimental testbed that enables researchers to quickly design and deploy behavioural experiments. The framework is implemented to conduct very large experiments with many individuals interacting synchronously. However, large scale platforms come with drawbacks that can affect both participants and researchers. From the point of view of participants, too many participants mean excessive waiting times in the system. From the point of view of researchers, meeting the deadlines of different experiments and implementation details of the experiments can be problematic and may affect the research progress.; In this thesis, we develop and evaluate algorithms that efficiently assign incoming participants to experiments to meet experiment deadlines. We show that participant assignment can be modeled as the problem of minimizing the weighted tardiness of a parallel schedule, an NP-complete problem. We consider varying participant arrival an experiment availability cases for the participant assignment problem and use them to evaluate the effectiveness of exhaustive, greedy, dynamic programming and integer-linear programming techniques synthetic and real benchmarks.; The results over the synthetic and real benchmarks show that greedy algorithms perform better than the other compared algorithms for algorithm execution and solution optimality. With constant experiment release times, we observe that that the greedy ATC and ATCPA algorithms outperform other compared algorithms. For both online and offline greedy algorithms with varying experiment release times, we observe that the greedy MPRA algorithm is the best performing algorithm. The experiments over the online algorithms with varying participant arrivals and experiment release times indicate that experiments' release times and the number of experiments makes the biggest impact over minimizing the tardiness. We show that the MPRA algorithm performs well over both the synthetic datasets with different levels of burstiness and our dataset drawn from real-world data, from which we conclude that MPRA provides promising and robust results.

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

Record Details Similar Records Cite « Share

❌

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)

▼

Ο γραμμικός προγραμματισμός είναι μια μεθοδολογία της Επιχειρησιακής Έρευνας η οποία ασχολείται με το πρόβλημα της κατανομής των περιορισμένων πόρων ενός συστήματος σε ανταγωνιζόμενες μεταξύ τους δραστηριότητες με τον καλύτερο δυνατό τρόπο. Από μαθηματικής σκοπιάς το πρόβλημα αφορά τη μεγιστοποίηση ή ελαχιστοποίηση μιας γραμμικής συνάρτησης σύμφωνα με κάποιους γραμμικούς περιορισμούς. Τόσο η μαθηματική διατύπωση του προβλήματος, όσο και μια συστηματική διαδικασία επίλυσής του, η μέθοδος Simplex, οφείλεται στον G.B. Duntzig στα 1947. Την ίδια εποχή ο J. Von Neuman διατύπωνε το αργότερα γνωστό ως δυϊκό πρόβλημα γραμμικού προγραμματισμού. Το πρώτο κεφάλαιο της παρούσης εργασίας ξεκινά με τη γενική μαθηματική θεώρηση των δύο προβλημάτων και συνεχίζει με τα βασικά θεωρήματα τα οποία αφορούν τη διαδικασία λύσης, τις ιδιότητές τους καθώς επίσης και τις σχέσεις που τα συνδέουν. Στο δεύτερο κεφάλαιο παρουσιάζονται διάφοροι τύποι ανάλυσης ευαισθησίας του γραμμικού μοντέλου, της μελέτης δηλαδή των αλλαγών που επιφέρουν στην άριστη λύση, αλλαγές σε διάφορα μεγέθη -παράμετροι- του προβλήματος. Στο ίδιο κεφάλαιο παρουσιάζεται η ανάλυση ευαισθησίας μιας ειδικής κλάσης προβλημάτων γραμμικού προγραμματισμού, του προβλήματος καταμερισμού εργασίας (εκχώρησης). Τέλος γίνεται μια σύντομη αναφορά στον υπολογισμό των δυϊκών τιμών στην περίπτωση των εκφυλισμένων λύσεων.

Linear programming is a method of Operations Research which deals with the problem of distribution of limited resources of a system to rivaling activities -with each other - in the best possible way. From mathematics point of view the problem concerns the maximization or minimization of a linear function according to certain linear restrictions. Not only the mathematic formulation of the problem, but also a systematic procedure of solution (gradualism), the Simplex method, are due to G. B. Duntzig (1947). At the same time J. Von Neuman formulated the later known as dual problem of linear programming. The first chapter of this paper starts with the general mathematical regard of these two problems and steps to the essential theorems used for the solution procedure, their attributes as well as the relations that bind them. In the second chapter various types of linear model’s sensitivity analysis are presented, the study of changes that lead to the most efficient solution, changes in various elements - parameters of the problem. At the same chapter the sensitivity analysis of special group of linear programming problems is presented, the assignment problem. Finally a brief note is made at the calculation of dual values in case of degenerated solutions.

Advisors/Committee Members: Τσάντας, Νικόλαος, Balafouti, Panagiwta, Πετρόπουλος, Κωνσταντίνος, Αλεβίζος, Φίλιππος, Τσάντας, Νικόλαος.

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

Record Details Similar Records Cite « Share

❌

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)

▼ 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 increase risks and incur more losses. Hence, numerous simulation and mathematical programming models have been developed over the past few decades to help transportation planners make decisions to reduce costs and protect lives. However, the dynamic transportation process is inherently complex. Thus, modeling this process can be challenging and computationally demanding. The objective of this dissertation is to build a balanced model that reflects the realism of the dynamic transportation process and still be computationally tractable to be implemented in reality by the decision-makers. On the other hand, the users of the transportation network require reasonable travel time within the network to reach their destinations. This dissertation introduces a novel framework in the fields of fairness in network optimization and evacuation to provide better insight into the evacuation process and assist with decision making. The user of the transportation network is a critical element in this research. Thus, fairness and efficiency are the two primary objectives addressed in the work by considering the limited capacity of roads of the transportation network. Specifically, an approximation approach to the max-min fairness (MMF) problem is presented that provides lower computational time and high-quality output compared to the original algorithm. In addition, a new algorithm is developed to find the MMF resource allocation output in nonconvex structure problems. MMF is the fairness policy used in this research since it considers fairness and efficiency and gives priority to fairness. In addition, a new dynamic evacuation modeling approach is introduced that is capable of reporting more information about the evacuees compared to the conventional evacuation models such as their travel time, evacuation time, and departure time. Thus, the contribution of this dissertation is in the two areas of fairness and evacuation. The first part of the contribution of this dissertation is in the field of fairness. The objective in MMF is to allocate resources fairly among multiple demands given limited resources while utilizing the resources for higher efficiency. Fairness and efficiency are contradicting objectives, so they are translated into a bi-objective mathematical programming model and solved using the ϵ-constraint method, introduced by Vira and Haimes (1983). Although the solution is an approximation to the MMF, the model produces quality solutions, when ϵ is properly selected, in less computational time compared to the progressive-filling algorithm (PFA). In addition, a new algorithm is developed in this research called the θ progressive-filling algorithm that finds the MMF in resource allocation for general problems and works on problems with the nonconvex structure problems. The second part of the contribution is in evacuation modeling. The common… Advisors/Committee Members: Trafalis, Theodore (advisor), Radhakrishnan, Sridhar (committee member), Barker, Kash (committee member), Gonzalez, Andres (committee member), Nicholson, Charles (committee member).

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

Record Details Similar Records Cite « Share

❌

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 Cite « Share

❌

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 Cite « Share

❌

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

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

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.

Note: this citation may be lacking information needed for this citation format:
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.

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: Integer Optimization for Transportation Problems. [Thesis]. Brno University of Technology; 2019. 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

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

1 more image…

Record Details Similar Records Cite « Share

❌

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

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

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.

Note: this citation may be lacking information needed for this citation format:
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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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)

▼ 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 of e-business, applications such as online order fulfillment and customer service require real-time resource allocation decisions to guarantee high service quality and customer satisfaction. Other typical applications include operation room scheduling, organ transplant, and passenger screening in aviation security. This dissertation approaches the dynamic online resource allocation problem by considering two models: multi-objective sequential stochastic assignment problems and online interval scheduling problems. Multi-objective sequential stochastic assignment problems are a class of matching problems. A fixed number of jobs arrive sequentially to be assigned to one of the available workers, with an n-dimensional value vector revealed upon each arrival. The objective is to maximize the reward vector given by the product of the job value vector and worker's success rate. We conduct a complete asymptotic analysis for three classes of Pareto optimal policies, with convergence rates and asymptotic objective values provided. Online interval scheduling problems consider reusable resources, where an adversarial sequence of jobs with fixed lengths are to be assigned on available machines. The objective is to maximize the total reward for completed jobs given by the product of the job value and the machine weight. For homogeneous machines, we propose a Pairing-m algorithm, which is 2-competitive for even m and (2+2/m)-competitive for odd m. For heterogeneous machines, two classes of approximation algorithms, Cooperative Greedy algorithms and Prioritized Greedy algorithms, are compared using competitive ratios with respect to varying machine weight ratios. We also provide lower bounds for competitive ratios of deterministic online scheduling algorithms in various scenarios. Stochastic online interval scheduling problems consider a sequence of jobs drawn from a given distribution. For identically and independently distributed jobs with a known distribution, we propose 2-competitive online algorithms for both equal-length and memoryless-length jobs. For job sequences with a random order of arrivals, we propose e-competitive and e²/(e-1)-competitive online algorithms for both equal-length and memoryless-length jobs. We further extend these results to jobs with a random order of arrivals and geometric arrivals with parameter p. We propose a primal-dual analysis framework for online interval scheduling algorithms for both adversarial and stochastic job sequences. We formulate the online interval scheduling as a linear program with a corresponding dual program. For stochastic job sequences, we use complementary slackness conditions and weak duality to derive optimal algorithms and upper bounds for the optimal reward, respectively. For adversarial sequences, we use weak duality to compute the competitive ratios of scheduling… Advisors/Committee Members: Jacobson, Sheldon H. (advisor), Jacobson, Sheldon H. (Committee Chair), Srikant, Rayadurgam (committee member), Hajek, Bruce (committee member), Chekuri, Chandra (committee member).

Subjects/Keywords: Online assignment; resource allocation problems

Record Details Similar Records Cite « Share

❌

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 Cite « Share

❌

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 Cite « Share

❌

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

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

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.

Note: this citation may be lacking information needed for this citation format:
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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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)

▼ 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 is termed implementation uncertainty and occurs due to model fidelity limitations. This dissertation presents a model of binary variables under implementation uncertainty and develops a methodology to solve BLPs under this type of uncertainty consisting in a robust formulation (RBIU). The RBIU identifies solutions that satisfy given levels of optimality and feasibility for any realizations of the uncertainty. A solution methodology of the RBIU consists of an equivalent linear programming model. Robust solutions tend to be conservative in the sense that they sacrifice optimality to achieve the given level of feasibility. This dissertation presents two methodologies to control the conservatism of the RBIU solutions. The first method consists in controlling the feasibility relaxation level and selecting the solutions bounding the value of the objective function. The second method is an extension of a well-known method in the field of robust optimization and consists in the development of a cardinality-constrained robust BLP under implementation uncertainty (CBIU) that controls the conservatism by bounding the maximum number of variables under uncertainty with different implemented and prescribed values. The proposed concepts of robustness are applied to the knapsack problem, assignment problem and shortest path problem (SPP) under implementation uncertainty to identify their solutions immune to uncertainty and to show how particular problem structures permit to identify different important theoretical and practical properties. This work examines the properties of the robust counterparts including configurations of the control parameters, complexity and the development of solutions algorithms. This dissertation includes experimental studies to show how the proposed concepts of robustness permit to solve BLPs under implementation uncertainty and identify solutions protected against this type of uncertainty. The results of the experiments illustrate the sensitivity of the deterministic solutions to implementation uncertainty, the performance of the proposed solution methods and the different levels of the conservatism of the robust solutions. A case study involving information of a distribution company illustrates the application of the SPP under implementation uncertainty to a real problem. Advisors/Committee Members: Leon, Jorge (advisor), Lawrence, Barry (advisor), Banerjee, Amarnath (committee member), Moreno-Centeno, Erick (committee member).

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

Record Details Similar Records Cite « Share

❌

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)

▼

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 and many famous combinatorial optimization problems can be modeled using MILP formulations. It is also well-known that MILP formulations are very useful in many real life applications. Our first, rather theoretical, contribution is a new family of superadditive valid inequalities that are obtained from value functions of special surrogate optimization problems. Superadditive functions hold particular interest in MILP as they are fundamental in building integer programming duality, and all ``deepest valid inequalities'' are known to arise from superadditive functions. We propose a new family of superadditive functions that generate inequalities that are at least as strong as Chvatal-Gomory (CG-) inequalities. A special subfamily provides a new characterization of CG-cuts. Value functions of optimization problems are known to be super additive. We look at special surrogate optimization problems, and measure their complexity in terms of the number of integer variables in them. It turns out that the lowest possible nontrivial complexity class here includes all CG-cuts, and provides some stronger ones, as well. Our next contribution is a practically efficient, polynomial time method to produce ``deepest'' cuts form multiple simplex rows for the so called corner polyhedra. These inequalities have been receiving considerable attention lately. We provide a polynomial time column-generation algorithm to obtain such inequalities, based on an arbitrary (fixed) number of rows of the simplex tableau. We provide numerical evidence that these inequalities improve the CPLEX integrality gap at the root node on a well-known set of MILP instances, MIPLIB. In the last chapter, we consider a particular MILP instance, Optimal Resilient Distribution Grid Design Problem (ORDGDP). This is a problem of critical importance to infrastructure security and recently attracted a lot of attention from various government agencies (e.g. Presidential Policy Directive of Critical Infrastructure Security 2013). We formulate this problem as a MILP and propose various efficient solution methods blending together well-known decomposition ideas to overcome the numerical intractability encountered using commercial MILP software such as CPLEX.

Advisors/Committee Members: BEN-ISRAEL, ADI (chair), Boros, Endre (internal member), Gurvich, Vladimir (internal member), Zhao, Yao (internal member), Bent, Russell (outside member).

Subjects/Keywords: Linear programming

Record Details Similar Records Cite « Share

❌

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)

▼

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 métodos e conhecimentos de Investigação Operacional e Computação, adquiridos ao longo do curso, à resolução de um problema real com que se deparou uma instituição de solidariedade social, a Pressley Ridge. Este problema que a instituição designa de "projeto Marias" consiste em promover o encontro entre os pedidos de clientes que procuram quem lhes faça determinados serviços domésticos e as funcionárias da instituição com formação para prestar os serviços procurados. Para conciliar os pedidos com as disponibilidades das funcionárias é preciso fazer a afetação de funcionárias a clientes, respeitando um conjunto de condições impostas por ambas as partes. Neste trabalho propõe-se um modelo de programação linear binária para descrever matematicamente o problema. Este modelo tem por base o problema de afetação clássico, no qual se incorporam restrições adicionais. Foram desenvolvidas duas heurísticas, uma construtiva e uma melhorativa para resolver o problema nos casos em que a dimensão não permite a resolução pelo Solver Premium Pro (Premium Solver Pro, 2006-2013), um suplemento do Excel. Quer as heurísticas, quer os procedimentos de tratamento dos ficheiros de dados e de apresentação de resultados foram programados em Visual Basic. Para comparar os diferentes métodos de resolução é realizada experiência computacional considerando um conjunto de instâncias de teste. São apresentadas conclusões acerca da qualidade das heurísticas e do desempenho do Solver Premium do Excel.

This final master thesis is presented in the form of work project on the application of methods and acquired knowledge on Operations Research and Computer Science to the resolution of a real problem found by a private institution of social solidarity, the Pressley Ridge. This problem designated by the institution as "Projeto Marias" has the purpose of matching the requests of customers looking for people who do certain domestic services and trained employees of the institution who can provide the requested services. To match the clients' requests and employees' availability one has to assign employees to customers, respecting a set of conditions imposed by both parts. This paper proposes a binary linear programming model to mathematically describe the problem. The model is based on the classic assignment problem, where additional constraints are incorporated. Two heuristics were developed to provide feasible solutions for large instances that Premium Solver Pro (Premium Solver Pro, 2006-2013), an Excel add-in, could not solve. Either the heuristics or the procedures for input and output data files management were coded in Visual Basic. To compare the different methods computational experiment was carried out on a set of test instances. Conclusions are drawn about the quality of the heuristics and the performance of Excel Solver Premium.

Advisors/Committee Members: Moz, Margarida.

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 Cite « Share

❌

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

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

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.

Note: this citation may be lacking information needed for this citation format:
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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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)

▼

"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 optimal solution of singularly perturbed long run average optimal control problems – III. Perturbations of semi-infinite dimensional linear programming problems.

The thesis aims at the development of mathematical tools for analysis and construction of near optimal solutions of optimal control problems with long run average optimality criteria (LRAOC). It consists of three parts. In Part I, we establish that near optimal controls of these problems can be constructed on the basis of solutions of semi-infinite dimensional linear programming (SILP) problems and their duals. The latter are shown to be approximations of the Hamilton-Jacobi-Bellman inequality corresponding to the LRAOC problem. In Part II, we extend the consideration of Part I to singularly perturbed LRAOC problems. Our approach to these problems is based on amalgamation of averaging and linear programming based techniques. We show that an asymptotically near optimal solution of the singularly perturbed problem can be constructed on the basis of an optimal solution of the averaged LRAOC problem and we show that the optimal solution of the latter can be found with the help of linear programming based techniques. Some of the results obtained in Parts I and II are stated in the form of algorithms, the convergence of which is discussed and which are illustrated with numerical examples. In Part III, we study families of SILP problems depending on a small parameter. The family of SILP problems is regularly (singularly) perturbed if its optimal value is continuous (discontinuous) at the zero value of the parameter. We introduce a regularity condition such that if it is fulfilled, then the family of SILP problems is regularly perturbed and if it is not fulfilled, then the family is likely to be singularly perturbed. We establish relationships between the regularity condition for SILP problems and regularity conditions used in dealing with perturbed LRAOC problems.

1 online resource (170 pages)

Advisors/Committee Members: Macquarie University. Department of Mathematics.

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 Cite « Share

❌

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)

▼

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. Faremos uma revisão acerca de alguns temas relevantes sobre a Programação Linear, bem como sobre a Resolução de Problemas em Matemática, a qual consistirá na metodologia usada nessa atividade. Será apresentada uma aplicação prática dessa proposta, através de uma sequência didática, que foi aplicada num grupo de alunos do Ensino Médio, numa escola da rede de Ensino Público Federal da cidade de Porto Alegre, no ano de 2011. A Programação Linear por apresentar caráter aplicativo e contextualizado pode ser perfeitamente trabalhada no Ensino Médio do currículo da disciplina de matemática, pois tornará os discentes mais participativos e motivados a estudar e discutir essa disciplina. Seguindo a metodologia da resolução de problemas, apresentaremos algumas atividades que poderão servir de sugestões para possíveis aplicações em outros contextos e situações. Vale destacar que a resolução de problemas em matemática pode aproximar o aluno dessa disciplina, criando um ambiente muito favorável para o pleno desenvolvimento das suas capacidades cognitivas, aliando conhecimento, autonomia, criatividade, bem como aplicando, contextualizando e relacionando a matemática com o mundo que nos cerca.

The present work has as its main objective to present a proposal of study of the subject Linear Programming on the curriculum of High Schools in the discipline of Mathematics. We will do a review on some relevant themes about Linear Programming, as well as the resolution of Math problems, which will consist in the methodology used in this activity. A practical application of this proposal will be presented through a didactic sequence, which was applied in a group of High School students from a federal public school in the city of Porto Alegre, in 2011. Because of its applicative and contextualized character, the Linear Programming is perfectly adequate to be presented and worked in High Schools in the discipline of Math, for it will make students more participative and motivated to study and discuss this subject. Following the methodology of resolution of problems, we will present some activities that may serve as suggestions to possible applications in other contexts and situations. It’s important to point out that the resolution of Math problems may approach students to this discipline, creating a very favorable environment to the full development of their cognitive capacities, allying knowledge, autonomy, creativity, as well as applying, contextualizing and relating Mathematics to the world around us.

Advisors/Committee Members: Fachin, Maria Paula Goncalves.

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 Cite « Share

❌

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

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

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.

Note: this citation may be lacking information needed for this citation format:
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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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)

▼

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 cuidados continuados de internamento com o objetivo de criar uma distribuição dos utentes pelas unidades da zona do Alentejo. Após recolha dos dados, disponibilizados na internet, procedeu-se ao seu estudo e tratamento. Seguidamente, num ambiente de planeamento a nível tático, procedeu-se à distribuição dos utentes conforme a área inserida no estudo e a quantidade de camas que cada zona da referida área tem disponível ao ano. Esta distribuição foi feita minimizando o custo total de internamentos nas respetivas zonas, custo este que contabiliza as despesas relacionadas com o transporte e internamento para todas as unidades abrangidas pelo estudo. De modo a aplicar os conhecimentos adquiridos no mestrado, no que toca a Investigação Operacional, utiliza-se neste estudo um modelo de otimização, particularmente, um modelo de tipo de transportes de programação linear.O software utilizado na resolução do problema foi o Solver do Microsoft Office Excel. Com esta abordagem ao problema de planeamento de distribuição de utentes na RNCCI do Alentejo, pretende-se dar ênfase ao progresso da RNCCI em Portugal, disponibilizando uma ferramenta que pode ser usada pelos gestores no âmbito da saúde.

This research reports the National Network for Continuous Care (RNCCI), in Portugal, focusing on admission of patients in continuous care units. The intent of this work is to create a distribuition network for users of the Alentejo region. After data collection, available on the internet, we proceeded with the study and treatment of data. Afterwards, in the tactical planning setting, we proceeded with the distribution of users depending on the residential area and the number of beds available per year in each zone. This distribution was performed to reduce the total cost of hospitalization, a cost wich covers expenses related to transport and admission in the units covered by the study. In order to deepen the knowledge acquired in the master degree courses, with respect to operational research, in this study an optimization model is developed a linear programming transportation problem. The software used for solving the problem was the Solver of Microsoft Office Excel. With this approach to the problem of planning the distribution of users in the RNCCI of Alentejo region, we intend to emphasize the progress of the RNCCI in Portugal, and provide a tool that can be used by health policy makers.

info:eu-repo/semantics/publishedVersion

Advisors/Committee Members: Pato, Margarida Vaz.

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 Cite « Share

❌

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

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

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.

Note: this citation may be lacking information needed for this citation format:
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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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)

▼ 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. This thesis presents a finite improvement algorithm that solves the Linear Complementarity Problem (LCP) obtained from the Kuhn-Tucker conditions of the quadratic programming problem. The major advantage of the proposed algorithm is that any existing linear programming package may be used without modification to solve a convex quadratic programming problem. The algorithm attempts to solve the LCP by generating a finite sequence of points, each of which satisfies two of the three LCP conditions. It starts with a solution to the linearity constraints of the LCP, if one exists, and all subsequent points generated by the algorithm also satisfy these linearity constraints. At each step of the algorithm, an overall objective function is improved and acts as a measure of progress toward a solution to the LCP. It is shown that when the quadratic program is convex, the M matrix in the associated LCP is positive semidefinite and, in this case, the algorithm obtains a solution to the quadratic program in a finite number of steps. The thesis also addresses computational issues involving general LCP's with positive semidefinite matri ces. Applications involving both convex quadratic problems and linear programming problems are investigated, and computational results are reported for both the finite improvement algorithm and Lemke's algorithm. Specifically, it is shown that when bound constraints are added to the general convex quadratic program, and an initial basic feasible solution is available, the performance of the algorithm on small problems is nearly equivalent to that of Lemke's algorithm. However, as the problem size increases the algorithm becomes less efficient. In fact, it is apparent from computational testing that the algorithm is very dependent on the availability of an initial basic feasible solution, and as a result, its efficiency is strongly correlated to the Phase I procedure used to find such a starting solution. An efficient Phase I procedure is presented in which only one artificial variable is added, and it is shown that under certain circumstances this Phase I procedure follows the same path as Lemke's algorithm, thus yielding the same computational efficiencies. Advisors/Committee Members: Solow, Daniel (Advisor).

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

Record Details Similar Records Cite « Share

❌

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 Cite « Share

❌

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 Cite « Share

❌

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

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

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.

Note: this citation may be lacking information needed for this citation format:
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.

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

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 Cite « Share

❌

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

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

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.

Note: this citation may be lacking information needed for this citation format:
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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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 Cite « Share

❌

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 Cite « Share

❌

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 Cite « Share

❌

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 Cite « Share

❌

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 Cite « Share

❌

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

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

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.

Note: this citation may be lacking information needed for this citation format:
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.

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
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)

▼ 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 them. The first is the vehicle routing problem with loading constraints, in which a set of vehicles departs from a depot and have to deliver the items demands of all clients. Each vehicle has a rectangular container (bin), and each client must receive some rectangular items. We consider both cases, in which bin and items are two-dimensional or three-dimensional. In each route, it is necessary to find a packing of all clients' items in the bin. This packing has to be done in such a way that, in each visit, the unloading of the current client's items can be performed without moving the remaining items. The goal is to minimize the total travel distance of the vehicles. The second is the online circle packing problem. In this problem we have to pack circles in rectangular bins. The circles are delivered online, that is, each arrived circle has to be packed, and the sizes of future circles is unkwown. The goal is to minimize the number of used bins. The third is the two-dimensional disjunctively constrained knapsack problem, in which a bin and a set of items, rectangular and two-dimensional, are given. Each item has an associated value and some pairs of items are forbidden to be packed together. The goal is to choose a subset of items, with maximum value, that can be packed in the given bin. The thesis is composed of three articles, each one dedicated to one of the problems. Different techniques of algorithm design were used combined, such as: integer linear programing, constraint programming, heuristics, meta-heuristics and approximated algorithms. Besides the contribution of each individual article, efficiency of the combination of cited techniques is shown, considering that they might provide a good strategy for solving other problems Advisors/Committee Members: UNIVERSIDADE ESTADUAL DE CAMPINAS (CRUESP), Miyazawa, Flávio Keidi, 1970- (advisor), Universidade Estadual de Campinas. Instituto de Computação (institution), Programa de Pós-Graduação em Ciência da Computação (nameofprogram), Yanasse, Horacio Hideki (committee member), Neto, Reinaldo Morabito (committee member), Poldi, Kelly Cristina (committee member), Meira, Luis Augusto Angelotti (committee member).

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 Cite « Share

❌

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

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

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.

Note: this citation may be lacking information needed for this citation format:
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.

Note: this citation may be lacking information needed for this citation format:
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

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

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations