Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem
A stochastic version of the 0–1 Knapsack Problem recently introduced in the literature and named the 0–1 Time-Bomb Knapsack Problem is the topic of the present work. In this problem, in addition to profit and weight, each item is characterized by a probability of exploding, and therefore destroying...
Saved in:
| Published in | Computers & operations research Vol. 178; p. 107010 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Ltd
01.06.2025
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0305-0548 1873-765X |
| DOI | 10.1016/j.cor.2025.107010 |
Cover
| Abstract | A stochastic version of the 0–1 Knapsack Problem recently introduced in the literature and named the 0–1 Time-Bomb Knapsack Problem is the topic of the present work. In this problem, in addition to profit and weight, each item is characterized by a probability of exploding, and therefore destroying all the contents of the knapsack, in case it is loaded. The optimization aims at maximizing the expected profit of the selected items, which takes into account also the probabilities of explosion, while fulfilling the capacity constraint. The problem has real-world applications in logistics and cloud computing.
In this work, two model-based algorithms are introduced. They are based on partial linearizations of a non-linear model describing the problem. Extensive computational results on the instances available in the literature are presented to position the new methods as the best-performing ones, while comparing against those previously proposed. |
|---|---|
| AbstractList | A stochastic version of the 0–1 Knapsack Problem recently introduced in the literature and named the 0–1 Time-Bomb Knapsack Problem is the topic of the present work. In this problem, in addition to profit and weight, each item is characterized by a probability of exploding, and therefore destroying all the contents of the knapsack, in case it is loaded. The optimization aims at maximizing the expected profit of the selected items, which takes into account also the probabilities of explosion, while fulfilling the capacity constraint. The problem has real-world applications in logistics and cloud computing.
In this work, two model-based algorithms are introduced. They are based on partial linearizations of a non-linear model describing the problem. Extensive computational results on the instances available in the literature are presented to position the new methods as the best-performing ones, while comparing against those previously proposed. |
| ArticleNumber | 107010 |
| Author | Smith, Derek H. Montemanni, Roberto |
| Author_xml | – sequence: 1 givenname: Roberto orcidid: 0000-0002-0229-0465 surname: Montemanni fullname: Montemanni, Roberto email: roberto.montemanni@unimore.it organization: Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, Via Amendola, 2, 42122 Reggio Emilia, Italy – sequence: 2 givenname: Derek H. orcidid: 0000-0002-8128-2067 surname: Smith fullname: Smith, Derek H. email: derek.smith@southwales.ac.uk organization: Computing and Mathematics, University of South Wales, Pontypridd CF37 1DL, Wales, UK |
| BookMark | eNqNj71OwzAUhT0UiRZ4ADa_gIvtJHYsxAAVf6IIhjJb_rmlLklc2QHUtydVmBF3ObrDd46-GZp0sQOEzhmdM8rExXbuYppzyqvhl5TRCZrSglaEVmV9jGY5b-lwkrMpunqOHhpiTQaPTfMeU-g3bcbrmHC_AUwJw6vQArmJrcVPndll4z7wa4q2gfYUHa1Nk-HsN0_Q293tavFAli_3j4vrJXG8lD2pKbeSKSGUVUw4MyxLyUwlnOCmLpkUqvSUF1B7oYQUrlBK1d7YmiuobFmcID72fnY7s_82TaN3KbQm7TWj-iCtt3qQ1gdpPUoPEBshl2LOCdb_Yi5HBgabrwBJZxegc-BDAtdrH8Mf9A-qyXAc |
| Cites_doi | 10.1016/j.cor.2004.03.002 10.1287/moor.1080.0330 10.1016/S0378-7753(01)00565-1 10.1007/s10107-011-0443-5 10.1016/j.cor.2024.106873 10.1016/j.cor.2022.105848 10.1016/j.ejor.2007.06.031 10.1057/jors.1979.27 10.1109/CIMSA.2003.1227196 10.1016/j.psep.2011.06.022 |
| ContentType | Journal Article |
| Copyright | 2025 The Author(s) |
| Copyright_xml | – notice: 2025 The Author(s) |
| DBID | 6I. AAFTH AAYXX CITATION ADTOC UNPAY |
| DOI | 10.1016/j.cor.2025.107010 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| ExternalDocumentID | 10.1016/j.cor.2025.107010 10_1016_j_cor_2025_107010 S0305054825000383 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6I. 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAFTH AAIKJ AAKOC AALRI AAOAW AAQXK AARIN AATTM AAXKI AAXUO AAYFN AAYOK ABAOU ABBOA ABDPE ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABWVN ABXDB ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACRPL ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD ADNMO AEBSH AEFWE AEHXG AEIPS AEKER AENEX AFFNX AFJKZ AFTJW AFXIZ AGCQF AGHFR AGQPQ AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AKRWK ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOMHK AOUOD APLSM APXCP ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC BNPGV CS3 DU5 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSH SSO SSV SSW SSZ T5K TAE TN5 U5U UPT VH1 WUQ XPP ZMT ~02 ~G- AAYWO AAYXX ACLOT ACVFH ADCNI AEUPX AFPUW AIGII AIIUN AKBMS AKYEP CITATION EFKBS EFLBG ~HD ADTOC UNPAY |
| ID | FETCH-LOGICAL-c247t-802b719669b916ca721771a56c62a8417694d023e8d69676c39998dab829e5b43 |
| IEDL.DBID | .~1 |
| ISSN | 0305-0548 1873-765X |
| IngestDate | Sun Oct 26 03:58:11 EDT 2025 Wed Oct 01 06:29:36 EDT 2025 Sat May 03 15:40:47 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Time-bomb Mixed integer linear programming Model-based algorithms 0-1 Knapsack |
| Language | English |
| License | This is an open access article under the CC BY license. cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c247t-802b719669b916ca721771a56c62a8417694d023e8d69676c39998dab829e5b43 |
| ORCID | 0000-0002-0229-0465 0000-0002-8128-2067 |
| OpenAccessLink | https://www.sciencedirect.com/science/article/pii/S0305054825000383 |
| ParticipantIDs | unpaywall_primary_10_1016_j_cor_2025_107010 crossref_primary_10_1016_j_cor_2025_107010 elsevier_sciencedirect_doi_10_1016_j_cor_2025_107010 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2025-06-01 |
| PublicationDateYYYYMMDD | 2025-06-01 |
| PublicationDate_xml | – month: 06 year: 2025 text: 2025-06-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2025 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Galli, Martello, Rey, Toth (b8) 2025; 173 Galli, Martello, Toth (b9) 2025 Mainville-Cohn, A., Barnhart, C., 1998. The stochastic knapsack problem with random weights: A heuristic approach to robust transportation planning. In: Proceedings of the Triennial Symposium on Transportation Analysis. pp. 1–13. Morton, Wood (b19) 1998 The Optimization Firm (b26) 2024 Dean, Goemans, Vondrák (b5) 2008; 4 Monaci, Pferschy (b16) 2003; 4 Pisinger (b21) 2005; 32 Srikantaiah, S., Kansal, A., Zhao, F., 2008. Energy-aware consolidation for cloud computing. In: Proceedings of the 2008 Usenix AnnualTechnical Conference. Donati, A.V., Montemanni, R., Gambardella, L.M., Rizzoli, A.E., 2003. Integration of a robust shortest path algorithm with a time dependent vehicle routing model and applications. In: Proceedings of the 3rd International Workshop on Scientific Use of Submarine Cables and Related Technologies. pp. 26–31. Santini (b23) 2024 Cacchiani, Iori, Locatelli, Martello (b3) 2022; 143 Santini (b22) 2020 Montemanni, Leggieri, Triki (b18) 2008; 190 Lisbona, Snee (b12) 2011; 6 Cacchiani, Iori, Locatelli, Martello (b2) 2022; 143 Farrington (b7) 2001; 1 Steinberg, Parks (b25) 1979; 2 Bertsimas, Sim (b1) 2003 Monaci, Pike-Burke, Santini (b17) 2022; 145 Merzifonluoglu, Geunes, Romeijn (b15) 2012; 134 COIN-OR (b4) 2024 Martello, Toth (b14) 1990 Hagberg, Swart, Chult (b11) 2008 Gurobi Optimization, LLC (b10) 2024 PassMark Software Pty Ltd (b20) 2024 Pisinger (10.1016/j.cor.2025.107010_b21) 2005; 32 Merzifonluoglu (10.1016/j.cor.2025.107010_b15) 2012; 134 Morton (10.1016/j.cor.2025.107010_b19) 1998 Steinberg (10.1016/j.cor.2025.107010_b25) 1979; 2 PassMark Software Pty Ltd (10.1016/j.cor.2025.107010_b20) 2024 Cacchiani (10.1016/j.cor.2025.107010_b2) 2022; 143 The Optimization Firm (10.1016/j.cor.2025.107010_b26) 2024 10.1016/j.cor.2025.107010_b13 Monaci (10.1016/j.cor.2025.107010_b17) 2022; 145 10.1016/j.cor.2025.107010_b6 Farrington (10.1016/j.cor.2025.107010_b7) 2001; 1 Martello (10.1016/j.cor.2025.107010_b14) 1990 Hagberg (10.1016/j.cor.2025.107010_b11) 2008 Santini (10.1016/j.cor.2025.107010_b22) 2020 Monaci (10.1016/j.cor.2025.107010_b16) 2003; 4 Montemanni (10.1016/j.cor.2025.107010_b18) 2008; 190 Galli (10.1016/j.cor.2025.107010_b8) 2025; 173 COIN-OR (10.1016/j.cor.2025.107010_b4) 2024 Galli (10.1016/j.cor.2025.107010_b9) 2025 Lisbona (10.1016/j.cor.2025.107010_b12) 2011; 6 10.1016/j.cor.2025.107010_b24 Bertsimas (10.1016/j.cor.2025.107010_b1) 2003 Gurobi Optimization, LLC (10.1016/j.cor.2025.107010_b10) 2024 Dean (10.1016/j.cor.2025.107010_b5) 2008; 4 Santini (10.1016/j.cor.2025.107010_b23) 2024 Cacchiani (10.1016/j.cor.2025.107010_b3) 2022; 143 |
| References_xml | – reference: Srikantaiah, S., Kansal, A., Zhao, F., 2008. Energy-aware consolidation for cloud computing. In: Proceedings of the 2008 Usenix AnnualTechnical Conference. – year: 2024 ident: b26 article-title: Baron solver – start-page: 149 year: 1998 end-page: 168 ident: b19 article-title: On a stochastic knapsack problem and generalizations publication-title: Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search – volume: 143 year: 2022 ident: b2 article-title: Knapsack problems — An overview of recent advances. Part I: Single knapsack problems publication-title: Comput. Oper. Res. – volume: 134 start-page: 459 year: 2012 end-page: 489 ident: b15 article-title: The static stochastic knapsack problem with normally distributed item sizes publication-title: Math. Program. – year: 2024 ident: b20 article-title: CPU benchmarks – year: 2008 ident: b11 article-title: Exploring Network Structure, Dynamics, and Function using NetworkX – volume: 4 start-page: 1956 year: 2003 end-page: 1982 ident: b16 article-title: On the robust knapsack problem publication-title: SIAM J. Optim. – year: 1990 ident: b14 article-title: Knapsack Problems: Algorithms and Computer Implementations – year: 2024 ident: b4 article-title: Couenne solver – year: 2020 ident: b22 article-title: The 0–1 time-bomb knapsack problem – volume: 190 start-page: 578 year: 2008 end-page: 585 ident: b18 article-title: Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks publication-title: European J. Oper. Res. – volume: 143 year: 2022 ident: b3 article-title: Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems publication-title: Comput. Oper. Res. – volume: 6 start-page: 434 year: 2011 end-page: 442 ident: b12 article-title: A review of hazards associated with primary lithium and lithium–ion batteries publication-title: Process. Saf. Environ. Prot. – reference: Mainville-Cohn, A., Barnhart, C., 1998. The stochastic knapsack problem with random weights: A heuristic approach to robust transportation planning. In: Proceedings of the Triennial Symposium on Transportation Analysis. pp. 1–13. – reference: Donati, A.V., Montemanni, R., Gambardella, L.M., Rizzoli, A.E., 2003. Integration of a robust shortest path algorithm with a time dependent vehicle routing model and applications. In: Proceedings of the 3rd International Workshop on Scientific Use of Submarine Cables and Related Technologies. pp. 26–31. – volume: 1 start-page: 260 year: 2001 end-page: 265 ident: b7 article-title: Safety of lithium batteries in transportation publication-title: J. Power Sources – volume: 145 year: 2022 ident: b17 article-title: Exact algorithms for the 0–1 time-bomb knapsack problem publication-title: Comput. Oper. Res. – start-page: 35 year: 2003 end-page: 53 ident: b1 article-title: The price of robustness publication-title: Oper. Res. – volume: 2 start-page: 141 year: 1979 end-page: 147 ident: b25 article-title: A preference order dynamic program for a knapsack problem with stochastic rewards publication-title: J. Oper. Res. Soc. – year: 2024 ident: b10 article-title: Gurobi 11.0 – volume: 4 start-page: 945 year: 2008 end-page: 964 ident: b5 article-title: Approximating the stochastic knapsack problem: The benefit of adaptivity publication-title: Math. Oper. Res. – year: 2025 ident: b9 article-title: The quadratic knapsack problem publication-title: European J. Oper. Res. – volume: 32 start-page: 2271 year: 2005 end-page: 2284 ident: b21 article-title: Where are the hard knapsack problems? publication-title: Comput. Oper. Res. – volume: 173 year: 2025 ident: b8 article-title: The quadratic knapsack problem with setup publication-title: Comput. Oper. Res. – year: 2024 ident: b23 article-title: Private communication – year: 2024 ident: 10.1016/j.cor.2025.107010_b20 – volume: 4 start-page: 1956 issue: 23 year: 2003 ident: 10.1016/j.cor.2025.107010_b16 article-title: On the robust knapsack problem publication-title: SIAM J. Optim. – start-page: 149 year: 1998 ident: 10.1016/j.cor.2025.107010_b19 article-title: On a stochastic knapsack problem and generalizations – year: 2024 ident: 10.1016/j.cor.2025.107010_b4 – year: 2024 ident: 10.1016/j.cor.2025.107010_b10 – volume: 32 start-page: 2271 issue: 9 year: 2005 ident: 10.1016/j.cor.2025.107010_b21 article-title: Where are the hard knapsack problems? publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2004.03.002 – volume: 4 start-page: 945 issue: 33 year: 2008 ident: 10.1016/j.cor.2025.107010_b5 article-title: Approximating the stochastic knapsack problem: The benefit of adaptivity publication-title: Math. Oper. Res. doi: 10.1287/moor.1080.0330 – year: 1990 ident: 10.1016/j.cor.2025.107010_b14 – volume: 143 year: 2022 ident: 10.1016/j.cor.2025.107010_b2 article-title: Knapsack problems — An overview of recent advances. Part I: Single knapsack problems publication-title: Comput. Oper. Res. – ident: 10.1016/j.cor.2025.107010_b13 – volume: 1 start-page: 260 issue: 96 year: 2001 ident: 10.1016/j.cor.2025.107010_b7 article-title: Safety of lithium batteries in transportation publication-title: J. Power Sources doi: 10.1016/S0378-7753(01)00565-1 – volume: 134 start-page: 459 issue: 2 year: 2012 ident: 10.1016/j.cor.2025.107010_b15 article-title: The static stochastic knapsack problem with normally distributed item sizes publication-title: Math. Program. doi: 10.1007/s10107-011-0443-5 – year: 2025 ident: 10.1016/j.cor.2025.107010_b9 article-title: The quadratic knapsack problem publication-title: European J. Oper. Res. – volume: 173 year: 2025 ident: 10.1016/j.cor.2025.107010_b8 article-title: The quadratic knapsack problem with setup publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2024.106873 – volume: 145 year: 2022 ident: 10.1016/j.cor.2025.107010_b17 article-title: Exact algorithms for the 0–1 time-bomb knapsack problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2022.105848 – year: 2020 ident: 10.1016/j.cor.2025.107010_b22 – start-page: 35 issue: 52 year: 2003 ident: 10.1016/j.cor.2025.107010_b1 article-title: The price of robustness publication-title: Oper. Res. – volume: 190 start-page: 578 issue: 2 year: 2008 ident: 10.1016/j.cor.2025.107010_b18 article-title: Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2007.06.031 – year: 2024 ident: 10.1016/j.cor.2025.107010_b23 – ident: 10.1016/j.cor.2025.107010_b24 – volume: 2 start-page: 141 issue: 30 year: 1979 ident: 10.1016/j.cor.2025.107010_b25 article-title: A preference order dynamic program for a knapsack problem with stochastic rewards publication-title: J. Oper. Res. Soc. doi: 10.1057/jors.1979.27 – year: 2008 ident: 10.1016/j.cor.2025.107010_b11 – ident: 10.1016/j.cor.2025.107010_b6 doi: 10.1109/CIMSA.2003.1227196 – volume: 6 start-page: 434 issue: 89 year: 2011 ident: 10.1016/j.cor.2025.107010_b12 article-title: A review of hazards associated with primary lithium and lithium–ion batteries publication-title: Process. Saf. Environ. Prot. doi: 10.1016/j.psep.2011.06.022 – year: 2024 ident: 10.1016/j.cor.2025.107010_b26 – volume: 143 year: 2022 ident: 10.1016/j.cor.2025.107010_b3 article-title: Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems publication-title: Comput. Oper. Res. |
| SSID | ssj0000721 |
| Score | 2.4662447 |
| Snippet | A stochastic version of the 0–1 Knapsack Problem recently introduced in the literature and named the 0–1 Time-Bomb Knapsack Problem is the topic of the present... |
| SourceID | unpaywall crossref elsevier |
| SourceType | Open Access Repository Index Database Publisher |
| StartPage | 107010 |
| SubjectTerms | 0-1 Knapsack Mixed integer linear programming Model-based algorithms Time-bomb |
| SummonAdditionalLinks | – databaseName: Unpaywall dbid: UNPAY link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA7Sgo-D1apYX-TgSUnp7maT7MFDFYsolB4s1NOSZLM-ut2Wdovor3f2JVV8HgP7YjLZ7xvmmxmEjm0ujQqES6wglISGNCSAcoo4mklwKRVaMuv22WVXfXo9cAdFs-i0FuZD_j7TYUEQBmGc7cKaZ8VUVeYC7a6gar_ba9_lWQKXAPXIyt4Edwhn7qDMYH71jO8waGUeT-TLs4yiBYzp1HJ11ixrTZhKS4bNeaKa-vVT48Y_ff4GWi-YJm7nrrGJlkxcR8ul0L2OauVAB1yc7zpaW-hOuIXO0jlpEUlxLsAyuh9PH5OH0QwDzcVAG3GLWDitICHn45HCN7GczKQe4l4-omYb9TuXtxdXpJi2QLRNeQJQZSsO55F5CiijlhAacm5Jl2lmS0EtzjwaAMIbETCPcaaB2ngikErYnnEVdXZQJR7HZhdhyYXRDrVbVCsqqKeMofBjpZ5FDYSPooFOSvv7k7yphl-qzZ58sJifWszPLdZAtNwhv2AFOdr7YOyfbjt9383fX7L3r6v30Wq6yhVjB6iSTOfmELhJoo4Kr3wDIAbX9g priority: 102 providerName: Unpaywall |
| Title | Model-based algorithms for the 0-1 Time-Bomb Knapsack Problem |
| URI | https://dx.doi.org/10.1016/j.cor.2025.107010 https://doi.org/10.1016/j.cor.2025.107010 |
| UnpaywallVersion | publishedVersion |
| Volume | 178 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) issn: 1873-765X databaseCode: GBLVA dateStart: 20110101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0000721 providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier ScienceDirect issn: 1873-765X databaseCode: .~1 dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0000721 providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Complete Freedom Collection [SCCMFC] issn: 1873-765X databaseCode: ACRLP dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0000721 providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] issn: 1873-765X databaseCode: AIKHN dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0000721 providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals issn: 1873-765X databaseCode: AKRWK dateStart: 19740101 customDbUrl: isFulltext: true mediaType: online dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000721 providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEB5EwcfBR1V8lhw8KbHd7Wyye_BQi6VaKAUt6GlJdlOt1m3RinjxtzvZh1YQBU9LlixZviQz3zAvgANXKqNj3-NO3Fcc-9jnpOU0r0VC0ZHSfUel1T47otXDi2vvegYaRS6MDavMZX8m01Npnb-p5GhWxoNB5dIeVSIcZOKk_i1b8RNR2i4Gx-9fYR62_lfmSfC4nV14NtMYLzLwyER0PRrLqk2i_Vk3LbwkY_X2qobDKd3TXIXlnDSyevZfazBjkhLMFzHrJVgpejOw_KqWYGmq0OA6nNiWZ0NuVVbM1PB29DSY3D0-M2KsjBggq3KH2WQQfjp61KydqPGzih5YN-s2swG95tlVo8Xzxgk8clFOSOu4WtLVEoEm9hcpgkBKR3kiEq7y0ZEiwJiUtfFjEQgpImIpgR8r7buB8TTWNmE2GSVmC5iSvolq6FYx0uhjoI1BkpEYOGjIEvS34bCALBxn9THCInDsPiR8Q4tvmOG7DViAGn7b5JDk92-fHX1uwN-L7PxvkV1YtKMsCmwPZidPL2af-MZEl9MDVYa5-nm71aFnr9Ot33wArcjQ4Q |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1JS8NAFH7UCi4Hl6q4OwdPytgmmcwkBw8qSrW1CLbgLcwkU622aWgr4sXf7pssLiAKHrMx4Zs3732PtwHs20JqFXkutaKupKzLuhStnKJOyCWKlOpaMu322eL1Dru6c-9KcFbUwpi0ylz3Zzo91db5nWqOZjXp9aq3RlSRcKCLk8a3nCmYZq4tjAd29PaZ52EagGWhBJea14vQZprkhR4e-oi2i9eiZqpofzZOs89xIl9fZL__xfhcLMFCzhrJSfZjy1DScQVmiqT1CiwWwxlIflYrMP-l0-AKHJuZZ31qbFZEZP9-OOpNHgZjgpSVIAUkNWoRUw1CT4cDRRqxTMYyfCI32biZVehcnLfP6jSfnEBDm4kJmh1bCTxb3FdI_0KJEAhhSZeH3JYeswT3WYTWWnsR97ngIdIU34uk8mxfu4o5a1COh7FeByKFp0OH2TUWKuYxX2nNUEky32IaXUFvAw4KyIIka5ARFJljjwHiGxh8gwzfDWAFqMG3XQ5Qgf_22eHHBvy9yOb_FtmD2Xr7uhk0L1uNLZgzT7KUsG0oT0bPegfJx0TtpsL1Di1H0MY |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA7Sgo-D1apYX-TgSUnp7maT7MFDFYsolB4s1NOSZLM-ut2Wdovor3f2JVV8HgP7YjLZ7xvmmxmEjm0ujQqES6wglISGNCSAcoo4mklwKRVaMuv22WVXfXo9cAdFs-i0FuZD_j7TYUEQBmGc7cKaZ8VUVeYC7a6gar_ba9_lWQKXAPXIyt4Edwhn7qDMYH71jO8waGUeT-TLs4yiBYzp1HJ11ixrTZhKS4bNeaKa-vVT48Y_ff4GWi-YJm7nrrGJlkxcR8ul0L2OauVAB1yc7zpaW-hOuIXO0jlpEUlxLsAyuh9PH5OH0QwDzcVAG3GLWDitICHn45HCN7GczKQe4l4-omYb9TuXtxdXpJi2QLRNeQJQZSsO55F5CiijlhAacm5Jl2lmS0EtzjwaAMIbETCPcaaB2ngikErYnnEVdXZQJR7HZhdhyYXRDrVbVCsqqKeMofBjpZ5FDYSPooFOSvv7k7yphl-qzZ58sJifWszPLdZAtNwhv2AFOdr7YOyfbjt9383fX7L3r6v30Wq6yhVjB6iSTOfmELhJoo4Kr3wDIAbX9g |
| 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=Model-based+algorithms+for+the+0-1+Time-Bomb+Knapsack+Problem&rft.jtitle=Computers+%26+operations+research&rft.au=Montemanni%2C+Roberto&rft.au=Smith%2C+Derek+H.&rft.date=2025-06-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.volume=178&rft_id=info:doi/10.1016%2Fj.cor.2025.107010&rft.externalDocID=S0305054825000383 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |