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:(knapsack). Showing records 1 – 30 of 108 total matches.

[1] [2] [3] [4]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

▼ Search Limiters


University of Florida

1. He, Xueqi. Exact and Heuristic Approaches for Integer Knapsack Problems.

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

Subjects/Keywords: knapsack

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

He, X. (2016). Exact and Heuristic Approaches for Integer Knapsack Problems. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0050343

Chicago Manual of Style (16th Edition):

He, Xueqi. “Exact and Heuristic Approaches for Integer Knapsack Problems.” 2016. Doctoral Dissertation, University of Florida. Accessed April 08, 2020. http://ufdc.ufl.edu/UFE0050343.

MLA Handbook (7th Edition):

He, Xueqi. “Exact and Heuristic Approaches for Integer Knapsack Problems.” 2016. Web. 08 Apr 2020.

Vancouver:

He X. Exact and Heuristic Approaches for Integer Knapsack Problems. [Internet] [Doctoral dissertation]. University of Florida; 2016. [cited 2020 Apr 08]. Available from: http://ufdc.ufl.edu/UFE0050343.

Council of Science Editors:

He X. Exact and Heuristic Approaches for Integer Knapsack Problems. [Doctoral Dissertation]. University of Florida; 2016. Available from: http://ufdc.ufl.edu/UFE0050343

2. Al-Douri, Thekra. Méthodes heuristiques pour les problèmes de type knapsack : Heuristic methods for solving knapsack type problems.

Degree: Docteur es, Informatique. Recherche opérationnelle et optimisation, 2018, Amiens

Les travaux de recherche de cette thèse s'articulent autour de la résolution du problème du sac à dos en min-max avec de multiples scénarios (en… (more)

Subjects/Keywords: Voisinage; Approximation; Knapsack

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Al-Douri, T. (2018). Méthodes heuristiques pour les problèmes de type knapsack : Heuristic methods for solving knapsack type problems. (Doctoral Dissertation). Amiens. Retrieved from http://www.theses.fr/2018AMIE0023

Chicago Manual of Style (16th Edition):

Al-Douri, Thekra. “Méthodes heuristiques pour les problèmes de type knapsack : Heuristic methods for solving knapsack type problems.” 2018. Doctoral Dissertation, Amiens. Accessed April 08, 2020. http://www.theses.fr/2018AMIE0023.

MLA Handbook (7th Edition):

Al-Douri, Thekra. “Méthodes heuristiques pour les problèmes de type knapsack : Heuristic methods for solving knapsack type problems.” 2018. Web. 08 Apr 2020.

Vancouver:

Al-Douri T. Méthodes heuristiques pour les problèmes de type knapsack : Heuristic methods for solving knapsack type problems. [Internet] [Doctoral dissertation]. Amiens; 2018. [cited 2020 Apr 08]. Available from: http://www.theses.fr/2018AMIE0023.

Council of Science Editors:

Al-Douri T. Méthodes heuristiques pour les problèmes de type knapsack : Heuristic methods for solving knapsack type problems. [Doctoral Dissertation]. Amiens; 2018. Available from: http://www.theses.fr/2018AMIE0023


Curtin University of Technology

3. Kulanoot, Araya. Algorithms for some hard knapsack problems .

Degree: 2000, Curtin University of Technology

 The Knapsack Problems are among the simplest integer programs which are NP-hard. Problems in this class are typically concerned with selecting from a set of… (more)

Subjects/Keywords: Knapsack problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kulanoot, A. (2000). Algorithms for some hard knapsack problems . (Thesis). Curtin University of Technology. Retrieved from http://hdl.handle.net/20.500.11937/1101

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

Kulanoot, Araya. “Algorithms for some hard knapsack problems .” 2000. Thesis, Curtin University of Technology. Accessed April 08, 2020. http://hdl.handle.net/20.500.11937/1101.

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

MLA Handbook (7th Edition):

Kulanoot, Araya. “Algorithms for some hard knapsack problems .” 2000. Web. 08 Apr 2020.

Vancouver:

Kulanoot A. Algorithms for some hard knapsack problems . [Internet] [Thesis]. Curtin University of Technology; 2000. [cited 2020 Apr 08]. Available from: http://hdl.handle.net/20.500.11937/1101.

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

Council of Science Editors:

Kulanoot A. Algorithms for some hard knapsack problems . [Thesis]. Curtin University of Technology; 2000. Available from: http://hdl.handle.net/20.500.11937/1101

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

4. Smith, Blake. Robust optimization of linear optimization problems and an approximation approach to solve robust Knapsack Problem.

Degree: 2019, University of Tennessee – Chattanooga

 The goal of classical KP, is to find a subset of items whose total weight does not exceed the knapsack capacity, and whose profit is… (more)

Subjects/Keywords: Mathematical optimization; Knapsack problem (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Smith, B. (2019). Robust optimization of linear optimization problems and an approximation approach to solve robust Knapsack Problem. (Thesis). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/598

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

Smith, Blake. “Robust optimization of linear optimization problems and an approximation approach to solve robust Knapsack Problem.” 2019. Thesis, University of Tennessee – Chattanooga. Accessed April 08, 2020. https://scholar.utc.edu/theses/598.

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

MLA Handbook (7th Edition):

Smith, Blake. “Robust optimization of linear optimization problems and an approximation approach to solve robust Knapsack Problem.” 2019. Web. 08 Apr 2020.

Vancouver:

Smith B. Robust optimization of linear optimization problems and an approximation approach to solve robust Knapsack Problem. [Internet] [Thesis]. University of Tennessee – Chattanooga; 2019. [cited 2020 Apr 08]. Available from: https://scholar.utc.edu/theses/598.

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

Council of Science Editors:

Smith B. Robust optimization of linear optimization problems and an approximation approach to solve robust Knapsack Problem. [Thesis]. University of Tennessee – Chattanooga; 2019. Available from: https://scholar.utc.edu/theses/598

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


University of Southern California

5. Chen, Kai. Variants of stochastic knapsack problems.

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

 We consider variants of stochastic knapsack problems with different problem settings, on-line vs off-line, and with different assumptions on the objective functions. We try to… (more)

Subjects/Keywords: stochastic; knapsack; dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, K. (2013). Variants of stochastic knapsack problems. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/347957/rec/7812

Chicago Manual of Style (16th Edition):

Chen, Kai. “Variants of stochastic knapsack problems.” 2013. Doctoral Dissertation, University of Southern California. Accessed April 08, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/347957/rec/7812.

MLA Handbook (7th Edition):

Chen, Kai. “Variants of stochastic knapsack problems.” 2013. Web. 08 Apr 2020.

Vancouver:

Chen K. Variants of stochastic knapsack problems. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2020 Apr 08]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/347957/rec/7812.

Council of Science Editors:

Chen K. Variants of stochastic knapsack problems. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/347957/rec/7812


Texas State University – San Marcos

6. Rashid, Hammad A. Parallel Knapsack Algorithms on Multicore Architectures.

Degree: MS, Computer Science, 2010, Texas State University – San Marcos

 Emergence of chip multiprocessor systems has dramatically increased the performance potential of computer systems. Since the amount of exploited parallelism is directly influenced by the… (more)

Subjects/Keywords: Multicore; Knapsack; Parallel; Openmp; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rashid, H. A. (2010). Parallel Knapsack Algorithms on Multicore Architectures. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/3904

Chicago Manual of Style (16th Edition):

Rashid, Hammad A. “Parallel Knapsack Algorithms on Multicore Architectures.” 2010. Masters Thesis, Texas State University – San Marcos. Accessed April 08, 2020. https://digital.library.txstate.edu/handle/10877/3904.

MLA Handbook (7th Edition):

Rashid, Hammad A. “Parallel Knapsack Algorithms on Multicore Architectures.” 2010. Web. 08 Apr 2020.

Vancouver:

Rashid HA. Parallel Knapsack Algorithms on Multicore Architectures. [Internet] [Masters thesis]. Texas State University – San Marcos; 2010. [cited 2020 Apr 08]. Available from: https://digital.library.txstate.edu/handle/10877/3904.

Council of Science Editors:

Rashid HA. Parallel Knapsack Algorithms on Multicore Architectures. [Masters Thesis]. Texas State University – San Marcos; 2010. Available from: https://digital.library.txstate.edu/handle/10877/3904


University of Houston

7. -9596-0108. Optimization Model for Optimal Allocation of Mobile Health Clinics.

Degree: MSin Industrial Engineering, Industrial Engineering, 2017, University of Houston

 Mobile health clinics can be used as an effective resource in healthcare delivery system, especially for underprivileged communities. However, mobile health clinics are one of… (more)

Subjects/Keywords: Optimization; Mobile Health Clinics; Knapsack Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-9596-0108. (2017). Optimization Model for Optimal Allocation of Mobile Health Clinics. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/4781

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

-9596-0108. “Optimization Model for Optimal Allocation of Mobile Health Clinics.” 2017. Masters Thesis, University of Houston. Accessed April 08, 2020. http://hdl.handle.net/10657/4781.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

-9596-0108. “Optimization Model for Optimal Allocation of Mobile Health Clinics.” 2017. Web. 08 Apr 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-9596-0108. Optimization Model for Optimal Allocation of Mobile Health Clinics. [Internet] [Masters thesis]. University of Houston; 2017. [cited 2020 Apr 08]. Available from: http://hdl.handle.net/10657/4781.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-9596-0108. Optimization Model for Optimal Allocation of Mobile Health Clinics. [Masters Thesis]. University of Houston; 2017. Available from: http://hdl.handle.net/10657/4781

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


Cornell University

8. Azzaino, Zevi. Binary Optimization: Applications To Regional Planning .

Degree: 2011, Cornell University

 This dissertation is based on three related essays applying binary optimization, with a focus on discovering the best selection of nodes, parcels, and villages that… (more)

Subjects/Keywords: Binary Optimization; knapsack problem; Aceh; tsunami; Clustered Knapsack; Skaneateles Lake; riparian buffer

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Azzaino, Z. (2011). Binary Optimization: Applications To Regional Planning . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/30745

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

Azzaino, Zevi. “Binary Optimization: Applications To Regional Planning .” 2011. Thesis, Cornell University. Accessed April 08, 2020. http://hdl.handle.net/1813/30745.

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

MLA Handbook (7th Edition):

Azzaino, Zevi. “Binary Optimization: Applications To Regional Planning .” 2011. Web. 08 Apr 2020.

Vancouver:

Azzaino Z. Binary Optimization: Applications To Regional Planning . [Internet] [Thesis]. Cornell University; 2011. [cited 2020 Apr 08]. Available from: http://hdl.handle.net/1813/30745.

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

Council of Science Editors:

Azzaino Z. Binary Optimization: Applications To Regional Planning . [Thesis]. Cornell University; 2011. Available from: http://hdl.handle.net/1813/30745

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


Georgia Tech

9. Li, Yaxian. Lower bounds for integer programming problems.

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

 Solving real world problems with mixed integer programming (MIP) involves efforts in modeling and efficient algorithms. To solve a minimization MIP problem, a lower bound… (more)

Subjects/Keywords: Lower bounds; Integer programming problems; Multi-dimensional knapsack problem; Algorithms; Knapsack problem (Mathematics); Integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Y. (2013). Lower bounds for integer programming problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/48959

Chicago Manual of Style (16th Edition):

Li, Yaxian. “Lower bounds for integer programming problems.” 2013. Doctoral Dissertation, Georgia Tech. Accessed April 08, 2020. http://hdl.handle.net/1853/48959.

MLA Handbook (7th Edition):

Li, Yaxian. “Lower bounds for integer programming problems.” 2013. Web. 08 Apr 2020.

Vancouver:

Li Y. Lower bounds for integer programming problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2020 Apr 08]. Available from: http://hdl.handle.net/1853/48959.

Council of Science Editors:

Li Y. Lower bounds for integer programming problems. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/48959


Clemson University

10. Dabney, Matthew. A PTAS for the Uncertain Capacity Knapsack Problem.

Degree: MS, Computer Science, 2010, Clemson University

 The standard NP-hard knapsack problem can be interpreted as a scheduling problem with n jobs with weights w1 . . .wn and processing times p1(more)

Subjects/Keywords: Knapsack Problem; NP-Hard; PTAS; Scheduling; Stochastic; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dabney, M. (2010). A PTAS for the Uncertain Capacity Knapsack Problem. (Masters Thesis). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_theses/982

Chicago Manual of Style (16th Edition):

Dabney, Matthew. “A PTAS for the Uncertain Capacity Knapsack Problem.” 2010. Masters Thesis, Clemson University. Accessed April 08, 2020. https://tigerprints.clemson.edu/all_theses/982.

MLA Handbook (7th Edition):

Dabney, Matthew. “A PTAS for the Uncertain Capacity Knapsack Problem.” 2010. Web. 08 Apr 2020.

Vancouver:

Dabney M. A PTAS for the Uncertain Capacity Knapsack Problem. [Internet] [Masters thesis]. Clemson University; 2010. [cited 2020 Apr 08]. Available from: https://tigerprints.clemson.edu/all_theses/982.

Council of Science Editors:

Dabney M. A PTAS for the Uncertain Capacity Knapsack Problem. [Masters Thesis]. Clemson University; 2010. Available from: https://tigerprints.clemson.edu/all_theses/982


Clemson University

11. Shen, Ruobing. Convex Hull Characterization of Special Polytopes in n-ary Variables.

Degree: MS, Mathematical Science, 2012, Clemson University

 This paper characterizes the convex hull of the set of n-ary vectors that are lexicographically less than or equal to a given such vector. A… (more)

Subjects/Keywords: convex hull; facets; knapsack problem; n-ary optimization; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shen, R. (2012). Convex Hull Characterization of Special Polytopes in n-ary Variables. (Masters Thesis). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_theses/1552

Chicago Manual of Style (16th Edition):

Shen, Ruobing. “Convex Hull Characterization of Special Polytopes in n-ary Variables.” 2012. Masters Thesis, Clemson University. Accessed April 08, 2020. https://tigerprints.clemson.edu/all_theses/1552.

MLA Handbook (7th Edition):

Shen, Ruobing. “Convex Hull Characterization of Special Polytopes in n-ary Variables.” 2012. Web. 08 Apr 2020.

Vancouver:

Shen R. Convex Hull Characterization of Special Polytopes in n-ary Variables. [Internet] [Masters thesis]. Clemson University; 2012. [cited 2020 Apr 08]. Available from: https://tigerprints.clemson.edu/all_theses/1552.

Council of Science Editors:

Shen R. Convex Hull Characterization of Special Polytopes in n-ary Variables. [Masters Thesis]. Clemson University; 2012. Available from: https://tigerprints.clemson.edu/all_theses/1552


Virginia Tech

12. Cherbaka, Natalie Stanislaw. Solving Single and Multiple Plant Sourcing Problems with a Multidimensional Knapsack Model.

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

 This research addresses sourcing decisions and how those decisions can affect the management of a company's assets. The study begins with a single-plant problem, in… (more)

Subjects/Keywords: Multidimensional Knapsack Problem; Insourcing; Outsourcing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cherbaka, N. S. (2004). Solving Single and Multiple Plant Sourcing Problems with a Multidimensional Knapsack Model. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/29802

Chicago Manual of Style (16th Edition):

