Approximation schemes for r-weighted Minimization Knapsack problems

Stimulated by salient applications arising from power systems, this paper studies a class of non-linear Knapsack problems with non-separable quadratic constrains, formulated in either binary or integer form. These problems resemble the duals of the corresponding variants of 2-weighted Knapsack probl...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of operations research Vol. 279; no. 1-2; pp. 367 - 386
Main Authors:	Elbassioni, Khaled, Karapetyan, Areg, Nguyen, Trung Thanh
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2019 Springer Springer Nature B.V
Subjects:	Approximation Approximation theory Boolean algebra Business and Management Combinatorics Computer simulation Greedy algorithms Knapsack problem Linear programming Mathematical research Nonlinear theories Operations research Operations Research/Decision Theory Optimization Original Research Polynomials Smart grid Theory of Computation United Arab Emirates Power generation planning Economic dispatch control Quasi polynomial-time approximation scheme Weighted Minimization Knapsack Polynomial-time approximation scheme Smart grid
ISSN:	0254-5330, 1572-9338
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!