Find all needed information about The Quadratic 0 1 Knapsack Problem With Series Parallel Support. Below you can see links where you can find everything you want to know about The Quadratic 0 1 Knapsack Problem With Series Parallel Support.
https://www.sciencedirect.com/science/article/pii/S0167637702001220
We consider various special cases of the quadratic 0–1 knapsack problem (QKP) for which the underlying graph structure is fairly simple. For the variant with edge series–parallel graphs, we give a dynamic programming algorithm with pseudo-polynomial time complexity, and a fully polynomial time approximation scheme.Cited by: 59
https://www.researchgate.net/publication/222196732_The_quadratic_0-1_knapsack_problem_with_series-parallel_support
We consider various special cases of the quadratic 0–1 knapsack problem (QKP) for which the underlying graph structure is fairly simple. For the variant with edge series–parallel graphs, we ...
https://en.wikipedia.org/wiki/0-1_quadratic_knapsack_problem
This special type of QKP forms the 0-1 quadratic knapsack problem, which was first discussed by Gallo et al. The 0-1 quadratic knapsack problem is a variation of knapsack problems, combining the features of unbounded knapsack problem, 0-1 …
https://core.ac.uk/display/11478228
The quadratic 0–1 knapsack problem with series–parallel support . By David J. Rader Jr and Gerhard J. Woeginger. Abstract. We consider various special cases of the quadratic 0–1 knapsack problem (QKP) for which the underlying graph structure is fairly simple. For the variant with edge series–parallel graphs, we give a dynamic ...Author: David J. Rader Jr and Gerhard J. Woeginger
https://research.utwente.nl/en/publications/the-quadratic-0-1-knapsack-problem-with-series-parallel-support
We consider various special cases of the quadratic 0–1 knapsack problem (QKP) for which the underlying graph structure is fairly simple. For the variant with edge series–parallel graphs, we give a dynamic programming algorithm with pseudo-polynomial time complexity, and a fully polynomial time approximation scheme.Cited by: 59
https://www.rose-hulman.edu/academics/faculty/rader-david-rader.html
Dr. David Rader specializes in operations research, linear and discrete optimization, and sports scheduling. He has authored or co-authored eight journal articles, 27 conference presentations and the textbook, Deterministic Operations Research: Models and …
https://dl.acm.org/citation.cfm?id=1225555
The binary quadratic knapsack problem maximizes a quadratic objective function subject to a linear capacity constraint. Due to its simple structure and challenging difficulty it has been studied intensively during the last two decades.Cited by: 193
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2F8f9cb5a4-7e51-4173-a7e1-6b782d412e15
The quadratic 0-1 knapsack problem with series-parallel support (2002) Pagina-navigatie: Main; Save publication. Save as MODS; Export to Mendeley; Save as EndNote; Export to RefWorks; Title: The quadratic 0-1 knapsack problem with series-parallel support: Published in: Operations Research Letters, Vol. 30, No. 3, p.159-166. ISSN 0167-6377 ...Cited by: 59
Need to find The Quadratic 0 1 Knapsack Problem With Series Parallel Support information?
To find needed information please read the text beloow. If you need to know more you can click on the links to visit sites with more detailed data.
