Relevant bibliographies by topics / Unbounded knapsack problem

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Unbounded knapsack problem'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Unbounded knapsack problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Unbounded knapsack problem"

1

Yang, Yang. "An Improved Unbounded-DP Algorithm for the Unbounded Knapsack Problem with Bounded Coefficients." Mathematics 12, no. 12 (2024): 1878. http://dx.doi.org/10.3390/math12121878.

Full text
Abstract:
Benchmark instances for the unbounded knapsack problem are typically generated according to specific criteria within a given constant range R, and these instances can be referred to as the unbounded knapsack problem with bounded coefficients (UKPB). In order to increase the difficulty of solving these instances, the knapsack capacity C is usually set to a very large value. While current efficient algorithms primarily center on the Fast Fourier Transform (FFT) and (min,+)-convolution method, there is a simpler method worth considering. In this paper, based on the basic Unbounded-DP algorithm, w
APA, Harvard, Vancouver, ISO, and other styles
2

Andonov, R., V. Poirriez, and S. Rajopadhye. "Unbounded knapsack problem: Dynamic programming revisited." European Journal of Operational Research 123, no. 2 (2000): 394–407. http://dx.doi.org/10.1016/s0377-2217(99)00265-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Poirriez, Vincent, Nicola Yanev, and Rumen Andonov. "A hybrid algorithm for the unbounded knapsack problem." Discrete Optimization 6, no. 1 (2009): 110–24. http://dx.doi.org/10.1016/j.disopt.2008.09.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jansen, Klaus, and Stefan E. J. Kraft. "A faster FPTAS for the Unbounded Knapsack Problem." European Journal of Combinatorics 68 (February 2018): 148–74. http://dx.doi.org/10.1016/j.ejc.2017.07.016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Huang, Ping H., and Kwei Tang. "A constructive periodicity bound for the unbounded knapsack problem." Operations Research Letters 40, no. 5 (2012): 329–31. http://dx.doi.org/10.1016/j.orl.2012.05.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Büther, Marcel, and Dirk Briskorn. "Reducing the 0-1 Knapsack Problem with a Single Continuous Variable to the Standard 0-1 Knapsack Problem." International Journal of Operations Research and Information Systems 3, no. 1 (2012): 1–12. http://dx.doi.org/10.4018/joris.2012010101.

Full text
Abstract:
The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable. This variable might be unbounded or restricted by a lower or upper bound, respectively. This paper concerns techniques in order to reduce several variants of KPC to KP which enables the authors to employ approaches for KP. The authors propose both, an equivalent reformulation and a heuristic one bringing along less computational effort. The authors show that the he
APA, Harvard, Vancouver, ISO, and other styles
7

Hiroshi, IIDA. "Two Topics in Dominance Relations for the Unbounded Knapsack Problem." Open Applied Mathematics Journal 2, no. 1 (2008): 16–19. http://dx.doi.org/10.2174/1874114200802010016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

He, Xueqi, Joseph C. Hartman, and Panos M. Pardalos. "Dynamic-Programming-Based Inequalities for the Unbounded Integer Knapsack Problem." Informatica 27, no. 2 (2016): 433–50. http://dx.doi.org/10.15388/informatica.2016.93.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zukerman, Moshe, Long Jia, Timothy Neame, and Gerhard J. Woeginger. "A polynomially solvable special case of the unbounded knapsack problem." Operations Research Letters 29, no. 1 (2001): 13–16. http://dx.doi.org/10.1016/s0167-6377(01)00076-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Huang, Ping H., Mark Lawley, and Thomas Morin. "Tight bounds for periodicity theorems on the unbounded Knapsack problem." European Journal of Operational Research 215, no. 2 (2011): 319–24. http://dx.doi.org/10.1016/j.ejor.2011.06.010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Unbounded knapsack problem"

1

Becker, Henrique. "The unbounded knapsack problem : a critical review." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/163413.

Full text
Abstract:
Uma revisão dos algoritmos e conjuntos de instâncias presentes na literatura do Problema da Mochila com Repetições (PMR) é apresentada nessa dissertação de mestrado. Os algoritmos e conjuntos de instâncias usados são brevemente descritos nesse trabalho, afim de que o leitor tenha base para entender as discussões. Algumas propriedades bem conhecidas e específicas do PMR, como a dominância e a periodicidade, são explicadas com detalhes. O PMR é também superficialmente estudado no contexto de problemas de avaliação gerados pela abordagem de geração de colunas aplicada na relaxação contínua do Bin
APA, Harvard, Vancouver, ISO, and other styles
2

Iyer, Swarna Chitra. "A complementary heuristic for the unbounded knapsack problem." Thesis, 1997. https://vuir.vu.edu.au/17924/.

Full text
Abstract:
As a solution algorithm for Unbounded Knapsack Problem, the performance analysis of density-ordered greedy heuristic, weight-ordered greedy heuristic, value-ordered greedy heuristic, extended greedy heuristic and total-value heuristic has been done. Empirical experiments on different test problems have been analysed and reported. Problem instances with a very large number of undominated items were generated in addition to the types of instances suggested by Martello and Toth (1990). Theoretically, the lower bound on the performance for total-value heuristic is better than the correspon
APA, Harvard, Vancouver, ISO, and other styles
3

Lin, Ming-Hsien, and 林明賢. "A Study on Solving Unbounded Knapsack Problem Base on Quantum Genetic Algorithm." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/34361020833188655774.

Full text
Abstract:
碩士<br>朝陽科技大學<br>資訊管理系碩士班<br>97<br>Resource distribution, capital budgeting, investment decision and transportation question could form as knapsack question models. Knapsack problem is one kind of NP-Complete problem and Unbounded Knapsack problems (UKP) are more complex and harder than general Knapsack problems. In this paper, we apply QGAs (Quantum Genetic Algorithms) to solve Unbounded Knapsack Problem. First, present the problem into the mode of QGAs and figure out the corresponding genes types and their fitness functions. Then, find the perfect combination of limitation and largest benefit
APA, Harvard, Vancouver, ISO, and other styles
4

Jian, Cheng-Huei, and 簡程輝. "A study on Solving Unbounded Knapsack Problem Based on Adaptive Genetic Algorithm." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/16649717016724242659.

Full text
Abstract:
碩士<br>朝陽科技大學<br>資訊管理系碩士班<br>95<br>The Knapsack problem is an NP-Complete problem. Unbounded Knapsack problems are more complex and harder to solve than the general Knapsack problem. In this thesis, we apply the genetic algorithm using adaptive mechanism which includes greedy method to arrange the chromosomes and automatically adapt the runs to solve the unbounded Knapsack problem. In reproduction procedure, we use elitism strategy to select new offspring. The elitism strategy is utilized to overcome the defect of the slow convergence rate of the general genetic algorithm. The elitism strategy
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Unbounded knapsack problem"

1

Kellerer, Hans, Ulrich Pferschy, and David Pisinger. "The Unbounded Knapsack Problem." In Knapsack Problems. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24777-7_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jiang, Zhihao, and Haoyu Zhao. "An FPTAS for Stochastic Unbounded Min-Knapsack Problem." In Frontiers in Algorithmics. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-18126-0_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jansen, Klaus, and Stefan E. J. Kraft. "A Faster FPTAS for the Unbounded Knapsack Problem." In Lecture Notes in Computer Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-29516-9_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chen, Rung-Ching, Yun-Hou Huang, and Ming-Hsien Lin. "Solving Unbounded Knapsack Problem Based on Quantum Genetic Algorithms." In Intelligent Information and Database Systems. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12145-6_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Becker, Henrique, and Luciana S. Buriol. "UKP5: A New Algorithm for the Unbounded Knapsack Problem." In Experimental Algorithms. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-38851-9_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Khandekar, Aayush P., and Aniket Nargundkar. "Dynamic Programming Approach to Solve Real-World Application of Multi-Objective Unbounded Knapsack Problem." In Lecture Notes in Electrical Engineering. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-6581-4_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Unbounded knapsack problem"

1

Becker, Henrique, and Luciana S. Buriol. "UKP5: Solving the Unbounded Knapsack Problem." In I Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2016.9835.

Full text
Abstract:
Nesse resumo extendido nós apresentamos o UKP5, um algoritmo para solucionar o unbounded knapsack problem (problema da mochila com repetições). O UKP5 é baseado em programação dinâmica, mas implementado de uma forma não-tradicional: ao invés de olhar para trás para usar soluções de subproblemas previamente computados, ele armazena limites inferiores a frente. O UKP5 é consideravelmente mais simples que o EDUK2, o algoritmo do estado da arte para solucionar o problema. Nós executamos o UKP5 e o EDUK2 em uma bateria de testes contendo 4540 instâncias consideradas difíceis pelos autores do EDUK2.
APA, Harvard, Vancouver, ISO, and other styles
2

Saravanarajan, Vani Suthamathi, Rung-Ching Chen, Christine Dewi, and Long Shen Chen. "Montecarlo Approach For Solving Unbound Knapsack Problem." In MISNC2020&IEMT2020: The 7th Multidisciplinary in International Social Networks Conference and The 3rd International Conference on Economics, Management and Technology. ACM, 2020. http://dx.doi.org/10.1145/3429395.3429402.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Unbounded knapsack problem' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography