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žené v:
Podrobná bibliografia
Vydané v:Annals of operations research Ročník 279; číslo 1-2; s. 367 - 386
Hlavní autori: Elbassioni, Khaled, Karapetyan, Areg, Nguyen, Trung Thanh
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.08.2019
Springer
Springer Nature B.V
Predmet:
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 prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract 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 problem (a.k.a., complex-demand Knapsack problem) which has been studied in the extant literature under the paradigm of smart grids. Nevertheless, the employed techniques resulting in a polynomial-time approximation scheme (PTAS) for the 2-weighted Knapsack problem are not amenable to its minimization version. We instead propose a greedy geometry-based approach that arrives at a quasi PTAS (QPTAS) for the minimization variant with boolean variables. As for the integer formulation, a linear programming-based method is developed that obtains a PTAS. In view of the curse of dimensionality, fast greedy heuristic algorithms are presented, additionally to QPTAS. Their performance is corroborated extensively by empirical simulations under diverse settings and scenarios.
AbstractList 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 problem (a.k.a., complex-demand Knapsack problem) which has been studied in the extant literature under the paradigm of smart grids. Nevertheless, the employed techniques resulting in a polynomial-time approximation scheme (PTAS) for the 2-weighted Knapsack problem are not amenable to its minimization version. We instead propose a greedy geometry-based approach that arrives at a quasi PTAS (QPTAS) for the minimization variant with boolean variables. As for the integer formulation, a linear programming-based method is developed that obtains a PTAS. In view of the curse of dimensionality, fast greedy heuristic algorithms are presented, additionally to QPTAS. Their performance is corroborated extensively by empirical simulations under diverse settings and scenarios.
Audience Academic
Author Karapetyan, Areg
Elbassioni, Khaled
Nguyen, Trung Thanh
Author_xml – sequence: 1
  givenname: Khaled
  surname: Elbassioni
  fullname: Elbassioni, Khaled
  organization: Masdar Institute, Khalifa University of Science and Technology
– sequence: 2
  givenname: Areg
  surname: Karapetyan
  fullname: Karapetyan, Areg
  organization: Masdar Institute, Khalifa University of Science and Technology
– sequence: 3
  givenname: Trung Thanh
  surname: Nguyen
  fullname: Nguyen, Trung Thanh
  email: ttnguyen.cs@gmail.com
  organization: Hai Phong University
BookMark eNp9kV9vFCEUxYmpidvqB_BtEl-l3jsMAzxuNv5prPGl74QysKXuMCt3Nlo_vazTpNaokEBCzu8ecs4pO8lTDoy9RDhHAPWGEDplOKDmAhG5ecJWKFXLjRD6hK2glR2XQsAzdkp0CwCIWq7YZr3fl-l7Gt2cptyQvwljoCZOpSn8W0jbmzkMzaeU05h-LJqP2e3J-S9NBa93YaTn7Gl0Owov7u8zdvXu7dXmA7_8_P5is77kvmth5mpw0YMWwUQNvY6DlnrolfLBd0oixj4qhxqEc6Kva2glRhh6AWbwyokz9moZW32_HgLN9nY6lFwdbYsSTIcS1YNq63bBphynuTg_JvJ2LU1vUCgQVXX-F1XdQxiTr9HGVN8fAa9_A64PlHKgetAxIdq6A9FjOS5yXyaiEqLdl5pxubMI9liYXQqztTB7LMyayqg_GJ_mX5HXv6Xdf8l2Iam65G0oD8n8G_oJgBup5g
CitedBy_id crossref_primary_10_1016_j_cor_2021_105693
crossref_primary_10_1016_j_disopt_2023_100771
crossref_primary_10_1007_s10479_022_05054_y
crossref_primary_10_1016_j_orl_2021_06_017
crossref_primary_10_1080_21681015_2022_2052195
Cites_doi 10.1145/2955089
10.1016/j.dam.2017.06.020
10.1109/TSG.2016.2616945
10.1145/320211.320240
10.1007/s10288-011-0180-x
10.1016/S0167-6377(02)00122-0
10.1287/ijoc.12.1.57.11901
10.1016/0304-3975(76)90048-7
10.1007/978-3-540-24777-7
10.1137/0221060
10.1016/S0377-2217(01)00179-5
10.1007/s00453-008-9248-1
ContentType Journal Article
Copyright Springer Science+Business Media, LLC, part of Springer Nature 2018
COPYRIGHT 2019 Springer
Annals of Operations Research is a copyright of Springer, (2018). All Rights Reserved.
Copyright_xml – notice: Springer Science+Business Media, LLC, part of Springer Nature 2018
– notice: COPYRIGHT 2019 Springer
– notice: Annals of Operations Research is a copyright of Springer, (2018). All Rights Reserved.
DBID AAYXX
CITATION
N95
3V.
7TA
7TB
7WY
7WZ
7XB
87Z
88I
8AL
8AO
8FD
8FE
8FG
8FK
8FL
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FR3
FRNLG
F~G
GNUQQ
HCIFZ
JG9
JQ2
K60
K6~
K7-
KR7
L.-
L6V
M0C
M0N
M2P
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOI 10.1007/s10479-018-3111-9
DatabaseName CrossRef
Gale Business: Insights
ProQuest Central (Corporate)
Materials Business File
Mechanical & Transportation Engineering Abstracts
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Science Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
Technology Collection
ProQuest One Community College
ProQuest Central
Engineering Research Database
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
SciTech Premium Collection
Materials Research Database
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
Civil Engineering Abstracts
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ABI/INFORM Global
Computing Database
Science Database
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business (UW System Shared)
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
ProQuest Central Basic
DatabaseTitle CrossRef
Materials Research Database
ProQuest Business Collection (Alumni Edition)
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest Central China
ABI/INFORM Complete
Materials Business File
ProQuest One Applied & Life Sciences
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest Business Collection
ProQuest One Academic UKI Edition
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
Technology Research Database
ProQuest One Academic Middle East (New)
Mechanical & Transportation Engineering Abstracts
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Pharma Collection
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Central Korea
ABI/INFORM Complete (Alumni Edition)
Civil Engineering Abstracts
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList
Materials Research Database
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
EISSN 1572-9338
EndPage 386
ExternalDocumentID A596913703
10_1007_s10479_018_3111_9
GeographicLocations United Arab Emirates
GeographicLocations_xml – name: United Arab Emirates
GroupedDBID -4X
-57
-5G
-BR
-EM
-~C
-~X
.4S
.86
.DC
.VR
06D
0R~
0VY
1N0
203
23M
2J2
2JN
2JY
2KG
2KM
2LR
2~H
30V
4.4
406
408
409
40D
40E
5GY
5VS
67Z
6NX
7WY
88I
8AO
8FE
8FG
8FL
8TC
8VB
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABUWG
ABWNU
ABXPI
ACAOD
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADTPH
ADURQ
ADYFF
ADZKW
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHQJS
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJRNO
AJZVZ
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYQZM
AZFZN
AZQEC
B-.
BA0
BAPOH
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CCPQU
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DWQXO
EBLON
EBO
EBS
EBU
EDO
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ6
GQ7
GQ8
GROUPED_ABI_INFORM_COMPLETE
GROUPED_ABI_INFORM_RESEARCH
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I-F
I09
IAO
IEA
IHE
IJ-
IKXTQ
ITC
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K1G
K60
K6V
K6~
K7-
KDC
KOV
L6V
LAK
LLZTM
M0C
M0N
M2P
M4Y
M7S
MA-
N95
N9A
NB0
NPVJJ
NQJWS
NU0
O93
O9G
O9I
O9J
OAM
P19
P2P
P62
P9M
PF0
PQBIZ
PQBZA
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
QWB
R89
R9I
RHV
RNS
ROL
RPX
RSV
S16
S27
S3B
SAP
SBE
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TH9
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
Z5O
Z7R
Z7S
Z7U
Z7V
Z7W
Z7X
Z7Y
Z7Z
Z81
Z83
Z88
Z8N
Z8U
Z92
ZL0
ZMTXR
~8M
~A9
~EX
-Y2
1SB
2.D
28-
2P1
2VQ
5QI
AAPKM
AARHV
AAYTO
AAYXX
ABBRH
ABDBE
ABFSG
ABQSL
ABRTQ
ABULA
ACBXY
ACSTC
ADHKG
ADKFA
ADRFC
AEBTG
AEFIE
AEKMD
AEZWR
AFDZB
AFEXP
AFFHD
AFGCZ
AFHIU
AFOHR
AGGDS
AGJBK
AGQPQ
AHKAY
AHPBZ
AHWEU
AIXLP
AJBLW
AMVHM
ATHPR
AYFIA
BBWZM
CAG
CITATION
COF
ICD
KOW
N2Q
NDZJH
O9-
OVD
PHGZM
PHGZT
PQGLB
R4E
RNI
RZC
RZD
RZK
S1Z
S26
S28
SCF
SCLPG
T16
TEORI
ZYFGU
3V.
7TA
7TB
7XB
8AL
8FD
8FK
FR3
JG9
JQ2
KR7
L.-
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c420t-7dafc083e9f8068fd858d677cec47511f6f7a1803aa36666d251f0d6309dc7a3
IEDL.DBID K7-
ISICitedReferencesCount 6
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000482221000014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0254-5330
IngestDate Wed Nov 05 14:39:53 EST 2025
Sat Nov 29 13:14:54 EST 2025
Sat Nov 29 10:24:14 EST 2025
Sat Nov 29 08:54:04 EST 2025
Tue Nov 18 22:31:40 EST 2025
Sat Nov 29 02:36:37 EST 2025
Fri Feb 21 02:37:01 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1-2
Keywords Power generation planning
Economic dispatch control
Quasi polynomial-time approximation scheme
Weighted Minimization Knapsack
Polynomial-time approximation scheme
Smart grid
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c420t-7dafc083e9f8068fd858d677cec47511f6f7a1803aa36666d251f0d6309dc7a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2150941517
PQPubID 25585
PageCount 20
ParticipantIDs proquest_journals_2150941517
gale_infotracmisc_A596913703
gale_infotracacademiconefile_A596913703
gale_businessinsightsgauss_A596913703
crossref_primary_10_1007_s10479_018_3111_9
crossref_citationtrail_10_1007_s10479_018_3111_9
springer_journals_10_1007_s10479_018_3111_9
PublicationCentury 2000
PublicationDate 2019-08-01
PublicationDateYYYYMMDD 2019-08-01
PublicationDate_xml – month: 08
  year: 2019
  text: 2019-08-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Annals of operations research
