Advanced search options

Advanced Search Options 🞨

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

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(resource allocation problems). Showing records 1 – 8 of 8 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Illinois – Urbana-Champaign

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

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

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

Subjects/Keywords: Online assignment; resource allocation problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

Yu, Ge. “Dynamic online resource allocation problems.” 2018. Web. 20 May 2019.

Vancouver:

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


Anna University

2. Malairajan, R A. Models and heuristics for a class of resource allocation problems in supply chain; -.

Degree: Mechanical Engineering, 2014, Anna University

Resource Allocation involves the distribution and utilization of available resources in the system Because resource availability is usually scarce and expensive it becomes important to… (more)

Subjects/Keywords: Genetic Algorithms; Heuristic; Mathematical programming model; Mechanical engineering; Meta heuristic; Resource allocation problems; Simulated Annealing; Simulated Modeling; Supply chain

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Malairajan, R. A. (2014). Models and heuristics for a class of resource allocation problems in supply chain; -. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/25345

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

Chicago Manual of Style (16th Edition):

Malairajan, R A. “Models and heuristics for a class of resource allocation problems in supply chain; -.” 2014. Thesis, Anna University. Accessed May 20, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/25345.

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

MLA Handbook (7th Edition):

Malairajan, R A. “Models and heuristics for a class of resource allocation problems in supply chain; -.” 2014. Web. 20 May 2019.

Vancouver:

Malairajan RA. Models and heuristics for a class of resource allocation problems in supply chain; -. [Internet] [Thesis]. Anna University; 2014. [cited 2019 May 20]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/25345.

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

Council of Science Editors:

Malairajan RA. Models and heuristics for a class of resource allocation problems in supply chain; -. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/25345

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

3. Anguiano, Eloy. Allocating educational resources through happiness maximization and traditional CSP approach.

Degree: 2018, INSTICC

Subjects/Keywords: Constraint-Satisfaction Problems; Simulation; Model-based agent optimization; Educational Resource Allocation; Multiagent Resource Allocation; Informática

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Anguiano, E. (2018). Allocating educational resources through happiness maximization and traditional CSP approach. (Thesis). INSTICC. Retrieved from http://hdl.handle.net/10486/665606

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

Chicago Manual of Style (16th Edition):

Anguiano, Eloy. “Allocating educational resources through happiness maximization and traditional CSP approach.” 2018. Thesis, INSTICC. Accessed May 20, 2019. http://hdl.handle.net/10486/665606.

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

MLA Handbook (7th Edition):

Anguiano, Eloy. “Allocating educational resources through happiness maximization and traditional CSP approach.” 2018. Web. 20 May 2019.

Vancouver:

Anguiano E. Allocating educational resources through happiness maximization and traditional CSP approach. [Internet] [Thesis]. INSTICC; 2018. [cited 2019 May 20]. Available from: http://hdl.handle.net/10486/665606.

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

Council of Science Editors:

Anguiano E. Allocating educational resources through happiness maximization and traditional CSP approach. [Thesis]. INSTICC; 2018. Available from: http://hdl.handle.net/10486/665606

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


Virginia Tech

4. Lunday, Brian Joseph. Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods.

Degree: PhD, Industrial and Systems Engineering, 2010, Virginia Tech

 This dissertation addresses five fundamental resource allocation problems on networks, all of which have applications to support Homeland Security or industry challenges. In the first… (more)

Subjects/Keywords: network interdiction; factorable programs; resource allocation; global optimization; minimax flow problems; synergy; inner-linearization; outer-approximation; network evasion; overt and covert strategies; dynamic formulation; fleet allocation; Shapley values; marginal cost analysis; railcar management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lunday, B. J. (2010). Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/77323

Chicago Manual of Style (16th Edition):

Lunday, Brian Joseph. “Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods.” 2010. Doctoral Dissertation, Virginia Tech. Accessed May 20, 2019. http://hdl.handle.net/10919/77323.

MLA Handbook (7th Edition):

Lunday, Brian Joseph. “Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods.” 2010. Web. 20 May 2019.

Vancouver:

