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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Annals of operations research Jg. 279; H. 1-2; S. 367 - 386
Hauptverfasser:	Elbassioni, Khaled, Karapetyan, Areg, Nguyen, Trung Thanh
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.08.2019 Springer Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!