PublicationTitleAbbrev Ann Oper Res
PublicationYear 2019
Publisher Springer US
Springer
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer
– name: Springer Nature B.V
References Chau, Elbassioni, Khonji (CR4) 2016; 5
Nemhauser, Wolsey (CR16) 1999
CR5
Renegar (CR18) 1992; 21
Schrijver (CR19) 1986
Rader, Woeginger (CR20) 2002; 30
CR17
Csirik, Frenk, Labbé, Zhang (CR6) 1991; 10
CR9
Ibaraki, Katoh (CR10) 1988
Kellerer, Pferschy, Pisinger (CR12) 2004
CR15
CR23
Karapetyan, Khonji, Chau, Elbassioni, Zeineldin (CR11) 2018; 9
Garey, Johnson (CR8) 1979
Wood, Wollenberg (CR22) 2012
Kellerer, Strusevich (CR14) 2012; 10
Basu (CR1) 1999; 46
Elbassioni, Nguyen (CR7) 2017; 230
Kellerer, Strusevich (CR13) 2010; 57
Chandra, Hirschberg, Wong (CR3) 1976; 3
Woeginger (CR21) 2000; 12
Bretthauer, Shetty (CR2) 2002; 138
AK Chandra (3111_CR3) 1976; 3
3111_CR9
H Kellerer (3111_CR14) 2012; 10
KM Elbassioni (3111_CR7) 2017; 230
GJ Woeginger (3111_CR21) 2000; 12
J Csirik (3111_CR6) 1991; 10
H Kellerer (3111_CR12) 2004
S Basu (3111_CR1) 1999; 46
GL Nemhauser (3111_CR16) 1999
J Renegar (3111_CR18) 1992; 21
3111_CR5
H Kellerer (3111_CR13) 2010; 57
KM Bretthauer (3111_CR2) 2002; 138
3111_CR15
DJ Rader Jr (3111_CR20) 2002; 30
T Ibaraki (3111_CR10) 1988
3111_CR17
M Garey (3111_CR8) 1979
3111_CR23
A Schrijver (3111_CR19) 1986
C Chau (3111_CR4) 2016; 5
AJ Wood (3111_CR22) 2012
A Karapetyan (3111_CR11) 2018; 9
References_xml – volume: 5
  start-page: 7:1
  issue: 1
  year: 2016
  end-page: 7:29
  ident: CR4
  article-title: Truthful mechanisms for combinatorial allocation of electric power in alternating current electric systems for smart grid
  publication-title: ACM Transactions on Economics and Computation
  doi: 10.1145/2955089