Lunday BJ. Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods. [Internet] [Doctoral dissertation]. Virginia Tech; 2010. [cited 2019 May 20]. Available from: http://hdl.handle.net/10919/77323.

Council of Science Editors:

Lunday BJ. Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods. [Doctoral Dissertation]. Virginia Tech; 2010. Available from: http://hdl.handle.net/10919/77323


Arizona State University

5. Mazumder, Anisha. Optimal Resource Allocation in Social and Critical Infrastructure Networks.

Degree: Computer Science, 2016, Arizona State University

Subjects/Keywords: Computer science; Algorithms; Critical Infrastructure Networks Analysis; NP Completeness Analysis; optimization problems; Resource Allocation problems; Social Networks Analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mazumder, A. (2016). Optimal Resource Allocation in Social and Critical Infrastructure Networks. (Doctoral Dissertation). Arizona State University. Retrieved from http://repository.asu.edu/items/40712

Chicago Manual of Style (16th Edition):

Mazumder, Anisha. “Optimal Resource Allocation in Social and Critical Infrastructure Networks.” 2016. Doctoral Dissertation, Arizona State University. Accessed May 20, 2019. http://repository.asu.edu/items/40712.

MLA Handbook (7th Edition):

Mazumder, Anisha. “Optimal Resource Allocation in Social and Critical Infrastructure Networks.” 2016. Web. 20 May 2019.

Vancouver:

Mazumder A. Optimal Resource Allocation in Social and Critical Infrastructure Networks. [Internet] [Doctoral dissertation]. Arizona State University; 2016. [cited 2019 May 20]. Available from: http://repository.asu.edu/items/40712.

Council of Science Editors:

Mazumder A. Optimal Resource Allocation in Social and Critical Infrastructure Networks. [Doctoral Dissertation]. Arizona State University; 2016. Available from: http://repository.asu.edu/items/40712

6. Klement, Nathalie. Planification et affectation de ressources dans les réseaux de soin : analogie avec le problème du bin packing, proposition de méthodes approchées : Planning and resources assignment in healthcare networks : analogy with the bin packing problem, proposition of approximate methods.

Degree: Docteur es, Informatique, 2014, Université Blaise-Pascale, Clermont-Ferrand II

Les travaux de thèse présentés s’intéressent à l’optimisation des systèmes hospitaliers. Une solution existante est la mutualisation de ressources au sein d’un même territoire. Cela… (more)

Subjects/Keywords: Planification d’activités; Affectation de ressources; Problèmes du bin packing; Métaheuristiques basées individu; Optimisation par essaim particulaire; Heuristiques; Hybridation de méthodes; Coopération; Mutualisation; Activities planning; Resource allocation; Bin packing problems; Single based metaheuristics; Particle swarm optimization; Heuristics; Hybridization of methods; Cooperation; Pooling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Klement, N. (2014). Planification et affectation de ressources dans les réseaux de soin : analogie avec le problème du bin packing, proposition de méthodes approchées : Planning and resources assignment in healthcare networks : analogy with the bin packing problem, proposition of approximate methods. (Doctoral Dissertation). Université Blaise-Pascale, Clermont-Ferrand II. Retrieved from http://www.theses.fr/2014CLF22517

Chicago Manual of Style (16th Edition):

Klement, Nathalie. “Planification et affectation de ressources dans les réseaux de soin : analogie avec le problème du bin packing, proposition de méthodes approchées : Planning and resources assignment in healthcare networks : analogy with the bin packing problem, proposition of approximate methods.” 2014. Doctoral Dissertation, Université Blaise-Pascale, Clermont-Ferrand II. Accessed May 20, 2019. http://www.theses.fr/2014CLF22517.

MLA Handbook (7th Edition):

Klement, Nathalie. “Planification et affectation de ressources dans les réseaux de soin : analogie avec le problème du bin packing, proposition de méthodes approchées : Planning and resources assignment in healthcare networks : analogy with the bin packing problem, proposition of approximate methods.” 2014. Web. 20 May 2019.

Vancouver:

