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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Annals of operations research Ročník 279; číslo 1-2; s. 367 - 386
Hlavní autoři:	Elbassioni, Khaled, Karapetyan, Areg, Nguyen, Trung Thanh
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.08.2019 Springer Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!