– year: 1988
  ident: CR10
  publication-title: Resource allocation problems
– volume: 230
  start-page: 56
  year: 2017
  end-page: 70
  ident: CR7
  article-title: Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
  publication-title: Discrete Applied Mathematics
  doi: 10.1016/j.dam.2017.06.020
– volume: 9
  start-page: 2714
  issue: 4
  year: 2018
  end-page: 2725
  ident: CR11
  article-title: Efficient algorithm for scalable event-based demand response management in microgrids
  publication-title: IEEE Transactions on Smart Grid
  doi: 10.1109/TSG.2016.2616945
– volume: 46
  start-page: 537
  issue: 4
  year: 1999
  end-page: 555
  ident: CR1
  article-title: New results on quantifier elimination over real closed fields and applications to constraint databases
  publication-title: Journal of the ACM
  doi: 10.1145/320211.320240
– volume: 10
  start-page: 111
  issue: 2
  year: 2012
  end-page: 161
  ident: CR14
  article-title: The symmetric quadratic knapsack problem: approximation and scheduling applications
  publication-title: 4OR
  doi: 10.1007/s10288-011-0180-x
– year: 1986
  ident: CR19
  publication-title: Theory of linear and integer programming
– ident: CR15
– volume: 10
  start-page: 15
  issue: 1–2
  year: 1991
  end-page: 20
  ident: CR6
  article-title: Heuristic for the 0–1 min-knapsack problem
  publication-title: Acta Cybernetica
– volume: 30
  start-page: 159
  issue: 3
  year: 2002
  end-page: 166
  ident: CR20
  article-title: The quadratic 0–1 knapsack problem with series-parallel support
  publication-title: Operations Research Letters
  doi: 10.1016/S0167-6377(02)00122-0
– ident: CR17
– volume: 12
  start-page: 57
  issue: 1
  year: 2000
  end-page: 74
  ident: CR21
  article-title: When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?
  publication-title: INFORMS Journal on Computing
  doi: 10.1287/ijoc.12.1.57.11901
– volume: 3
  start-page: 293
  issue: 3
  year: 1976
  end-page: 304
  ident: CR3
  article-title: Approximate algorithms for some generalized knapsack problems
  publication-title: Theoretical Computer Science
  doi: 10.1016/0304-3975(76)90048-7
– ident: CR9
– year: 2012
  ident: CR22
  publication-title: Power generation, operation, and control
– ident: CR5
– year: 1999
  ident: CR16
  publication-title: Integer and combinatorial optimization
– year: 2004
  ident: CR12
  publication-title: Knapsack problems
  doi: 10.1007/978-3-540-24777-7
– volume: 21
  start-page: 1008
  issue: 6
  year: 1992
  end-page: 1025
  ident: CR18
  article-title: On the computational complexity of approximating solutions for real algebraic formulae
  publication-title: SIAM Journal on Computing
  doi: 10.1137/0221060
– volume: 138
  start-page: 459
  issue: 3
  year: 2002
  end-page: 472
  ident: CR2
  article-title: The nonlinear knapsack problem—Algorithms and applications
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(01)00179-5
– volume: 57
  start-page: 769
  issue: 4
  year: 2010
  end-page: 795
  ident: CR13
  article-title: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
  publication-title: Algorithmica
  doi: 10.1007/s00453-008-9248-1
– ident: CR23
– year: 1979
  ident: CR8
  publication-title: Computers and intractability: A guide to the theory of NP-completeness
– volume: 5
  start-page: 7:1
  issue: 1
  year: 2016
  ident: 3111_CR4
  publication-title: ACM Transactions on Economics and Computation
  doi: 10.1145/2955089
– ident: 3111_CR15
– volume: 10
  start-page: 15
  issue: 1–2
  year: 1991
  ident: 3111_CR6
  publication-title: Acta Cybernetica
– volume-title: Resource allocation problems
  year: 1988
  ident: 3111_CR10
– ident: 3111_CR23
– volume-title: Power generation, operation, and control
  year: 2012
  ident: 3111_CR22
– volume-title: Integer and combinatorial optimization
  year: 1999
  ident: 3111_CR16
– volume: 230
  start-page: 56
  year: 2017
  ident: 3111_CR7
  publication-title: Discrete Applied Mathematics
  doi: 10.1016/j.dam.2017.06.020
– volume: 10
  start-page: 111
  issue: 2
  year: 2012
  ident: 3111_CR14
  publication-title: 4OR
  doi: 10.1007/s10288-011-0180-x
– volume: 21
  start-page: 1008
  issue: 6
  year: 1992
  ident: 3111_CR18
  publication-title: SIAM Journal on Computing
  doi: 10.1137/0221060
– volume: 138
  start-page: 459
  issue: 3
  year: 2002
  ident: 3111_CR2
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(01)00179-5
– ident: 3111_CR5
– volume: 9
  start-page: 2714
  issue: 4
  year: 2018
  ident: 3111_CR11
  publication-title: IEEE Transactions on Smart Grid
  doi: 10.1109/TSG.2016.2616945
– volume: 12
  start-page: 57
  issue: 1
  year: 2000
  ident: 3111_CR21
  publication-title: INFORMS Journal on Computing
  doi: 10.1287/ijoc.12.1.57.11901
– volume-title: Computers and intractability: A guide to the theory of NP-completeness
  year: 1979
  ident: 3111_CR8
– volume: 57
  start-page: 769
  issue: 4
  year: 2010
  ident: 3111_CR13
  publication-title: Algorithmica
  doi: 10.1007/s00453-008-9248-1
– volume: 46
  start-page: 537
  issue: 4
  year: 1999
  ident: 3111_CR1
  publication-title: Journal of the ACM
  doi: 10.1145/320211.320240
– volume: 30
  start-page: 159
  issue: 3
  year: 2002
  ident: 3111_CR20
  publication-title: Operations Research Letters
  doi: 10.1016/S0167-6377(02)00122-0
– ident: 3111_CR9
– volume: 3
  start-page: 293
  issue: 3
  year: 1976
  ident: 3111_CR3
  publication-title: Theoretical Computer Science
  doi: 10.1016/0304-3975(76)90048-7
– volume-title: Knapsack problems
  year: 2004
  ident: 3111_CR12
  doi: 10.1007/978-3-540-24777-7
– volume-title: Theory of linear and integer programming
  year: 1986
  ident: 3111_CR19