Cherbaka, Natalie Stanislaw. “Solving Single and Multiple Plant Sourcing Problems with a Multidimensional Knapsack Model.” 2004. Doctoral Dissertation, Virginia Tech. Accessed April 08, 2020. http://hdl.handle.net/10919/29802.

MLA Handbook (7th Edition):

Cherbaka, Natalie Stanislaw. “Solving Single and Multiple Plant Sourcing Problems with a Multidimensional Knapsack Model.” 2004. Web. 08 Apr 2020.

Vancouver:

Cherbaka NS. Solving Single and Multiple Plant Sourcing Problems with a Multidimensional Knapsack Model. [Internet] [Doctoral dissertation]. Virginia Tech; 2004. [cited 2020 Apr 08]. Available from: http://hdl.handle.net/10919/29802.

Council of Science Editors:

Cherbaka NS. Solving Single and Multiple Plant Sourcing Problems with a Multidimensional Knapsack Model. [Doctoral Dissertation]. Virginia Tech; 2004. Available from: http://hdl.handle.net/10919/29802

13. Morrison, Thomas Braden. Synchronized simultaneous approximate lifting for the multiple knapsack polytope.

Degree: MS, Department of Industrial and Manufacturing Systems Engineering, 2012, Kansas State University

 Integer programs (IPs) are mathematical models that can provide an optimal solution to a variety of different problems. They have the ability to maximize profitability… (more)

Subjects/Keywords: Lifting; Polyhedral theory; Approximate; Sychronized; Simultaneous; Knapsack; Operations Research (0796)

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Morrison, T. B. (2012). Synchronized simultaneous approximate lifting for the multiple knapsack polytope. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/13548

Chicago Manual of Style (16th Edition):

Morrison, Thomas Braden. “Synchronized simultaneous approximate lifting for the multiple knapsack polytope.” 2012. Masters Thesis, Kansas State University. Accessed April 08, 2020. http://hdl.handle.net/2097/13548.

MLA Handbook (7th Edition):

Morrison, Thomas Braden. “Synchronized simultaneous approximate lifting for the multiple knapsack polytope.” 2012. Web. 08 Apr 2020.

Vancouver:

Morrison TB. Synchronized simultaneous approximate lifting for the multiple knapsack polytope. [Internet] [Masters thesis]. Kansas State University; 2012. [cited 2020 Apr 08]. Available from: http://hdl.handle.net/2097/13548.

Council of Science Editors:

Morrison TB. Synchronized simultaneous approximate lifting for the multiple knapsack polytope. [Masters Thesis]. Kansas State University; 2012. Available from: http://hdl.handle.net/2097/13548


University of Lethbridge

14. University of Lethbridge. Faculty of Arts and Science. Semi-extractive multi-document summarization .

Degree: 2015, University of Lethbridge

 In this thesis, I design a Maximum Coverage problem with KnaPsack constraint (MCKP) based model for extractive multi-document summarization. The model integrates three measures to… (more)

Subjects/Keywords: greedy algorithm; knapsack; maximum coverage; multi-document; summarization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Science, U. o. L. F. o. A. a. (2015). Semi-extractive multi-document summarization . (Thesis). University of Lethbridge. Retrieved from http://hdl.handle.net/10133/3759

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

Science, University of Lethbridge. Faculty of Arts and. “Semi-extractive multi-document summarization .” 2015. Thesis, University of Lethbridge. Accessed April 08, 2020. http://hdl.handle.net/10133/3759.

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

MLA Handbook (7th Edition):

Science, University of Lethbridge. Faculty of Arts and. “Semi-extractive multi-document summarization .” 2015. Web. 08 Apr 2020.

Vancouver:

Science UoLFoAa. Semi-extractive multi-document summarization . [Internet] [Thesis]. University of Lethbridge; 2015. [cited 2020 Apr 08]. Available from: http://hdl.handle.net/10133/3759.

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

Council of Science Editors:

Science UoLFoAa. Semi-extractive multi-document summarization . [Thesis]. University of Lethbridge; 2015. Available from: http://hdl.handle.net/10133/3759

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


University of Oklahoma

15. Badiru, Kayode. Knapsack Problems; Methods, Models and Applications.

Degree: PhD, 2009, University of Oklahoma

 For SKPPC, for each item of the knapsack, there are several possible processing times, each with certain probability of selection. For a given knapsack capacity,… (more)

Subjects/Keywords: Knapsack problem (Mathematics); Mathematical optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Badiru, K. (2009). Knapsack Problems; Methods, Models and Applications. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/320340

Chicago Manual of Style (16th Edition):

Badiru, Kayode. “Knapsack Problems; Methods, Models and Applications.” 2009. Doctoral Dissertation, University of Oklahoma. Accessed April 08, 2020. http://hdl.handle.net/11244/320340.

MLA Handbook (7th Edition):

Badiru, Kayode. “Knapsack Problems; Methods, Models and Applications.” 2009. Web. 08 Apr 2020.

Vancouver:

Badiru K. Knapsack Problems; Methods, Models and Applications. [Internet] [Doctoral dissertation]. University of Oklahoma; 2009. [cited 2020 Apr 08]. Available from: http://hdl.handle.net/11244/320340.

