A hybrid heuristic for the 0–1 Knapsack Sharing Problem
•A new hybrid method based on ILPH and QPSO is proposed and validated on the KSP.•The proposed approach can be easily adapted to other variants of knapsack problems.•New valid constraints are used to speed up the reduced problems solved inside ILPH.•A local search is incorporated in ILPH as an inten...
Uloženo v:
| Vydáno v: | Expert systems with applications Ročník 42; číslo 10; s. 4653 - 4666 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
15.06.2015
Elsevier |
| Témata: | |
| ISSN: | 0957-4174, 1873-6793 |
| 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!
|
| Abstract | •A new hybrid method based on ILPH and QPSO is proposed and validated on the KSP.•The proposed approach can be easily adapted to other variants of knapsack problems.•New valid constraints are used to speed up the reduced problems solved inside ILPH.•A local search is incorporated in ILPH as an intensification process.•QPSO starts with the best solutions provided by ILPH where infeasibility is allowed.
The Knapsack Sharing Problem (KSP) is a variant of the well-known NP-hard knapsack problem that has received a lot of attention from the researches as it appears into several real-world problems such as allocating resources, reliability engineering, cloud computing, etc. In this paper, we propose a hybrid approach that combines an Iterative Linear Programming-based Heuristic (ILPH) and an improved Quantum Particle Swarm Optimization (QPSO) to solve the KSP. The ILPH is an algorithm conceived to solve 0–1 mixed integer programming. It solves a series of reduced problems generated by exploiting information obtained through a series of linear programming relaxations and tries to improve lower and upper bounds on the optimal value. We proposed several enhancements to strengthen the performance of the ILPH: (i) New valid constraints are introduced to speed up the resolution of reduced problems; (ii) A local search is incorporated as an intensification process to reduce the gap between the upper and the lower bounds. Finally, QPSO is launched by using the k best solutions encountered in the ILPH process as an initial population. The proposed QPSO explores feasible and infeasible solutions. Experimental results obtained on a set of problem instances of the literature and other new harder ones clearly demonstrate the good performance of the proposed hybrid approach in solving the KSP. |
|---|---|
| AbstractList | The Knapsack Sharing Problem (KSP) is a variant of the well-known NP-hard knapsack problem that has received a lot of attention from the researches as it appears into several real-world problems such as allocating resources, reliability engineering, cloud computing, etc. In this paper, we propose a hybrid approach that combines an Iterative Linear Programming-based Heuristic (ILPH) and an improved Quantum Particle Swarm Optimization (QPSO) to solve the KSP. The ILPH is an algorithm conceived to solve 0–1 mixed integer programming. It solves a series of reduced problems generated by exploiting information obtained through a series of linear programming relaxations and tries to improve lower and upper bounds on the optimal value. We proposed several enhancements to strengthen the performance of the ILPH: (i) New valid constraints are introduced to speed up the resolution of reduced problems; (ii) A local search is incorporated as an intensification process to reduce the gap between the upper and the lower bounds. Finally, QPSO is launched by using the k best solutions encountered in the ILPH process as an initial population. The proposed QPSO explores feasible and infeasible solutions. Experimental results obtained on a set of problem instances of the literature and other new harder ones clearly demonstrate the good performance of the proposed hybrid approach in solving the KSP. •A new hybrid method based on ILPH and QPSO is proposed and validated on the KSP.•The proposed approach can be easily adapted to other variants of knapsack problems.•New valid constraints are used to speed up the reduced problems solved inside ILPH.•A local search is incorporated in ILPH as an intensification process.•QPSO starts with the best solutions provided by ILPH where infeasibility is allowed. The Knapsack Sharing Problem (KSP) is a variant of the well-known NP-hard knapsack problem that has received a lot of attention from the researches as it appears into several real-world problems such as allocating resources, reliability engineering, cloud computing, etc. In this paper, we propose a hybrid approach that combines an Iterative Linear Programming-based Heuristic (ILPH) and an improved Quantum Particle Swarm Optimization (QPSO) to solve the KSP. The ILPH is an algorithm conceived to solve 0–1 mixed integer programming. It solves a series of reduced problems generated by exploiting information obtained through a series of linear programming relaxations and tries to improve lower and upper bounds on the optimal value. We proposed several enhancements to strengthen the performance of the ILPH: (i) New valid constraints are introduced to speed up the resolution of reduced problems; (ii) A local search is incorporated as an intensification process to reduce the gap between the upper and the lower bounds. Finally, QPSO is launched by using the k best solutions encountered in the ILPH process as an initial population. The proposed QPSO explores feasible and infeasible solutions. Experimental results obtained on a set of problem instances of the literature and other new harder ones clearly demonstrate the good performance of the proposed hybrid approach in solving the KSP. |
| Author | Khemakhem, Mahdi Hanafi, Saïd Wilbaut, Christophe Haddar, Boukthir |
| Author_xml | – sequence: 1 givenname: Boukthir surname: Haddar fullname: Haddar, Boukthir email: boukthir.haddar@gmail.com organization: LOGIQ ISGI, University of Sfax, Sfax, Tunisia – sequence: 2 givenname: Mahdi surname: Khemakhem fullname: Khemakhem, Mahdi email: mahdi.khemakhem@gmail.com organization: LOGIQ ISGI, University of Sfax, Sfax, Tunisia – sequence: 3 givenname: Saïd surname: Hanafi fullname: Hanafi, Saïd email: said.hanafi@univ-valenciennes.fr organization: UVHC, LAMIH, F-59313 Valenciennes, France – sequence: 4 givenname: Christophe surname: Wilbaut fullname: Wilbaut, Christophe email: christophe.wilbaut@univ-valenciennes.fr organization: UVHC, LAMIH, F-59313 Valenciennes, France |
| BackLink | https://uphf.hal.science/hal-03401168$$DView record in HAL |
| BookMark | eNp9kLFu2zAQhokiAWq7eYFOGttByp0oihKQxTCaOIiBFGgzExR1qujKokvKCbzlHfKGeZLIcLJ08HTA3f8dfnxTdta7nhj7ipAgYH65Tig86SQFFAlgAln5iU2wkDzOZcnP2ARKIeMMZfaZTUNYA6AEkBNWzqN2X3lbRy3tvA2DNVHjfDS0FMHr8wtGd73eBm3-Rr9a7W3_J_rpXdXR5gs7b3QX6OJ9ztjD9Y_fi2W8ur-5XcxXsckQh1gLYTKRAkAuc14RANVSlFrwxoy3WmYV55J0JWqRCm4KUTZj2QrSvGrSsuIz9v34t9Wd2nq70X6vnLZqOV-pww54Boh58Yhj9tsxu_Xu347CoDY2GOo63ZPbBYVFKrIcRFqM0eIYNd6F4KlRxg56sK4fvLadQlAHs2qtDmbVwawCVKPZEU3_Qz9qnYSujhCNrh4teRWMpd5QbT2ZQdXOnsLfAGk_kkU |
| CitedBy_id | crossref_primary_10_1016_j_eswa_2019_06_007 crossref_primary_10_1109_TII_2016_2626472 crossref_primary_10_32604_cmes_2023_026476 crossref_primary_10_1007_s10489_017_1025_x crossref_primary_10_1016_j_ejor_2016_02_009 crossref_primary_10_1088_1742_6596_1879_2_022097 crossref_primary_10_1016_j_eswa_2015_04_063 crossref_primary_10_1016_j_asoc_2015_06_017 crossref_primary_10_1016_j_cor_2021_105692 crossref_primary_10_1177_0954405416661006 crossref_primary_10_1080_10556788_2016_1240795 crossref_primary_10_1155_2018_4607493 crossref_primary_10_1007_s13042_017_0772_7 crossref_primary_10_1080_03155986_2022_2049567 crossref_primary_10_1080_17445760_2017_1314473 crossref_primary_10_1016_j_asoc_2018_01_001 |
| Cites_doi | 10.1287/opre.36.2.359 10.1016/j.dam.2009.08.007 10.1023/A:1013385216761 10.1016/0167-6377(91)90082-Z 10.1016/S0377-2217(97)00165-3 10.1016/j.endm.2010.05.112 10.1109/TEVC.2005.859468 10.1016/j.eswa.2014.06.005 10.1007/s10107-003-0395-5 10.1016/j.eswa.2013.08.045 10.1023/A:1011336210885 10.1016/0377-2217(89)90387-1 10.1007/BF01586926 10.1016/j.ejor.2004.01.024 10.1287/opre.14.6.1045 10.1016/0377-2217(78)90093-0 10.1016/j.cor.2003.11.005 10.1016/j.ejor.2008.01.044 10.1016/0377-2217(94)00013-3 10.1051/ro/1993270201691 10.1023/A:1019920507008 10.1016/j.cor.2009.09.010 10.1287/opre.45.5.768 10.1007/s10107-004-0518-7 10.1016/j.eswa.2014.05.010 10.1016/j.amc.2013.11.040 10.1016/j.eswa.2013.09.012 10.1016/j.cie.2010.10.015 10.1016/j.eswa.2011.11.058 10.1016/S0305-0548(97)00009-9 10.1051/ro:2001123 10.1016/j.eswa.2013.11.040 10.1016/0377-2217(92)90335-7 10.1016/j.eswa.2014.09.006 10.1016/j.eswa.2014.07.034 10.1111/j.1540-5915.1977.tb01074.x 10.1007/s10479-009-0546-z 10.1016/S0166-218X(01)00338-9 10.1287/opre.27.2.341 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier Ltd Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2015 Elsevier Ltd – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 1XC VOOES |
| DOI | 10.1016/j.eswa.2015.01.049 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1873-6793 |
| EndPage | 4666 |
| ExternalDocumentID | oai:HAL:hal-03401168v1 10_1016_j_eswa_2015_01_049 S0957417415000640 |
| GroupedDBID | --K --M .DC .~1 0R~ 13V 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABBOA ABFNM ABMAC ABMVD ABUCO ABYKQ ACDAQ ACGFS ACHRH ACNTT ACRLP ACZNC ADBBV ADEZE ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGJBL AGUBO AGUMN AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALEQD ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM AXJTR BJAXD BKOJK BLXMC BNSAS CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W JJJVA KOM LG9 LY1 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSL SST SSV SSZ T5K TN5 ~G- 29G 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABJNI ABKBG ABUFD ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADJOM ADMUD ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB G-2 HLZ HVGLF HZ~ R2- SBC SET SEW WUQ XPP ZMT ~HD 7SC 8FD JQ2 L7M L~C L~D 1XC VOOES |
| ID | FETCH-LOGICAL-c411t-a55c4520006763be00ed759a53fca55d74b337eab5d5253c859f095b026bf29b3 |
| ISICitedReferencesCount | 18 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000351977600005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0957-4174 |
| IngestDate | Tue Oct 14 20:38:12 EDT 2025 Thu Oct 02 15:56:40 EDT 2025 Sat Nov 29 04:44:42 EST 2025 Tue Nov 18 22:35:04 EST 2025 Fri Feb 23 02:29:06 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 10 |
| Keywords | Relaxation Hybrid method Particle swarm optimization Knapsack problem "Relaxation" "Knapsack problem" "Particle swarm optimization" "Hybrid method" |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c411t-a55c4520006763be00ed759a53fca55d74b337eab5d5253c859f095b026bf29b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ORCID | 0000-0003-1250-7792 |
| OpenAccessLink | https://uphf.hal.science/hal-03401168 |
| PQID | 1825460528 |
| PQPubID | 23500 |
| PageCount | 14 |
| ParticipantIDs | hal_primary_oai_HAL_hal_03401168v1 proquest_miscellaneous_1825460528 crossref_citationtrail_10_1016_j_eswa_2015_01_049 crossref_primary_10_1016_j_eswa_2015_01_049 elsevier_sciencedirect_doi_10_1016_j_eswa_2015_01_049 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-06-15 |
| PublicationDateYYYYMMDD | 2015-06-15 |
| PublicationDate_xml | – month: 06 year: 2015 text: 2015-06-15 day: 15 |
| PublicationDecade | 2010 |
| PublicationTitle | Expert systems with applications |
| PublicationYear | 2015 |
| Publisher | Elsevier Ltd Elsevier |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier |
| References | Wu, Qiu, Yu, Pedrycz, Ma, Li (b0265) 2014; 41 Boyer, Baz, Elkihel (b0030) 2011; 61 Brown (b0035) 1979; 27 Mohais, Mendes, Ward, Posthoff (b0185) 2005 Vasquez, Hao (b0240) 2001; 35 Pisinger (b0210) 1995; 87 Gosciniak (b0085) 2015; 42 Baykasoğlu, Ozsoydan (b0020) 2014; 41 Glover (b0075) 1977; 8 Hifi, Sadfi, Sbihi (b0125) 2002; 23 Wilbaut, Hanafi (b0255) 2009; 195 Hifi, M’Halla (b0105) 2010; 42 Gilmore, Gomory (b0070) 1966; 14 Hansen, Mladenovic, Pérez-Brito (b0100) 2001; 7 Luss (b0170) 1992; 60 Krohling, dos Santos Coelho (b0155) 2006 Hanafi, Lazic, Mladenovic, Wilbaut, Crévits (b0095) 2010; 36 Kennedy, Eberhart (b0150) 1997; Vol. 5 Pendharkar (b0205) 2014; 41 Shaw (b0215) 1998 Boussier, Vasquez, Vimont, Hanafi, Michelon (b0025) 2010; 158 Sun, Xu, Feng (b0230) 2004; Vol. 1 Kuno, Konno, Zemel (b0160) 1991; 10 Kennedy, Eberhart (b0145) 1995; Vol. 4 Ahuja, Orlin (b0005) 2002; 123 Hifi, M’Halla, Sadfi (b0110) 2005; 32 Kellerer, Pferschy, Pisinger (b0130) 2004 Clerc (b0050) 2006 Hanafi, Wilbaut (b0090) 2011; 183 Hifi, Sadfi (b0115) 2002; 2002 Kennedy (b0140) 2003 Lazić, Hanafi, Mladenović, Urošević (b0165) 2010; 37 Wilbaut, Hanafi, Freville, Balev (b0260) 2006; 35 Nguyen, Li, Zhang, Truong (b0190) 2014; 41 Hifi, Wu (b0120) 2014; 227 Wang, Wang, Xu (b0250) 2012; 39 Changdar, Mahapatra, Pal (b0045) 2015; 42 Fischetti, Lodi (b0060) 2003; 98 Tang (b0235) 1988; 36 Soyster, Lev, Slivka (b0220) 1978; 2 Fréville, Plateau (b0065) 1993; 27 Kennedy (b0135) 2000; Vol. 2 Martello, Toth (b0175) 1990 Yamada, Futakawa, Kataoka (b0275) 1998; 106 Yang, Wang, Jiao (b0280) 2004; Vol. 1 Yamada, Futakawa (b0270) 1997; 24 Danna, Rothberg, Pape (b0055) 2005; 102 Sun, Feng, Xu (b0225) 2004; Vol. 1 Alijla, Wong, Lim, Khader, Al-Betar (b0010) 2014; 41 Brown (b0040) 1991; 51 Pang, Yu (b0195) 1989; 41 Parrott, Li (b0200) 2006; 10 Vasquez, Vimont (b0245) 2005; 165 Glover (b0080) 2005 Martello, Toth (b0180) 1997; 45 Kuno (10.1016/j.eswa.2015.01.049_b0160) 1991; 10 Glover (10.1016/j.eswa.2015.01.049_b0080) 2005 Kennedy (10.1016/j.eswa.2015.01.049_b0150) 1997; Vol. 5 Yamada (10.1016/j.eswa.2015.01.049_b0275) 1998; 106 Brown (10.1016/j.eswa.2015.01.049_b0035) 1979; 27 Baykasoğlu (10.1016/j.eswa.2015.01.049_b0020) 2014; 41 Wang (10.1016/j.eswa.2015.01.049_b0250) 2012; 39 Soyster (10.1016/j.eswa.2015.01.049_b0220) 1978; 2 Boyer (10.1016/j.eswa.2015.01.049_b0030) 2011; 61 Martello (10.1016/j.eswa.2015.01.049_b0175) 1990 Vasquez (10.1016/j.eswa.2015.01.049_b0240) 2001; 35 Parrott (10.1016/j.eswa.2015.01.049_b0200) 2006; 10 Martello (10.1016/j.eswa.2015.01.049_b0180) 1997; 45 Yamada (10.1016/j.eswa.2015.01.049_b0270) 1997; 24 Ahuja (10.1016/j.eswa.2015.01.049_b0005) 2002; 123 Wilbaut (10.1016/j.eswa.2015.01.049_b0260) 2006; 35 Sun (10.1016/j.eswa.2015.01.049_b0230) 2004; Vol. 1 Changdar (10.1016/j.eswa.2015.01.049_b0045) 2015; 42 Luss (10.1016/j.eswa.2015.01.049_b0170) 1992; 60 Fischetti (10.1016/j.eswa.2015.01.049_b0060) 2003; 98 Gilmore (10.1016/j.eswa.2015.01.049_b0070) 1966; 14 Danna (10.1016/j.eswa.2015.01.049_b0055) 2005; 102 Fréville (10.1016/j.eswa.2015.01.049_b0065) 1993; 27 Hanafi (10.1016/j.eswa.2015.01.049_b0090) 2011; 183 Hanafi (10.1016/j.eswa.2015.01.049_b0095) 2010; 36 Kennedy (10.1016/j.eswa.2015.01.049_b0145) 1995; Vol. 4 Vasquez (10.1016/j.eswa.2015.01.049_b0245) 2005; 165 Yang (10.1016/j.eswa.2015.01.049_b0280) 2004; Vol. 1 Pisinger (10.1016/j.eswa.2015.01.049_b0210) 1995; 87 Hansen (10.1016/j.eswa.2015.01.049_b0100) 2001; 7 Pendharkar (10.1016/j.eswa.2015.01.049_b0205) 2014; 41 Shaw (10.1016/j.eswa.2015.01.049_b0215) 1998 Krohling (10.1016/j.eswa.2015.01.049_b0155) 2006 Pang (10.1016/j.eswa.2015.01.049_b0195) 1989; 41 Nguyen (10.1016/j.eswa.2015.01.049_b0190) 2014; 41 Mohais (10.1016/j.eswa.2015.01.049_b0185) 2005 Hifi (10.1016/j.eswa.2015.01.049_b0110) 2005; 32 Hifi (10.1016/j.eswa.2015.01.049_b0125) 2002; 23 Boussier (10.1016/j.eswa.2015.01.049_b0025) 2010; 158 Wilbaut (10.1016/j.eswa.2015.01.049_b0255) 2009; 195 Glover (10.1016/j.eswa.2015.01.049_b0075) 1977; 8 Brown (10.1016/j.eswa.2015.01.049_b0040) 1991; 51 Clerc (10.1016/j.eswa.2015.01.049_b0050) 2006 Gosciniak (10.1016/j.eswa.2015.01.049_b0085) 2015; 42 Hifi (10.1016/j.eswa.2015.01.049_b0105) 2010; 42 Kennedy (10.1016/j.eswa.2015.01.049_b0140) 2003 Wu (10.1016/j.eswa.2015.01.049_b0265) 2014; 41 Hifi (10.1016/j.eswa.2015.01.049_b0120) 2014; 227 Tang (10.1016/j.eswa.2015.01.049_b0235) 1988; 36 Lazić (10.1016/j.eswa.2015.01.049_b0165) 2010; 37 Hifi (10.1016/j.eswa.2015.01.049_b0115) 2002; 2002 Sun (10.1016/j.eswa.2015.01.049_b0225) 2004; Vol. 1 Alijla (10.1016/j.eswa.2015.01.049_b0010) 2014; 41 Kellerer (10.1016/j.eswa.2015.01.049_b0130) 2004 Kennedy (10.1016/j.eswa.2015.01.049_b0135) 2000; Vol. 2 |
| References_xml | – volume: 10 start-page: 23 year: 1991 end-page: 26 ident: b0160 article-title: A linear-time algorithm for solving continuous maximin knapsack problems publication-title: Operations Research Letters – volume: 37 start-page: 1055 year: 2010 end-page: 1067 ident: b0165 article-title: Variable neighborhood decomposition search for 0–1 mixed integer programs publication-title: Computers & Operations Research – volume: 23 start-page: 27 year: 2002 end-page: 45 ident: b0125 article-title: An efficient algorithm for the knapsack sharing problem publication-title: Computational Optimization and Applications – volume: 2 start-page: 195 year: 1978 end-page: 201 ident: b0220 article-title: Zero-one programming with many variables and few constraints publication-title: European Journal of Operational Research – volume: 2002 start-page: 35 year: 2002 end-page: 54 ident: b0115 article-title: The knapsack sharing problem: An exact algorithm publication-title: Journal of Combinatorial Optimization – start-page: 80 year: 2003 end-page: 87 ident: b0140 article-title: Bare bones particle swarms publication-title: SIS ’03 Proceedings of the 2003 IEEE swarm intelligence symposium – volume: 42 start-page: 844 year: 2015 end-page: 854 ident: b0085 article-title: A new approach to particle swarm optimization algorithm publication-title: Expert Systems with Applications – year: 2006 ident: b0050 article-title: Particle swarm optimization – volume: 24 start-page: 961 year: 1997 end-page: 967 ident: b0270 article-title: Heuristic and reduction algorithms for the knapsack sharing problem publication-title: Computers & Operations Research – volume: 51 start-page: 55 year: 1991 end-page: 73 ident: b0040 article-title: Solving knapsack sharing problems with general tradeoff functions publication-title: Mathematical Programming – start-page: 1428 year: 2006 end-page: 1433 ident: b0155 article-title: Pso-e: Particle swarm with exponential distribution publication-title: IEEE congress on evolutionary computation, CEC 2006 – volume: 41 start-page: 218 year: 1989 end-page: 223 ident: b0195 article-title: A min–max resource allocation problem with substitutions publication-title: European Journal of Operational Research – volume: 41 start-page: 3712 year: 2014 end-page: 3725 ident: b0020 article-title: An improved firefly algorithm for solving dynamic multidimensional knapsack problems publication-title: Expert Systems with Applications – volume: Vol. 2 start-page: 1507 year: 2000 end-page: 1512 ident: b0135 article-title: Stereotyping: Improving particle swarm performance with cluster analysis publication-title: Proceedings of the 2000 congress on evolutionary computation – volume: 41 start-page: 7536 year: 2014 end-page: 7548 ident: b0265 article-title: Superior solution guided particle swarm optimization combined with local search techniques publication-title: Expert Systems with Applications – volume: 27 start-page: 341 year: 1979 end-page: 355 ident: b0035 article-title: The knapsack sharing problem publication-title: Operations Research – volume: 98 start-page: 23 year: 2003 end-page: 47 ident: b0060 article-title: Local branching publication-title: Mathematical Programming – volume: Vol. 1 start-page: 111 year: 2004 end-page: 116 ident: b0230 article-title: A global search strategy of quantum-behaved particle swarm optimization publication-title: 2004 IEEE conference on cybernetics and intelligent systems – start-page: 425 year: 2005 end-page: 440 ident: b0080 article-title: Adaptive memory projection methods for integer programming publication-title: Metaheuristic optimization via memory and evolution – start-page: 417 year: 1998 end-page: 431 ident: b0215 article-title: Using constraint programming and local search methods to solve vehicle routing problems publication-title: Proceedings of the 4th international conference on principles and practice of constraint programming, CP ’98 – volume: 183 start-page: 125 year: 2011 end-page: 142 ident: b0090 article-title: Improved convergent heuristics for the 0–1 multidimensional knapsack problem publication-title: Annals of Operations Research – volume: 36 start-page: 883 year: 2010 end-page: 890 ident: b0095 article-title: Hybrid variable neighbourhood decomposition search for 0–1 mixed integer programming problem publication-title: Electronic Notes in Discrete Mathematics – volume: Vol. 4 start-page: 1942 year: 1995 end-page: 1948 ident: b0145 article-title: Particle swarm optimization publication-title: Proceedings, IEEE international conference on neural networks – volume: 35 start-page: 579 year: 2006 end-page: 598 ident: b0260 article-title: Tabu search: Global intensification using dynamic programming publication-title: Control and Cybernetics – volume: 45 start-page: 768 year: 1997 end-page: 778 ident: b0180 article-title: Upper bounds and algorithms for hard 0–1 knapsack problems publication-title: Operations Research – volume: 195 start-page: 62 year: 2009 end-page: 74 ident: b0255 article-title: New convergent heuristics for 0–1 mixed integer programming publication-title: European Journal of Operational Research – volume: 61 start-page: 274 year: 2011 end-page: 278 ident: b0030 article-title: A dynamic programming method with lists for the knapsack sharing problem publication-title: Computers & Industrial Engineering – volume: 158 start-page: 97 year: 2010 end-page: 109 ident: b0025 article-title: A multilevel search strategy for the 0–1 multidimensional knapsack problem publication-title: Discrete Applied Mathematics – volume: Vol. 1 start-page: 320 year: 2004 end-page: 324 ident: b0280 article-title: A quantum particle swarm optimization publication-title: Congress on evolutionary computation, CEC2004 – volume: 87 start-page: 175 year: 1995 end-page: 187 ident: b0210 article-title: An expanding-core algorithm for the exact 0–1 knapsack problem publication-title: European Journal of Operational Research – year: 2004 ident: b0130 article-title: Knapsack problems – volume: 42 start-page: 648 year: 2010 end-page: 651 ident: b0105 article-title: The knapsack sharing problem: A tree search exact algorithm publication-title: World Academy of Science, Engineering & Technology – volume: 39 start-page: 5593 year: 2012 end-page: 5599 ident: b0250 article-title: An effective hybrid EDA-based algorithm for solving multidimensional knapsack problem publication-title: Expert Systems with Applications – year: 1990 ident: b0175 article-title: Knapsack problems: Algorithms and computer implementations – volume: 36 start-page: 359 year: 1988 end-page: 367 ident: b0235 article-title: A max–min allocation problem: Its solutions and applications publication-title: Operations Research – volume: 7 start-page: 335 year: 2001 end-page: 350 ident: b0100 article-title: Variable neighborhood decomposition search publication-title: Journal of Heuristics – volume: 41 start-page: 6555 year: 2014 end-page: 6569 ident: b0010 article-title: A modified intelligent water drops algorithm and its application to optimization problems publication-title: Expert Systems with Applications – volume: 35 start-page: 415 year: 2001 end-page: 438 ident: b0240 article-title: Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 publication-title: Operation Research – volume: 14 start-page: 1045 year: 1966 end-page: 1074 ident: b0070 article-title: The theory and computation of knapsack functions publication-title: Operations Research – volume: 27 start-page: 169 year: 1993 end-page: 187 ident: b0065 article-title: Sac-à-dos multidimensionnel en variables 0–1: encadrement de la somme des variables à l’optimum publication-title: RAIRO – Operations Research – Recherche Opérationnelle – volume: 227 start-page: 518 year: 2014 end-page: 530 ident: b0120 article-title: New upper bounds and exact methods for the knapsack sharing problem publication-title: Applied Mathematics and Computation – volume: 106 start-page: 177 year: 1998 end-page: 183 ident: b0275 article-title: Some exact algorithms for the knapsack sharing problem publication-title: European Journal of Operational Research – start-page: 776 year: 2005 end-page: 785 ident: b0185 article-title: Neighborhood re-structuring in particle swarm optimization publication-title: AI 2005: Advances in artificial intelligence, lecture notes in computer science – volume: 32 start-page: 1311 year: 2005 end-page: 1324 ident: b0110 article-title: An exact algorithm for the knapsack sharing problem publication-title: Computers & Operations Research – volume: 42 start-page: 2276 year: 2015 end-page: 2286 ident: b0045 article-title: An improved genetic algorithm based approach to solve constrained knapsack problem in fuzzy environment publication-title: Expert Systems with Applications – volume: 41 start-page: 1483 year: 2014 end-page: 1491 ident: b0205 article-title: A misclassification cost risk bound based on hybrid particle swarm optimization heuristic publication-title: Expert Systems with Applications – volume: Vol. 1 start-page: 325 year: 2004 end-page: 331 ident: b0225 article-title: Particle swarm optimization with particles having quantum behavior publication-title: Congress on evolutionary computation, CEC2004 – volume: 10 start-page: 440 year: 2006 end-page: 458 ident: b0200 article-title: Locating and tracking multiple dynamic optima by a particle swarm model using speciation publication-title: IEEE Transactions on Evolutionary Computation – volume: 8 start-page: 156 year: 1977 end-page: 166 ident: b0075 article-title: Heuristics for integer programming using surrogate constraints publication-title: Decision Sciences – volume: 41 start-page: 2134 year: 2014 end-page: 2143 ident: b0190 article-title: A hybrid algorithm based on particle swarm and chemical reaction optimization publication-title: Expert Systems with Applications – volume: 60 start-page: 76 year: 1992 end-page: 86 ident: b0170 article-title: Minimax resource allocation problems: Optimization and parametric analysis publication-title: European Journal of Operational Research – volume: 102 start-page: 71 year: 2005 end-page: 90 ident: b0055 article-title: Exploring relaxation induced neighborhoods to improve MIP solutions publication-title: Mathematical Programming – volume: 123 start-page: 75 year: 2002 end-page: 102 ident: b0005 article-title: A survey of very large-scale neighborhood search techniques publication-title: Discrete Applied Mathematics – volume: 165 start-page: 70 year: 2005 end-page: 81 ident: b0245 article-title: Improved results on the 0–1 multidimensional knapsack problem publication-title: European Journal of Operational Research – volume: Vol. 5 start-page: 4104 year: 1997 end-page: 4108 ident: b0150 article-title: A discrete binary version of the particle swarm algorithm publication-title: 1997 IEEE international conference on systems, man and cybernetics, computational cybernetics and simulation – volume: 36 start-page: 359 issue: 2 year: 1988 ident: 10.1016/j.eswa.2015.01.049_b0235 article-title: A max–min allocation problem: Its solutions and applications publication-title: Operations Research doi: 10.1287/opre.36.2.359 – volume: 158 start-page: 97 issue: 2 year: 2010 ident: 10.1016/j.eswa.2015.01.049_b0025 article-title: A multilevel search strategy for the 0–1 multidimensional knapsack problem publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2009.08.007 – start-page: 425 year: 2005 ident: 10.1016/j.eswa.2015.01.049_b0080 article-title: Adaptive memory projection methods for integer programming – volume: 2002 start-page: 35 issue: 1 year: 2002 ident: 10.1016/j.eswa.2015.01.049_b0115 article-title: The knapsack sharing problem: An exact algorithm publication-title: Journal of Combinatorial Optimization doi: 10.1023/A:1013385216761 – volume: 10 start-page: 23 issue: 1 year: 1991 ident: 10.1016/j.eswa.2015.01.049_b0160 article-title: A linear-time algorithm for solving continuous maximin knapsack problems publication-title: Operations Research Letters doi: 10.1016/0167-6377(91)90082-Z – volume: 106 start-page: 177 issue: 1 year: 1998 ident: 10.1016/j.eswa.2015.01.049_b0275 article-title: Some exact algorithms for the knapsack sharing problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(97)00165-3 – volume: 36 start-page: 883 year: 2010 ident: 10.1016/j.eswa.2015.01.049_b0095 article-title: Hybrid variable neighbourhood decomposition search for 0–1 mixed integer programming problem publication-title: Electronic Notes in Discrete Mathematics doi: 10.1016/j.endm.2010.05.112 – volume: 10 start-page: 440 issue: 4 year: 2006 ident: 10.1016/j.eswa.2015.01.049_b0200 article-title: Locating and tracking multiple dynamic optima by a particle swarm model using speciation publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2005.859468 – volume: 41 start-page: 7536 issue: 16 year: 2014 ident: 10.1016/j.eswa.2015.01.049_b0265 article-title: Superior solution guided particle swarm optimization combined with local search techniques publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2014.06.005 – volume: 98 start-page: 23 issue: 1 year: 2003 ident: 10.1016/j.eswa.2015.01.049_b0060 article-title: Local branching publication-title: Mathematical Programming doi: 10.1007/s10107-003-0395-5 – volume: Vol. 1 start-page: 320 year: 2004 ident: 10.1016/j.eswa.2015.01.049_b0280 article-title: A quantum particle swarm optimization – volume: 41 start-page: 1483 issue: 4 year: 2014 ident: 10.1016/j.eswa.2015.01.049_b0205 article-title: A misclassification cost risk bound based on hybrid particle swarm optimization heuristic publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2013.08.045 – volume: 7 start-page: 335 issue: 4 year: 2001 ident: 10.1016/j.eswa.2015.01.049_b0100 article-title: Variable neighborhood decomposition search publication-title: Journal of Heuristics doi: 10.1023/A:1011336210885 – volume: 41 start-page: 218 issue: 2 year: 1989 ident: 10.1016/j.eswa.2015.01.049_b0195 article-title: A min–max resource allocation problem with substitutions publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(89)90387-1 – volume: Vol. 2 start-page: 1507 year: 2000 ident: 10.1016/j.eswa.2015.01.049_b0135 article-title: Stereotyping: Improving particle swarm performance with cluster analysis – volume: 51 start-page: 55 issue: 1 year: 1991 ident: 10.1016/j.eswa.2015.01.049_b0040 article-title: Solving knapsack sharing problems with general tradeoff functions publication-title: Mathematical Programming doi: 10.1007/BF01586926 – year: 1990 ident: 10.1016/j.eswa.2015.01.049_b0175 – volume: 165 start-page: 70 year: 2005 ident: 10.1016/j.eswa.2015.01.049_b0245 article-title: Improved results on the 0–1 multidimensional knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.01.024 – volume: Vol. 1 start-page: 111 year: 2004 ident: 10.1016/j.eswa.2015.01.049_b0230 article-title: A global search strategy of quantum-behaved particle swarm optimization – volume: 14 start-page: 1045 issue: 6 year: 1966 ident: 10.1016/j.eswa.2015.01.049_b0070 article-title: The theory and computation of knapsack functions publication-title: Operations Research doi: 10.1287/opre.14.6.1045 – volume: 2 start-page: 195 issue: 3 year: 1978 ident: 10.1016/j.eswa.2015.01.049_b0220 article-title: Zero-one programming with many variables and few constraints publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(78)90093-0 – volume: 32 start-page: 1311 year: 2005 ident: 10.1016/j.eswa.2015.01.049_b0110 article-title: An exact algorithm for the knapsack sharing problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2003.11.005 – volume: 195 start-page: 62 issue: 1 year: 2009 ident: 10.1016/j.eswa.2015.01.049_b0255 article-title: New convergent heuristics for 0–1 mixed integer programming publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.01.044 – volume: 87 start-page: 175 year: 1995 ident: 10.1016/j.eswa.2015.01.049_b0210 article-title: An expanding-core algorithm for the exact 0–1 knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)00013-3 – volume: 27 start-page: 169 issue: 2 year: 1993 ident: 10.1016/j.eswa.2015.01.049_b0065 article-title: Sac-à-dos multidimensionnel en variables 0–1: encadrement de la somme des variables à l’optimum publication-title: RAIRO – Operations Research – Recherche Opérationnelle doi: 10.1051/ro/1993270201691 – volume: 23 start-page: 27 issue: 1 year: 2002 ident: 10.1016/j.eswa.2015.01.049_b0125 article-title: An efficient algorithm for the knapsack sharing problem publication-title: Computational Optimization and Applications doi: 10.1023/A:1019920507008 – volume: 37 start-page: 1055 year: 2010 ident: 10.1016/j.eswa.2015.01.049_b0165 article-title: Variable neighborhood decomposition search for 0–1 mixed integer programs publication-title: Computers & Operations Research doi: 10.1016/j.cor.2009.09.010 – volume: 45 start-page: 768 issue: 5 year: 1997 ident: 10.1016/j.eswa.2015.01.049_b0180 article-title: Upper bounds and algorithms for hard 0–1 knapsack problems publication-title: Operations Research doi: 10.1287/opre.45.5.768 – volume: 102 start-page: 71 year: 2005 ident: 10.1016/j.eswa.2015.01.049_b0055 article-title: Exploring relaxation induced neighborhoods to improve MIP solutions publication-title: Mathematical Programming doi: 10.1007/s10107-004-0518-7 – start-page: 776 year: 2005 ident: 10.1016/j.eswa.2015.01.049_b0185 article-title: Neighborhood re-structuring in particle swarm optimization – volume: 41 start-page: 6555 year: 2014 ident: 10.1016/j.eswa.2015.01.049_b0010 article-title: A modified intelligent water drops algorithm and its application to optimization problems publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2014.05.010 – volume: 35 start-page: 579 issue: 3 year: 2006 ident: 10.1016/j.eswa.2015.01.049_b0260 article-title: Tabu search: Global intensification using dynamic programming publication-title: Control and Cybernetics – volume: 227 start-page: 518 year: 2014 ident: 10.1016/j.eswa.2015.01.049_b0120 article-title: New upper bounds and exact methods for the knapsack sharing problem publication-title: Applied Mathematics and Computation doi: 10.1016/j.amc.2013.11.040 – volume: 41 start-page: 2134 issue: 5 year: 2014 ident: 10.1016/j.eswa.2015.01.049_b0190 article-title: A hybrid algorithm based on particle swarm and chemical reaction optimization publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2013.09.012 – volume: 61 start-page: 274 issue: 2 year: 2011 ident: 10.1016/j.eswa.2015.01.049_b0030 article-title: A dynamic programming method with lists for the knapsack sharing problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2010.10.015 – volume: 39 start-page: 5593 issue: 5 year: 2012 ident: 10.1016/j.eswa.2015.01.049_b0250 article-title: An effective hybrid EDA-based algorithm for solving multidimensional knapsack problem publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2011.11.058 – year: 2004 ident: 10.1016/j.eswa.2015.01.049_b0130 – volume: 24 start-page: 961 issue: 10 year: 1997 ident: 10.1016/j.eswa.2015.01.049_b0270 article-title: Heuristic and reduction algorithms for the knapsack sharing problem publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(97)00009-9 – volume: Vol. 1 start-page: 325 year: 2004 ident: 10.1016/j.eswa.2015.01.049_b0225 article-title: Particle swarm optimization with particles having quantum behavior – volume: Vol. 4 start-page: 1942 year: 1995 ident: 10.1016/j.eswa.2015.01.049_b0145 article-title: Particle swarm optimization – volume: 35 start-page: 415 issue: 4 year: 2001 ident: 10.1016/j.eswa.2015.01.049_b0240 article-title: Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 publication-title: Operation Research doi: 10.1051/ro:2001123 – volume: 41 start-page: 3712 issue: 8 year: 2014 ident: 10.1016/j.eswa.2015.01.049_b0020 article-title: An improved firefly algorithm for solving dynamic multidimensional knapsack problems publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2013.11.040 – volume: 60 start-page: 76 issue: 1 year: 1992 ident: 10.1016/j.eswa.2015.01.049_b0170 article-title: Minimax resource allocation problems: Optimization and parametric analysis publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(92)90335-7 – volume: 42 start-page: 2276 issue: 4 year: 2015 ident: 10.1016/j.eswa.2015.01.049_b0045 article-title: An improved genetic algorithm based approach to solve constrained knapsack problem in fuzzy environment publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2014.09.006 – start-page: 80 year: 2003 ident: 10.1016/j.eswa.2015.01.049_b0140 article-title: Bare bones particle swarms – year: 2006 ident: 10.1016/j.eswa.2015.01.049_b0050 – volume: 42 start-page: 844 issue: 2 year: 2015 ident: 10.1016/j.eswa.2015.01.049_b0085 article-title: A new approach to particle swarm optimization algorithm publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2014.07.034 – volume: 8 start-page: 156 issue: 1 year: 1977 ident: 10.1016/j.eswa.2015.01.049_b0075 article-title: Heuristics for integer programming using surrogate constraints publication-title: Decision Sciences doi: 10.1111/j.1540-5915.1977.tb01074.x – volume: Vol. 5 start-page: 4104 year: 1997 ident: 10.1016/j.eswa.2015.01.049_b0150 article-title: A discrete binary version of the particle swarm algorithm – start-page: 1428 year: 2006 ident: 10.1016/j.eswa.2015.01.049_b0155 article-title: Pso-e: Particle swarm with exponential distribution – volume: 183 start-page: 125 issue: 1 year: 2011 ident: 10.1016/j.eswa.2015.01.049_b0090 article-title: Improved convergent heuristics for the 0–1 multidimensional knapsack problem publication-title: Annals of Operations Research doi: 10.1007/s10479-009-0546-z – volume: 123 start-page: 75 year: 2002 ident: 10.1016/j.eswa.2015.01.049_b0005 article-title: A survey of very large-scale neighborhood search techniques publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(01)00338-9 – volume: 27 start-page: 341 issue: 2 year: 1979 ident: 10.1016/j.eswa.2015.01.049_b0035 article-title: The knapsack sharing problem publication-title: Operations Research doi: 10.1287/opre.27.2.341 – start-page: 417 year: 1998 ident: 10.1016/j.eswa.2015.01.049_b0215 article-title: Using constraint programming and local search methods to solve vehicle routing problems – volume: 42 start-page: 648 year: 2010 ident: 10.1016/j.eswa.2015.01.049_b0105 article-title: The knapsack sharing problem: A tree search exact algorithm publication-title: World Academy of Science, Engineering & Technology |
| SSID | ssj0017007 |
| Score | 2.2637174 |
| Snippet | •A new hybrid method based on ILPH and QPSO is proposed and validated on the KSP.•The proposed approach can be easily adapted to other variants of knapsack... The Knapsack Sharing Problem (KSP) is a variant of the well-known NP-hard knapsack problem that has received a lot of attention from the researches as it... |
| SourceID | hal proquest crossref elsevier |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 4653 |
| SubjectTerms | Algorithms Amplification Computer Science Expert systems Heuristic Hybrid method Knapsack problem Linear programming Mathematical models Optimization Particle swarm optimization Relaxation Swarm intelligence |
| Title | A hybrid heuristic for the 0–1 Knapsack Sharing Problem |
| URI | https://dx.doi.org/10.1016/j.eswa.2015.01.049 https://www.proquest.com/docview/1825460528 https://uphf.hal.science/hal-03401168 |
| Volume | 42 |
| WOSCitedRecordID | wos000351977600005&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-6793 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017007 issn: 0957-4174 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV07b9swECYcp0OXvou6L7BFN0OFKJF6jGqRIG2CIENaeCNIiYIdB7IRS2669Qd06z_sL-lRJBXZRYJm6EIYtEnLvM_H4_HuO4TeCSJUGUTCy5WMPNihmJfKXHoFKQFSpUzDlp3_61F8fJxMJunJYPDT5cKsz-OqSi4v0-V_FTX0gbB16uwtxN1NCh3wGoQOLYgd2n8SfDaeftdpWGADNoaGuQsl9F1oQ0jGh5VYrkQ-bymbtb_gxJSW2XDVax7k2rI9uzy43o13X32ZQO0Pi2ZeT2ddxO-h5oSdQ2PygqbF7GpMJcqZcUq3t_X7Rc8HJEVTb3If9N0TIGpd14dt-BljjxJTisepXBr0oeX3FKime-ttxjQyNVn-UvTG53D2Xq2-afYoYshXDfvpJqv21m7XxSC68LYzrufgeg7uEw5z7KDdIGZpMkS72ae9yefuVir2Tfq9-0k2CcvEC24_yXWGzs5UR9xubfytNXP6AN2zxxCcGfg8RANVPUL3XYkPbDX-Y5Rm2KAJd2jCgCYMaML-7x-_CHY4whZH2OLoCfqyv3f68cCz1Ta8nBJSe4KxnDKTuRWFUvm-KmAVBAvLHN4rYirDMFZCsoIFLMwTlpawEhIO8bIMUhk-RcNqUalnCOcJLSKmgihQMY2kkHDGT-CcIZUKioLKESJuaXhuqeh1RZRzfr1QRmjcjVkaIpYbP83cinNrShoTkQOAbhz3FsTTfYHmXj_Ijrju80OqLy2TNRmhN056HJSxvmETlVo0K07a8hI-C5Lnt3rcF-ju1X_nJRrWF416he7k63q2unhtYfgHQ0Cp3w |
| linkProvider | Elsevier |
| 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=A+hybrid+heuristic+for+the+0%E2%80%931+Knapsack+Sharing+Problem&rft.jtitle=Expert+systems+with+applications&rft.au=Haddar%2C+Boukthir&rft.au=Khemakhem%2C+Mahdi&rft.au=Hanafi%2C+Sa%C3%AFd&rft.au=Wilbaut%2C+Christophe&rft.date=2015-06-15&rft.issn=0957-4174&rft.volume=42&rft.issue=10&rft.spage=4653&rft.epage=4666&rft_id=info:doi/10.1016%2Fj.eswa.2015.01.049&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_eswa_2015_01_049 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0957-4174&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0957-4174&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0957-4174&client=summon |