– ident: 3111_CR17
SSID ssj0001185
Score 2.282393
Snippet Stimulated by salient applications arising from power systems, this paper studies a class of non-linear Knapsack problems with non-separable quadratic...
SourceID proquest
gale
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 367
SubjectTerms 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
SummonAdditionalLinks – databaseName: SpringerLink Contemporary
  dbid: RSV
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dSxwxEB-sSrEPVa8Vr1XJg6VQCey6u_l4PKQiiFKqiG9hLsmWQ28rl9P2z-9kL6teWwv1JS-Z3U1mM5PfJPMBsCsQS-uqgjtdIY_ZX_jQiiFZrVbXWYZ5Vau22IQ8PVWXl_pLiuMOnbd7dyXZaupHwW6ljL498Twvz7l-AUu026kojV_PLu7VLyHm1m-RLB8eXSe7q8y_vWJuM_pdJf9xN9puOYerzxrsGrxOCJMNZktiHRZ804OXnYN7D1a7Qg4syXUPXj3KSvgGDgYxz_jP0SyokZH568c-MEK3bMJ_tEep3rGTUTMapyBOdtzgTUB7xVJ9mvAWzg8_nx8c8VRrgdtyP5ty6bC2BMe8rlUmVO1UpZyQ0npbSgJltagl5iorEAuyeIQjXFRnThSZdlZisQGLzffGbwIrcJj73O-XshClR8Tclwqlo6aqrB32Iet4bmzKQx7LYVybhwzKkXmGmGci84zuw6f7R25mSTj-Rfwh_kiTinhSEyJjwje8DcEMKi10XpCe68PHli4KMn3fYopHoFnElFhzlFtzlCSAdr67WzImKYBgCEmR4UxwSvZhr1siD91Pjv7df1G_hxUCcHrmkLgFi9PJrd-GZXs3HYXJTisXvwBuyAXE
  priority: 102
  providerName: Springer Nature