Council of Science Editors:

Badiru K. Knapsack Problems; Methods, Models and Applications. [Doctoral Dissertation]. University of Oklahoma; 2009. Available from: http://hdl.handle.net/11244/320340


University of Oklahoma

16. Badiru, Kayode. Knapsack Problems; Methods, Models and Applications.

Degree: PhD, 2009, University of Oklahoma

 For SKPPC, for each item of the knapsack, there are several possible processing times, each with certain probability of selection. For a given knapsack capacity,… (more)

Subjects/Keywords: Knapsack problem (Mathematics); Mathematical optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Badiru, K. (2009). Knapsack Problems; Methods, Models and Applications. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/319274

Chicago Manual of Style (16th Edition):

Badiru, Kayode. “Knapsack Problems; Methods, Models and Applications.” 2009. Doctoral Dissertation, University of Oklahoma. Accessed April 08, 2020. http://hdl.handle.net/11244/319274.

MLA Handbook (7th Edition):

Badiru, Kayode. “Knapsack Problems; Methods, Models and Applications.” 2009. Web. 08 Apr 2020.

Vancouver:

Badiru K. Knapsack Problems; Methods, Models and Applications. [Internet] [Doctoral dissertation]. University of Oklahoma; 2009. [cited 2020 Apr 08]. Available from: http://hdl.handle.net/11244/319274.

Council of Science Editors:

Badiru K. Knapsack Problems; Methods, Models and Applications. [Doctoral Dissertation]. University of Oklahoma; 2009. Available from: http://hdl.handle.net/11244/319274


Purdue University

17. Kloster, Kyle. Graph diffusions and matrix functions: fast algorithms and localization results.

Degree: PhD, Mathematics, 2016, Purdue University

 Network analysis provides tools for addressing fundamental applications in graphs such as webpage ranking, protein-function prediction, and product categorization and recommendation. As real-world networks grow… (more)

Subjects/Keywords: community detection; graph diffusions; knapsack problem; localization; matrix exponential; PageRank

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kloster, K. (2016). Graph diffusions and matrix functions: fast algorithms and localization results. (Doctoral Dissertation). Purdue University. Retrieved from https://docs.lib.purdue.edu/open_access_dissertations/1404

Chicago Manual of Style (16th Edition):

Kloster, Kyle. “Graph diffusions and matrix functions: fast algorithms and localization results.” 2016. Doctoral Dissertation, Purdue University. Accessed April 08, 2020. https://docs.lib.purdue.edu/open_access_dissertations/1404.

MLA Handbook (7th Edition):

Kloster, Kyle. “Graph diffusions and matrix functions: fast algorithms and localization results.” 2016. Web. 08 Apr 2020.

Vancouver:

Kloster K. Graph diffusions and matrix functions: fast algorithms and localization results. [Internet] [Doctoral dissertation]. Purdue University; 2016. [cited 2020 Apr 08]. Available from: https://docs.lib.purdue.edu/open_access_dissertations/1404.

Council of Science Editors:

Kloster K. Graph diffusions and matrix functions: fast algorithms and localization results. [Doctoral Dissertation]. Purdue University; 2016. Available from: https://docs.lib.purdue.edu/open_access_dissertations/1404


Linköping University

18. Suri, Bharath. Accelerating the knapsack problem on GPUs.

Degree: ESLAB - Embedded Systems Laboratory, 2011, Linköping University

  The knapsack problem manifests itself in many domains like cryptography, financial domain and bio-informatics. Knapsack problems are often inside optimization loops in system-level design… (more)

Subjects/Keywords: gpgpu; knapsack; parallel computing; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Suri, B. (2011). Accelerating the knapsack problem on GPUs. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-70406

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

Suri, Bharath. “Accelerating the knapsack problem on GPUs.” 2011. Thesis, Linköping University. Accessed April 08, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-70406.

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

MLA Handbook (7th Edition):

Suri, Bharath. “Accelerating the knapsack problem on GPUs.” 2011. Web. 08 Apr 2020.

Vancouver:

Suri B. Accelerating the knapsack problem on GPUs. [Internet] [Thesis]. Linköping University; 2011. [cited 2020 Apr 08]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-70406.

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

Council of Science Editors:

Suri B. Accelerating the knapsack problem on GPUs. [Thesis]. Linköping University; 2011. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-70406

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


University of South Africa

19. 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 April 08, 2020. http://hdl.handle.net/10500/8603.

MLA Handbook (7th Edition):

Venter, Geertien. “Bydraes tot die oplossing van die veralgemeende knapsakprobleem .” 2013. Web. 08 Apr 2020.

Vancouver:

Venter G. Bydraes tot die oplossing van die veralgemeende knapsakprobleem . [Internet] [Doctoral dissertation]. University of South Africa; 2013. [cited 2020 Apr 08]. 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


Colorado State University

20. Sifat, Tarequl Islam. Revisiting sparse dynamic programming for the 0/1 Knapsack Problem.

Degree: MS(M.S.), Computer Science, 2019, Colorado State University

 The 0/1-Knapsack Problem is a classic NP-hard problem. There are two common approaches to obtain the exact solution: branch-and-bound (BB) and dynamic programming (DP). A… (more)

Subjects/Keywords: dynamic programming; sparsity; salable parallelization; 0/1 knapsack

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sifat, T. I. (2019). Revisiting sparse dynamic programming for the 0/1 Knapsack Problem. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/195332

Chicago Manual of Style (16th Edition):

Sifat, Tarequl Islam. “Revisiting sparse dynamic programming for the 0/1 Knapsack Problem.” 2019. Masters Thesis, Colorado State University. Accessed April 08, 2020. http://hdl.handle.net/10217/195332.

MLA Handbook (7th Edition):

Sifat, Tarequl Islam. “Revisiting sparse dynamic programming for the 0/1 Knapsack Problem.” 2019. Web. 08 Apr 2020.

Vancouver:

Sifat TI. Revisiting sparse dynamic programming for the 0/1 Knapsack Problem. [Internet] [Masters thesis]. Colorado State University; 2019. [cited 2020 Apr 08]. Available from: http://hdl.handle.net/10217/195332.

Council of Science Editors:

Sifat TI. Revisiting sparse dynamic programming for the 0/1 Knapsack Problem. [Masters Thesis]. Colorado State University; 2019. Available from: http://hdl.handle.net/10217/195332


Brno University of Technology

21. Záň, Drahoslav. Akcelerace částicových rojů PSO pomocí GPU .

Degree: 2013, Brno University of Technology

 Tato práce sa zabývá populačně založenou stochastickou optimalizační technikou PSO (Particle Swarm Optimization) a její akcelerací. Jedná se o jednoduchou, ale velmi efektivní techniku, určenou… (more)

Subjects/Keywords: PSO; HPC; CPU; GPU; GPGPU; CUDA; Knapsack; MKP; optimalizace; roj; částice; PSO; HPC; CPU; GPU; GPGPU; CUDA; Knapsack; MKP; optimalization; swarm; particle

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Záň, D. (2013). Akcelerace částicových rojů PSO pomocí GPU . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53517

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

Záň, Drahoslav. “Akcelerace částicových rojů PSO pomocí GPU .” 2013. Thesis, Brno University of Technology. Accessed April 08, 2020. http://hdl.handle.net/11012/53517.

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

MLA Handbook (7th Edition):

Záň, Drahoslav. “Akcelerace částicových rojů PSO pomocí GPU .” 2013. Web. 08 Apr 2020.

Vancouver:

Záň D. Akcelerace částicových rojů PSO pomocí GPU . [Internet] [Thesis]. Brno University of Technology; 2013. [cited 2020 Apr 08]. Available from: http://hdl.handle.net/11012/53517.

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

Council of Science Editors:

Záň D. Akcelerace částicových rojů PSO pomocí GPU . [Thesis]. Brno University of Technology; 2013. Available from: http://hdl.handle.net/11012/53517

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

22. Rashid, Hammad A. Parallel Knapsack Algorithms on Multicore Architectures.

Degree: 2013

Subjects/Keywords: Multicore; Knapsack; Parallel; Openmp; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rashid, H. A. (2013). Parallel Knapsack Algorithms on Multicore Architectures. (Thesis). [No school.] Retrieved from http://hdl.handle.net/2249.1/62485

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

Chicago Manual of Style (16th Edition):

Rashid, Hammad A. “Parallel Knapsack Algorithms on Multicore Architectures.” 2013. Thesis, [No school]. Accessed April 08, 2020. http://hdl.handle.net/2249.1/62485.

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

MLA Handbook (7th Edition):

Rashid, Hammad A. “Parallel Knapsack Algorithms on Multicore Architectures.” 2013. Web. 08 Apr 2020.

Vancouver:

Rashid HA. Parallel Knapsack Algorithms on Multicore Architectures. [Internet] [Thesis]. [No school]; 2013. [cited 2020 Apr 08]. Available from: http://hdl.handle.net/2249.1/62485.

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

Council of Science Editors:

Rashid HA. Parallel Knapsack Algorithms on Multicore Architectures. [Thesis]. [No school]; 2013. Available from: http://hdl.handle.net/2249.1/62485

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


Wright State University

23. Hiremath, Chaitr. New Heuristic And Metaheuristic Approaches Applied To The Multiple-choice Multidimensional Knapsack Problem.

Degree: PhD, Engineering PhD, 2008, Wright State University

  The knapsack problem has been used to model various decision making processes. Industrial applications find the need for satisfying additional constraints and these necessities… (more)

Subjects/Keywords: Engineering; Industrial Engineering; Operations Research; Multiple-Choice Multidimensional Knapsack Problem; Heuristic; Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hiremath, C. (2008). New Heuristic And Metaheuristic Approaches Applied To The Multiple-choice Multidimensional Knapsack Problem. (Doctoral Dissertation). Wright State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=wright1203960454

Chicago Manual of Style (16th Edition):

Hiremath, Chaitr. “New Heuristic And Metaheuristic Approaches Applied To The Multiple-choice Multidimensional Knapsack Problem.” 2008. Doctoral Dissertation, Wright State University. Accessed April 08, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=wright1203960454.

MLA Handbook (7th Edition):

Hiremath, Chaitr. “New Heuristic And Metaheuristic Approaches Applied To The Multiple-choice Multidimensional Knapsack Problem.” 2008. Web. 08 Apr 2020.

Vancouver:

Hiremath C. New Heuristic And Metaheuristic Approaches Applied To The Multiple-choice Multidimensional Knapsack Problem. [Internet] [Doctoral dissertation]. Wright State University; 2008. [cited 2020 Apr 08]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1203960454.

Council of Science Editors:

Hiremath C. New Heuristic And Metaheuristic Approaches Applied To The Multiple-choice Multidimensional Knapsack Problem. [Doctoral Dissertation]. Wright State University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1203960454


University of California – Berkeley

24. Bhardwaj, Avinash. Binary Conic Quadratic Knapsacks.

Degree: Industrial Engineering & Operations Research, 2015, University of California – Berkeley

 Binary Conic Quadratic Knapsack set is the lower level set of the conic quadratic set functions. They are natural generalizations of linear knapsack sets, and… (more)

Subjects/Keywords: Operations research; Applied mathematics; Conic Quadratic Programming; Knapsack Set; Network Design under Uncertainty; Submodular Functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhardwaj, A. (2015). Binary Conic Quadratic Knapsacks. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/8zj7p436

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

Bhardwaj, Avinash. “Binary Conic Quadratic Knapsacks.” 2015. Thesis, University of California – Berkeley. Accessed April 08, 2020. http://www.escholarship.org/uc/item/8zj7p436.

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

MLA Handbook (7th Edition):

Bhardwaj, Avinash. “Binary Conic Quadratic Knapsacks.” 2015. Web. 08 Apr 2020.

Vancouver:

Bhardwaj A. Binary Conic Quadratic Knapsacks. [Internet] [Thesis]. University of California – Berkeley; 2015. [cited 2020 Apr 08]. Available from: http://www.escholarship.org/uc/item/8zj7p436.

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

Council of Science Editors:

Bhardwaj A. Binary Conic Quadratic Knapsacks. [Thesis]. University of California – Berkeley; 2015. Available from: http://www.escholarship.org/uc/item/8zj7p436

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


Kwame Nkrumah University of Science and Technology

25. Debrah, Philip. Cutting Stock Problem Based on the Linear Programming Approach.

Degree: 2011, Kwame Nkrumah University of Science and Technology

This thesis considers the application of the Cutting Stock Problem based on the Linear Programming Approach. This is applied in the cutting of paper, glass,… (more)

Subjects/Keywords: Linear programming; One-dimensional Cutting Stock Problem; knapsack problem; simplex algorithm; dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Debrah, P. (2011). Cutting Stock Problem Based on the Linear Programming Approach. (Thesis). Kwame Nkrumah University of Science and Technology. Retrieved from http://dspace.knust.edu.gh:8080/jspui/handle/123456789/3915

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

Debrah, Philip. “Cutting Stock Problem Based on the Linear Programming Approach.” 2011. Thesis, Kwame Nkrumah University of Science and Technology. Accessed April 08, 2020. http://dspace.knust.edu.gh:8080/jspui/handle/123456789/3915.

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

MLA Handbook (7th Edition):

Debrah, Philip. “Cutting Stock Problem Based on the Linear Programming Approach.” 2011. Web. 08 Apr 2020.

Vancouver:

Debrah P. Cutting Stock Problem Based on the Linear Programming Approach. [Internet] [Thesis]. Kwame Nkrumah University of Science and Technology; 2011. [cited 2020 Apr 08]. Available from: http://dspace.knust.edu.gh:8080/jspui/handle/123456789/3915.

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

Council of Science Editors:

Debrah P. Cutting Stock Problem Based on the Linear Programming Approach. [Thesis]. Kwame Nkrumah University of Science and Technology; 2011. Available from: http://dspace.knust.edu.gh:8080/jspui/handle/123456789/3915

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


Universidade do Rio Grande do Sul

26. Becker, Henrique. The unbounded knapsack problem : a critical review.

Degree: 2017, Universidade do Rio Grande do Sul

A review of the algorithms and datasets in the literature of the Unbounded Knapsack Problem (UKP) is presented in this master's thesis. The algorithms and… (more)

Subjects/Keywords: Algorítmo; Unbounded knapsack problem; Otimizacao combinatoria; Dynamic programming; Optimization; Cutting stock problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Becker, H. (2017). The unbounded knapsack problem : a critical review. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/163413

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

Becker, Henrique. “The unbounded knapsack problem : a critical review.” 2017. Thesis, Universidade do Rio Grande do Sul. Accessed April 08, 2020. http://hdl.handle.net/10183/163413.

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

MLA Handbook (7th Edition):

Becker, Henrique. “The unbounded knapsack problem : a critical review.” 2017. Web. 08 Apr 2020.

Vancouver:

Becker H. The unbounded knapsack problem : a critical review. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2017. [cited 2020 Apr 08]. Available from: http://hdl.handle.net/10183/163413.

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

Council of Science Editors:

Becker H. The unbounded knapsack problem : a critical review. [Thesis]. Universidade do Rio Grande do Sul; 2017. Available from: http://hdl.handle.net/10183/163413

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

27. Arin, Arif. Incorporating Memory and Learning Mechanisms Into Meta-RaPS.

Degree: PhD, Engineering Management, 2012, Old Dominion University

  Due to the rapid increase of dimensions and complexity of real life problems, it has become more difficult to find optimal solutions using only… (more)

Subjects/Keywords: Estimation of distribution; Knapsack problem; Metaheuristics; Randomized priority search; Artificial Intelligence and Robotics; Operational Research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arin, A. (2012). Incorporating Memory and Learning Mechanisms Into Meta-RaPS. (Doctoral Dissertation). Old Dominion University. Retrieved from 9781267649591 ; https://digitalcommons.odu.edu/emse_etds/37

Chicago Manual of Style (16th Edition):

Arin, Arif. “Incorporating Memory and Learning Mechanisms Into Meta-RaPS.” 2012. Doctoral Dissertation, Old Dominion University. Accessed April 08, 2020. 9781267649591 ; https://digitalcommons.odu.edu/emse_etds/37.

MLA Handbook (7th Edition):

Arin, Arif. “Incorporating Memory and Learning Mechanisms Into Meta-RaPS.” 2012. Web. 08 Apr 2020.

Vancouver:

Arin A. Incorporating Memory and Learning Mechanisms Into Meta-RaPS. [Internet] [Doctoral dissertation]. Old Dominion University; 2012. [cited 2020 Apr 08]. Available from: 9781267649591 ; https://digitalcommons.odu.edu/emse_etds/37.

Council of Science Editors:

Arin A. Incorporating Memory and Learning Mechanisms Into Meta-RaPS. [Doctoral Dissertation]. Old Dominion University; 2012. Available from: 9781267649591 ; https://digitalcommons.odu.edu/emse_etds/37

28. Kubik, Lauren Ashley. Simultaneously lifting multiple sets in binary knapsack integer programs.

Degree: MS, Department of Industrial & Manufacturing Systems Engineering, 2009, Kansas State University

 Integer programs (IPs) are mathematical models that can provide organizations with the ability to optimally obtain their goals through appropriate utilization and allocation of available… (more)

Subjects/Keywords: Integer Program; Knapsack; Sequential Simultaneous Lifting; Lifting Sets; Engineering, Industrial (0546); Operations Research (0796)

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kubik, L. A. (2009). Simultaneously lifting multiple sets in binary knapsack integer programs. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/1460

Chicago Manual of Style (16th Edition):

Kubik, Lauren Ashley. “Simultaneously lifting multiple sets in binary knapsack integer programs.” 2009. Masters Thesis, Kansas State University. Accessed April 08, 2020. http://hdl.handle.net/2097/1460.

MLA Handbook (7th Edition):

Kubik, Lauren Ashley. “Simultaneously lifting multiple sets in binary knapsack integer programs.” 2009. Web. 08 Apr 2020.

Vancouver:

Kubik LA. Simultaneously lifting multiple sets in binary knapsack integer programs. [Internet] [Masters thesis]. Kansas State University; 2009. [cited 2020 Apr 08]. Available from: http://hdl.handle.net/2097/1460.

Council of Science Editors:

Kubik LA. Simultaneously lifting multiple sets in binary knapsack integer programs. [Masters Thesis]. Kansas State University; 2009. Available from: http://hdl.handle.net/2097/1460

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

Degree: 2004, National University of Singapore

Subjects/Keywords: Multiple knapsack problem; Venue assignment problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

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

Council of Science Editors:

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

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


Wayne State University

30. Rampersaud, Safraz. Sharing-Aware Resource Management Algorithms For Virtual Computing Environments.

Degree: PhD, Computer Science, 2016, Wayne State University

  Virtualization technologies in cloud computing are ubiquitous throughout data centers around the world where providers consider operational costs and fast delivery guarantees for a… (more)

Subjects/Keywords: approximation algorithms; multilinear programming; sharing-aware; vector bin-packing; vector knapsack; virtualization; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rampersaud, S. (2016). Sharing-Aware Resource Management Algorithms For Virtual Computing Environments. (Doctoral Dissertation). Wayne State University. Retrieved from https://digitalcommons.wayne.edu/oa_dissertations/1477

Chicago Manual of Style (16th Edition):

Rampersaud, Safraz. “Sharing-Aware Resource Management Algorithms For Virtual Computing Environments.” 2016. Doctoral Dissertation, Wayne State University. Accessed April 08, 2020. https://digitalcommons.wayne.edu/oa_dissertations/1477.

MLA Handbook (7th Edition):

Rampersaud, Safraz. “Sharing-Aware Resource Management Algorithms For Virtual Computing Environments.” 2016. Web. 08 Apr 2020.

Vancouver:

Rampersaud S. Sharing-Aware Resource Management Algorithms For Virtual Computing Environments. [Internet] [Doctoral dissertation]. Wayne State University; 2016. [cited 2020 Apr 08]. Available from: https://digitalcommons.wayne.edu/oa_dissertations/1477.

Council of Science Editors:

Rampersaud S. Sharing-Aware Resource Management Algorithms For Virtual Computing Environments. [Doctoral Dissertation]. Wayne State University; 2016. Available from: https://digitalcommons.wayne.edu/oa_dissertations/1477

[1] [2] [3] [4]

.