Discrete multi-module capacitated lot-sizing problems with multiple items
We study single-item discrete multi-module capacitated lot-sizing problems without and with backlogging where the amount produced in each time period is equal to the summation of binary multiples of the capacities of n available different modules (or machines). For fixed n≥2, we develop fixed-parame...
Gespeichert in:
| Veröffentlicht in: | Operations research letters Jg. 50; H. 2; S. 168 - 175 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.03.2022
|
| Schlagworte: | |
| ISSN: | 0167-6377, 1872-7468 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We study single-item discrete multi-module capacitated lot-sizing problems without and with backlogging where the amount produced in each time period is equal to the summation of binary multiples of the capacities of n available different modules (or machines). For fixed n≥2, we develop fixed-parameter tractable (polynomial) exact algorithms that generalize the algorithms of van Vyve (2007) for n=1. We utilize these algorithms within a Lagrangian decomposition framework to solve their multi-item versions. Our algorithms are computationally efficient and stable, in comparison to Gurobi 9.0. |
|---|---|
| AbstractList | We study single-item discrete multi-module capacitated lot-sizing problems without and with backlogging where the amount produced in each time period is equal to the summation of binary multiples of the capacities of n available different modules (or machines). For fixed n≥2, we develop fixed-parameter tractable (polynomial) exact algorithms that generalize the algorithms of van Vyve (2007) for n=1. We utilize these algorithms within a Lagrangian decomposition framework to solve their multi-item versions. Our algorithms are computationally efficient and stable, in comparison to Gurobi 9.0. |
| Author | Kulkarni, Kartik Bansal, Manish |
| Author_xml | – sequence: 1 givenname: Kartik surname: Kulkarni fullname: Kulkarni, Kartik email: kartikrf@vt.edu – sequence: 2 givenname: Manish orcidid: 0000-0002-5617-3862 surname: Bansal fullname: Bansal, Manish email: bansal@vt.edu |
| BookMark | eNp9kMtOwzAQRS1UJErhA9jlBxL8diJWqLwqVWIDa8t1JuAqiSPbBcHX41JWLLoazeieke45R7PRj4DQFcEVwURebysf-opiSitMKozpCZqTWtFScVnP0DxnVCmZUmfoPMYtxljVpJ6j1Z2LNkCCYtj1yZWDb3c9FNZMxrpkErRF71MZ3bcb34op-E0PQyw-XXo_EFNOu5RvF-i0M32Ey7-5QK8P9y_Lp3L9_Lha3q5Ly2iTSqE4JcQyK40UhAogTcu5YBshNl0r8s4tU5R0teAY1w1jUtGOSmswYw1wtkDk8NcGH2OATk_BDSZ8aYL13oXe6uxC711oTHR2kRn1j_kt5_yYgnH9UfLmQEKu9OEg6GgdjBZaF8Am3Xp3hP4BkLZ7HQ |
| CitedBy_id | crossref_primary_10_1007_s10479_024_05903_y crossref_primary_10_1080_01605682_2025_2537887 crossref_primary_10_1080_17517575_2024_2406008 crossref_primary_10_1016_j_cor_2025_107169 crossref_primary_10_1080_24725854_2022_2153948 |
| Cites_doi | 10.1287/mnsc.1040.0263 10.1287/moor.18.4.767 10.1016/0166-218X(92)00182-L 10.1016/S0167-6377(96)00043-0 10.1016/j.dam.2018.07.029 10.1287/opre.1080.0535 10.1287/moor.1070.0257 10.1007/PL00011430 10.1287/opre.51.4.557.16094 10.1016/j.ejor.2017.05.008 10.1287/ijoc.2014.0597 10.1016/0377-2217(90)90245-7 10.1137/16M1083955 10.1007/s10107-015-0906-1 10.1016/j.disopt.2012.07.003 |
| ContentType | Journal Article |
| Copyright | 2022 Elsevier B.V. |
| Copyright_xml | – notice: 2022 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.orl.2022.01.002 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) |
| EISSN | 1872-7468 |
| EndPage | 175 |
| ExternalDocumentID | 10_1016_j_orl_2022_01_002 S0167637722000025 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1OL 1RT 1~. 1~5 29N 4.4 457 4G. 4R4 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABAOU ABFNM ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNCT ACRLP ADBBV ADEZE ADGUI ADIYS ADMUD AEBSH AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SDS SES SEW SPC SPCBC SSB SSD SSW SSZ T5K TN5 WH7 WUQ XPP XSW ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c329t-574211c3c6a65125e19d4453b55bfd55e14c3721f854008933672f26ca0339e43 |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000797923900012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0167-6377 |
| IngestDate | Sat Nov 29 07:22:07 EST 2025 Tue Nov 18 21:28:00 EST 2025 Fri Feb 23 02:40:15 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Multi-module capacitated lot-sizing with backlogging Dynamic programming Concave production and holding costs Multi-item discrete lot-sizing problem Fixed-parameter tractable algorithm |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c329t-574211c3c6a65125e19d4453b55bfd55e14c3721f854008933672f26ca0339e43 |
| ORCID | 0000-0002-5617-3862 |
| PageCount | 8 |
| ParticipantIDs | crossref_primary_10_1016_j_orl_2022_01_002 crossref_citationtrail_10_1016_j_orl_2022_01_002 elsevier_sciencedirect_doi_10_1016_j_orl_2022_01_002 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-03-01 |
| PublicationDateYYYYMMDD | 2022-03-01 |
| PublicationDate_xml | – month: 03 year: 2022 text: 2022-03-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Operations research letters |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Van Hoesel, Kuik, Salomon, Van Wassenhove (br0150) 1994; 48 Bansal, Huang, Mehrotra (br0250) 2018; 28 Wolsey (br0220) 1998 van Eijl, van Hoesel (br0130) 1997; 20 van Eijl (br0140) 1996 Fleischmann (br0120) 1990; 44 van Vyve (br0040) 2007; 32 Pochet, Wolsey (br0170) 1993; 18 Downey, Fellows (br0050) 2012 Bitran, Yanasse (br0110) 1982 Bansal (br0200) 2019; 255 Bansal, Kianfar (br0190) 2015; 154 Kulkarni, Bansal (br0080) 2019 Pochet, Wolsey (br0010) 2006 Bertsekas, Hager, Mangasarian (br0090) 1998 Florian, Klein (br0160) 1971 Miller, Wolsey (br0030) 2003; 51 Flum, Grohe (br0060) 2006 Günlük, Pochet (br0240) 2001; 90 Koca, Yaman, Aktürk (br0070) 2014; 26 Fisher (br0210) 2004; 50 Sanjeevi, Kianfar (br0180) 2012; 9 Brahimi, Absi, Dauzère-Pérès, Nordli (br0020) 2017; 263 Guan, Ahmed, Nemhauser (br0230) 2008; 57 Florian, Lenstra, Rinnooy Kan (br0100) 1980 Florian (10.1016/j.orl.2022.01.002_br0160) 1971 Bansal (10.1016/j.orl.2022.01.002_br0190) 2015; 154 Guan (10.1016/j.orl.2022.01.002_br0230) 2008; 57 Wolsey (10.1016/j.orl.2022.01.002_br0220) 1998 Sanjeevi (10.1016/j.orl.2022.01.002_br0180) 2012; 9 van Eijl (10.1016/j.orl.2022.01.002_br0130) 1997; 20 Fleischmann (10.1016/j.orl.2022.01.002_br0120) 1990; 44 Kulkarni (10.1016/j.orl.2022.01.002_br0080) 2019 van Eijl (10.1016/j.orl.2022.01.002_br0140) 1996 Downey (10.1016/j.orl.2022.01.002_br0050) 2012 Pochet (10.1016/j.orl.2022.01.002_br0170) 1993; 18 Van Hoesel (10.1016/j.orl.2022.01.002_br0150) 1994; 48 Fisher (10.1016/j.orl.2022.01.002_br0210) 2004; 50 van Vyve (10.1016/j.orl.2022.01.002_br0040) 2007; 32 Pochet (10.1016/j.orl.2022.01.002_br0010) 2006 Florian (10.1016/j.orl.2022.01.002_br0100) 1980 Bertsekas (10.1016/j.orl.2022.01.002_br0090) 1998 Bitran (10.1016/j.orl.2022.01.002_br0110) 1982 Günlük (10.1016/j.orl.2022.01.002_br0240) 2001; 90 Bansal (10.1016/j.orl.2022.01.002_br0250) 2018; 28 Koca (10.1016/j.orl.2022.01.002_br0070) 2014; 26 Miller (10.1016/j.orl.2022.01.002_br0030) 2003; 51 Flum (10.1016/j.orl.2022.01.002_br0060) 2006 Bansal (10.1016/j.orl.2022.01.002_br0200) 2019; 255 Brahimi (10.1016/j.orl.2022.01.002_br0020) 2017; 263 |
| References_xml | – year: 2006 ident: br0060 article-title: Parameterized Complexity Theory publication-title: Texts in Theoretical Computer Science. An EATCS Series – year: 2019 ident: br0080 article-title: Multi-module capacitated lot-sizing problem, and its generalizations with two-echelons and piecewise concave production costs – volume: 255 start-page: 117 year: 2019 end-page: 141 ident: br0200 article-title: Facets for single module and multi-module capacitated lot-sizing problems without backlogging publication-title: Discrete Appl. Math. – volume: 28 start-page: 788 year: 2018 end-page: 819 ident: br0250 article-title: Tight second-stage formulations for two-stage stochastic mixed integer programming problems publication-title: SIAM J. Optim. – volume: 48 start-page: 289 year: 1994 end-page: 303 ident: br0150 article-title: The single-item discrete lotsizing and scheduling problem: optimization by linear and dynamic programming publication-title: Discrete Appl. Math. – year: 1996 ident: br0140 article-title: A polyhedral approach to the discrete lot-sizing and scheduling problem – volume: 57 start-page: 287 year: 2008 end-page: 298 ident: br0230 article-title: Cutting planes for multistage stochastic integer programs publication-title: Oper. Res. – year: 1998 ident: br0090 article-title: Nonlinear Programming – year: 2012 ident: br0050 article-title: Parameterized Complexity – volume: 154 start-page: 113 year: 2015 end-page: 144 ident: br0190 article-title: -step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem publication-title: Math. Program. – start-page: 1174 year: 1982 end-page: 1186 ident: br0110 article-title: Computational Complexity of the Capacitated Lot Size Problem, Vol. 28 – year: 2006 ident: br0010 article-title: Production Planning by Mixed Integer Programming – volume: 51 start-page: 557 year: 2003 end-page: 565 ident: br0030 article-title: Tight MIP formulation for multi-item discrete lot-sizing problems publication-title: Oper. Res. – volume: 44 start-page: 337 year: 1990 end-page: 348 ident: br0120 article-title: The discrete lot-sizing and scheduling problem publication-title: Eur. J. Oper. Res. – year: 1998 ident: br0220 article-title: Integer Programming – volume: 26 start-page: 767 year: 2014 end-page: 779 ident: br0070 article-title: Lot sizing with piecewise concave production costs publication-title: INFORMS J. Comput. – volume: 90 start-page: 429 year: 2001 end-page: 457 ident: br0240 article-title: Mixing mixed-integer inequalities publication-title: Math. Program. – volume: 50 start-page: 1861 year: 2004 end-page: 1871 ident: br0210 article-title: The Lagrangian relaxation method for solving integer programming problems publication-title: Manag. Sci. – volume: 18 start-page: 767 year: 1993 end-page: 785 ident: br0170 article-title: Lot-sizing with constant batches: formulation and valid inequalities publication-title: Math. Oper. Res. – volume: 32 start-page: 594 year: 2007 end-page: 613 ident: br0040 article-title: Algorithms for single-item lot-sizing problems with constant batch size publication-title: Math. Oper. Res. – volume: 9 start-page: 216 year: 2012 end-page: 235 ident: br0180 article-title: Mixed publication-title: Discrete Optim. – volume: 20 start-page: 7 year: 1997 end-page: 13 ident: br0130 article-title: On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs publication-title: Oper. Res. Lett. – start-page: 669 year: 1980 end-page: 679 ident: br0100 article-title: Deterministic Production Planning: Algorithms and Complexity, Vol. 26 – volume: 263 start-page: 838 year: 2017 end-page: 863 ident: br0020 article-title: Single-item dynamic lot-sizing problems: an updated survey publication-title: Eur. J. Oper. Res. – start-page: 12 year: 1971 end-page: 20 ident: br0160 article-title: Deterministic Production Planning with Concave Costs and Capacity Constraints, Vol. 18 – year: 1998 ident: 10.1016/j.orl.2022.01.002_br0220 – year: 2006 ident: 10.1016/j.orl.2022.01.002_br0060 article-title: Parameterized Complexity Theory – start-page: 12 year: 1971 ident: 10.1016/j.orl.2022.01.002_br0160 – year: 2019 ident: 10.1016/j.orl.2022.01.002_br0080 – volume: 50 start-page: 1861 issue: 12 year: 2004 ident: 10.1016/j.orl.2022.01.002_br0210 article-title: The Lagrangian relaxation method for solving integer programming problems publication-title: Manag. Sci. doi: 10.1287/mnsc.1040.0263 – volume: 18 start-page: 767 year: 1993 ident: 10.1016/j.orl.2022.01.002_br0170 article-title: Lot-sizing with constant batches: formulation and valid inequalities publication-title: Math. Oper. Res. doi: 10.1287/moor.18.4.767 – volume: 48 start-page: 289 issue: 3 year: 1994 ident: 10.1016/j.orl.2022.01.002_br0150 article-title: The single-item discrete lotsizing and scheduling problem: optimization by linear and dynamic programming publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(92)00182-L – volume: 20 start-page: 7 issue: 1 year: 1997 ident: 10.1016/j.orl.2022.01.002_br0130 article-title: On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs publication-title: Oper. Res. Lett. doi: 10.1016/S0167-6377(96)00043-0 – volume: 255 start-page: 117 year: 2019 ident: 10.1016/j.orl.2022.01.002_br0200 article-title: Facets for single module and multi-module capacitated lot-sizing problems without backlogging publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2018.07.029 – year: 1998 ident: 10.1016/j.orl.2022.01.002_br0090 – volume: 57 start-page: 287 issue: 2 year: 2008 ident: 10.1016/j.orl.2022.01.002_br0230 article-title: Cutting planes for multistage stochastic integer programs publication-title: Oper. Res. doi: 10.1287/opre.1080.0535 – volume: 32 start-page: 594 issue: 3 year: 2007 ident: 10.1016/j.orl.2022.01.002_br0040 article-title: Algorithms for single-item lot-sizing problems with constant batch size publication-title: Math. Oper. Res. doi: 10.1287/moor.1070.0257 – year: 2012 ident: 10.1016/j.orl.2022.01.002_br0050 – volume: 90 start-page: 429 issue: 3 year: 2001 ident: 10.1016/j.orl.2022.01.002_br0240 article-title: Mixing mixed-integer inequalities publication-title: Math. Program. doi: 10.1007/PL00011430 – volume: 51 start-page: 557 issue: 4 year: 2003 ident: 10.1016/j.orl.2022.01.002_br0030 article-title: Tight MIP formulation for multi-item discrete lot-sizing problems publication-title: Oper. Res. doi: 10.1287/opre.51.4.557.16094 – volume: 263 start-page: 838 issue: 3 year: 2017 ident: 10.1016/j.orl.2022.01.002_br0020 article-title: Single-item dynamic lot-sizing problems: an updated survey publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2017.05.008 – volume: 26 start-page: 767 issue: 4 year: 2014 ident: 10.1016/j.orl.2022.01.002_br0070 article-title: Lot sizing with piecewise concave production costs publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2014.0597 – year: 2006 ident: 10.1016/j.orl.2022.01.002_br0010 – volume: 44 start-page: 337 issue: 3 year: 1990 ident: 10.1016/j.orl.2022.01.002_br0120 article-title: The discrete lot-sizing and scheduling problem publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(90)90245-7 – start-page: 1174 year: 1982 ident: 10.1016/j.orl.2022.01.002_br0110 – volume: 28 start-page: 788 year: 2018 ident: 10.1016/j.orl.2022.01.002_br0250 article-title: Tight second-stage formulations for two-stage stochastic mixed integer programming problems publication-title: SIAM J. Optim. doi: 10.1137/16M1083955 – volume: 154 start-page: 113 issue: 1 year: 2015 ident: 10.1016/j.orl.2022.01.002_br0190 article-title: n-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem publication-title: Math. Program. doi: 10.1007/s10107-015-0906-1 – year: 1996 ident: 10.1016/j.orl.2022.01.002_br0140 – volume: 9 start-page: 216 issue: 4 year: 2012 ident: 10.1016/j.orl.2022.01.002_br0180 article-title: Mixed n-step MIR inequalities: facets for the n-mixing set publication-title: Discrete Optim. doi: 10.1016/j.disopt.2012.07.003 – start-page: 669 year: 1980 ident: 10.1016/j.orl.2022.01.002_br0100 |
| SSID | ssj0007818 |
| Score | 2.340938 |
| Snippet | We study single-item discrete multi-module capacitated lot-sizing problems without and with backlogging where the amount produced in each time period is equal... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 168 |
| SubjectTerms | Concave production and holding costs Dynamic programming Fixed-parameter tractable algorithm Multi-item discrete lot-sizing problem Multi-module capacitated lot-sizing with backlogging |
| Title | Discrete multi-module capacitated lot-sizing problems with multiple items |
| URI | https://dx.doi.org/10.1016/j.orl.2022.01.002 |
| Volume | 50 |
| WOSCitedRecordID | wos000797923900012&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: 1872-7468 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007818 issn: 0167-6377 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELbKlgM9VLSAKAXkAwceMnL8iONjBUVtDwWJIu0tShxHTUmzq02KKn4949jJRhQqQOISZaN4N-v5Mv5mPA-EXggmCpoYSnIrBQHtp0kmtSawVma5pSa3UdY3m1Cnp8l8rj-FON22byegmia5vtbL_ypquAbCdqmzfyHu8UvhApyD0OEIYofjHwn-fQWaAKiwjxUkl4viqnbBXWAcu3wyIJj1oiNt9d3noff9ZEKO2xhdWI1VzANv_bi0qxA0F8oDnb-p-0ygyWZQ_dW5WUKKWVetc4BcS_LaZwY1VXs-9TSAkTqGWnn3140UGO-RBE0b89CLxXotmiig7cL3yxnUrK8vG-DEJjozCvf55TfyjVRuaHbvZLh4u1i5DSPG-mKrlK2XsTG48LN7JPdEzKUhAae7gzaZAsNphjYPjg_nJ-NKrZLe_zv-hWHXu4__--mHfs1bJlzk7D7aDkYEPvDC30EbttlFW5PSkrtoJyjtFr8MlcVfPUDHAzbwFBt4gg28xgYesIEdNvCADdxj4yH68uHw7N0RCb00iOFMd0QqAaa-4SbOYuB40ka6EELyXMq8LCR8FoYrFpUJUHgKJJbHipUsNhnlXFvBH6FZs2jsY4SF0WB25yo3JRNZQfPMyljZJFLKlLHK9hAdZio1odC863dSp0NE4UUKk5u6yU1plMLk7qHX45Clr7Jy281imP400ERP_1LAyu-HPfm3Yfvo3vpdeIpm3erKPkN3zbeualfPA6J-AMMIi38 |
| 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=Discrete+multi-module+capacitated+lot-sizing+problems+with+multiple+items&rft.jtitle=Operations+research+letters&rft.au=Kulkarni%2C+Kartik&rft.au=Bansal%2C+Manish&rft.date=2022-03-01&rft.pub=Elsevier+B.V&rft.issn=0167-6377&rft.eissn=1872-7468&rft.volume=50&rft.issue=2&rft.spage=168&rft.epage=175&rft_id=info:doi/10.1016%2Fj.orl.2022.01.002&rft.externalDocID=S0167637722000025 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-6377&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-6377&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-6377&client=summon |