Title Approximation schemes for r-weighted Minimization Knapsack problems
URI https://link.springer.com/article/10.1007/s10479-018-3111-9
https://www.proquest.com/docview/2150941517
Volume 279
WOSCitedRecordID wos000482221000014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: Springer LINK
  customDbUrl:
  eissn: 1572-9338
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001185
  issn: 0254-5330
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpR3LbhMxcERbhMqBQgARKJEPICSQVXtfXp9QiFohVY2itoLCxXJsL4potyFOgc9nvOttCIheuMzF3l2v5-GZ8TwAXhRaZ8bmKbUy1zRUf6FTU0zRajWyYkzzvCqbZhNiPC7PzuQkOtx8DKvsZGIjqO2lCT7yPTya0BLB80m8nX-joWtUuF2NLTQ2YIsnCQ90fijotSRG5bkJYUQjiIYoyu5Ws02dy0SIFAreQc6pXDuX_pTOf12TNqfPwc7_rvs-3It6Jxm2hPIAbrm6B3e6sPce7HTtHUjk9h7c_a1W4UMYDUP18Z-zNtWRoFHsLpwnqPOSBf3ROFidJUezenYRUzvJYa3nXpuvJHat8Y_g9GD_dPSexg4M1GQJW1JhdWVQSXOyKllRVrbMS1sIYZzJBKpqVVEJzUuWap2iHVRY1JYqZouUSWuETh_DZn1ZuydAUj3ljrskE2mROa01d1mphUWQ58ZM-8C67VcmVicPTTLO1aqucsCYQoypgDEl-_D6-pF5W5rjpskvA05VbO2JwIeN8V_0lfdqmMtC8hSlXx9eNfMCe-P3jY5ZCvgXoVDW2szdtZnIlmZ9uKMHFcWCVyti6MObjqJWw_9c_dObX_YMtlGPk21c4i5sLhdX7jncNt-XM78YwIb4-GkAW-_2x5PjQcMhCI_YKMBkEqA4QTjJPyM8PvnwC5DyF34
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3Nb9MwFH8aA8E4MCggCgN8YEJisnCaxI4PCFWFaVO3ikMPu1mu7aAKlpW6-_qj-B95TpyVgthtBy65-MWJ7Z_fh_0-AN5wrTNj85RamWsasr_QieETtFqNLBnTSV4WdbEJMRoVR0fyyxr8bGNhgltlyxNrRm1PTDgjf4-iCS0RlE_i4-wHDVWjwu1qW0KjgcXQXZ6jyeY_7H_C9d3u9XY_jwd7NFYVoCbrsQUVVpcGFQ8ny4LxorRFXlguhHEmE6h-lLwUOilYqnWKuj23qAGUzPKUSWuETrHbW3A7y3A3BE9BNrhi_Kir1x6TaHPR4LTZXqI2kXqZCI5J4TAySahcEYN_CoO_bmVrYbe7-Z9N00N4ELVq0m-2wSNYc1UH7rZO_R3YbItXkMjLOnD_t0yMj2HQD7nVL6ZNICdBk98dO09Qoydzel4fHztLDqfV9DgGrpJhpWdem28k1uTxT2B8E0N8CuvVSeWeAUn1JHGJ62Ui5ZnTWicuK7Sw-MhzYyZdYO1qKxNzr4cSIN_VMmt0AIhCgKgAECW78O7qlVmTeOQ64u0AIRULl-LDh4nxX_Wp96qfSy6TFHl7F97WdIF54feNjjEYOIqQBmyFcmuFEpmOWW1u4aci0_Nqib0u7LQAXjb_8--fX9_Za7i3Nz48UAf7o-EL2ECNVTYemFuwvpifupdwx5wtpn7-qt6OBNQN4_oXlNFruQ
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NTxQxFH9BNAQPoKvGFdAeJCaahpmdj04PxmzAjWR1w4EDt6bbD7JRhmW7iP5p_ne-zrQsq5EbBy9z6ZvOtP31fbTvA-B1KWWudJFRzQtJffYXOlblGK1WxW2SyLSwVVNsgo1G1ckJP1qBXzEWxrtVRp7YMGp9rvwZ-R6KJrREUD6xPRvcIo4OBh-mF9RXkPI3rbGcRguRofl5heabe394gGu92-sNPh7vf6KhwgBVeS-ZU6alVaiEGG6rpKysropKl4wpo3KGqogtLZNplWRSZqjnlxq1AZvoMku4Vkxm2O09uI9CuPBbbMjotRBAvb3xnkT7i3oHznih2kbt5cw7KfmDyTSlfEkk_ikY_rqhbQTfYPM_nrJHsBG0bdJvt8djWDF1B9ais38HNmNRCxJ4XAce3sjQ-AT2-z7n-o9JG-BJHEL8zDiCmj6Z0avmWNlo8mVST85CQCsZ1nLqpPpKQq0e9xSO72KIz2C1Pq_NcyCZHKcmNb2cZWVupJSpySvJND6KQqlxF5K48kKFnOy-NMg3scgm7cEiECzCg0XwLry9fmXaJiS5jXjXw0mEgqb4cH5i3Km8dE70C17yNEOe34U3DZ1navh9JUNsBo7CpwdbotxeokRmpJabIxRFYIZOLHDYhXcRzIvmf_79i9s7ewVrCGfx-XA03IJ1VGR565i5Davz2aXZgQfq-3ziZi-bnUlA3DGsfwN5h3Rf
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Approximation+schemes+for+r-weighted+Minimization+Knapsack+problems&rft.jtitle=Annals+of+operations+research&rft.au=Elbassioni%2C+Khaled&rft.au=Karapetyan%2C+Areg&rft.au=Trung+Thanh+Nguyen&rft.date=2019-08-01&rft.pub=Springer+Nature+B.V&rft.issn=0254-5330&rft.eissn=1572-9338&rft.volume=279&rft.issue=1-2&rft.spage=367&rft.epage=386&rft_id=info:doi/10.1007%2Fs10479-018-3111-9&rft.externalDBID=HAS_PDF_LINK
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0254-5330&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0254-5330&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0254-5330&client=summon