Klement N. Planification et affectation de ressources dans les réseaux de soin : analogie avec le problème du bin packing, proposition de méthodes approchées : Planning and resources assignment in healthcare networks : analogy with the bin packing problem, proposition of approximate methods. [Internet] [Doctoral dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2014. [cited 2019 May 20]. Available from: http://www.theses.fr/2014CLF22517.

Council of Science Editors:

Klement N. Planification et affectation de ressources dans les réseaux de soin : analogie avec le problème du bin packing, proposition de méthodes approchées : Planning and resources assignment in healthcare networks : analogy with the bin packing problem, proposition of approximate methods. [Doctoral Dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2014. Available from: http://www.theses.fr/2014CLF22517


University of South Africa

7. Venter, Geertien. Bydraes tot die oplossing van die veralgemeende knapsakprobleem .

Degree: 2013, University of South Africa

 In this thesis contributions to the solution of the generalised knapsack problem are given and discussed. Attention is given to problems with functions that are… (more)

Subjects/Keywords: Knapsakprobleem; Hulpbrontoekenningsprobleem; Nielineer; Konvekse knapsakprobleem; Niekonvekse knapsakprobleem; Niekonvekse optimering; Nielineere optimering; Heuristiek; Nodige voorwaardes; Voldoende voorwaardes; Toetsprobleme; Knapsack problem; Resource allocation problem; Nonlinear knapsack problem; Convex knapsack; Nonconvex knapsack problem; Nonconvex optimisation; Nonlinear optimisation; Heuristic; Necessary conditions; Sufficient conditions; Test problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Venter, G. (2013). Bydraes tot die oplossing van die veralgemeende knapsakprobleem . (Doctoral Dissertation). University of South Africa. Retrieved from http://hdl.handle.net/10500/8603

Chicago Manual of Style (16th Edition):

Venter, Geertien. “Bydraes tot die oplossing van die veralgemeende knapsakprobleem .” 2013. Doctoral Dissertation, University of South Africa. Accessed May 20, 2019. http://hdl.handle.net/10500/8603.

MLA Handbook (7th Edition):

Venter, Geertien. “Bydraes tot die oplossing van die veralgemeende knapsakprobleem .” 2013. Web. 20 May 2019.

Vancouver:

Venter G. Bydraes tot die oplossing van die veralgemeende knapsakprobleem . [Internet] [Doctoral dissertation]. University of South Africa; 2013. [cited 2019 May 20]. Available from: http://hdl.handle.net/10500/8603.

Council of Science Editors:

Venter G. Bydraes tot die oplossing van die veralgemeende knapsakprobleem . [Doctoral Dissertation]. University of South Africa; 2013. Available from: http://hdl.handle.net/10500/8603


Vrije Universiteit Amsterdam

8. Yang, R. Adaptive Resource Allocation in High-Performance Distributed Multimedia Computing .

Degree: 2011, Vrije Universiteit Amsterdam

Subjects/Keywords: Constrained Markov decision problems; monotonicity; optimal resource allocation; shared server pool; queueing theory; grid computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, R. (2011). Adaptive Resource Allocation in High-Performance Distributed Multimedia Computing . (Doctoral Dissertation). Vrije Universiteit Amsterdam. Retrieved from http://hdl.handle.net/1871/19509

Chicago Manual of Style (16th Edition):

Yang, R. “Adaptive Resource Allocation in High-Performance Distributed Multimedia Computing .” 2011. Doctoral Dissertation, Vrije Universiteit Amsterdam. Accessed May 20, 2019. http://hdl.handle.net/1871/19509.

MLA Handbook (7th Edition):

Yang, R. “Adaptive Resource Allocation in High-Performance Distributed Multimedia Computing .” 2011. Web. 20 May 2019.

Vancouver:

Yang R. Adaptive Resource Allocation in High-Performance Distributed Multimedia Computing . [Internet] [Doctoral dissertation]. Vrije Universiteit Amsterdam; 2011. [cited 2019 May 20]. Available from: http://hdl.handle.net/1871/19509.

Council of Science Editors:

Yang R. Adaptive Resource Allocation in High-Performance Distributed Multimedia Computing . [Doctoral Dissertation]. Vrije Universiteit Amsterdam; 2011. Available from: http://hdl.handle.net/1871/19509

.