Competitive hub location problem: Model and solution approaches
•We study the hub location problem faced by an airline entering a competitive market in single and multiple allocation network setting.•The problem is modelled as a non-linear integer program.•We propose four different approaches to solve it.•Our best performing method uses Kelley’s cutting plane wi...
Gespeichert in:
| Veröffentlicht in: | Transportation research. Part B: methodological Jg. 146; S. 237 - 261 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Oxford
Elsevier Ltd
01.04.2021
Elsevier Science Ltd |
| Schlagworte: | |
| ISSN: | 0191-2615, 1879-2367 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | •We study the hub location problem faced by an airline entering a competitive market in single and multiple allocation network setting.•The problem is modelled as a non-linear integer program.•We propose four different approaches to solve it.•Our best performing method uses Kelley’s cutting plane within Lagrangian relaxation.•We are able to solve instances upto 50 nodes from AP data-set within 120 and 10 min of CPU time for single and multiple allocation settings, respectively.
In this paper, we study the hub location problem of an airline that wants to set up its hub and spoke network, in order to maximize its market share in a competitive market. The market share is maximized under the assumption that customers choose amongst competing airlines on the basis of utility provided by the respective airlines. We provide model formulations for the airline’s problem for two alternate network settings: one in the multiple allocation setting and another in the single allocation setting. Both these formulations are non-linear integer programs, which are intractable for most of the off-the-shelf commercial solvers. We propose two alternate approaches for each of the formulations to solve them optimally. The first among them is based on a mixed integer second order conic program reformulation, and the second uses Kelley’s cutting plane method within Lagrangian relaxation. On the basis of extensive numerical tests on well-known data-sets (CAB and AP), we conclude that the Kelley’s cutting plane within Lagrangian relaxation is computationally the best for both the single and multiple allocation settings, especially for large instances. We are able to solve instances upto 50 nodes from AP data-set within 120 and 10 minutes of CPU time for single and multiple allocation settings, respectively, which were unsolved by mixed integer second order cone based reformulation or Kelley’s cutting plane algorithm in the maximum allowed CPU time (3 hours for single allocation and 1 hour for multiple allocation). |
|---|---|
| AbstractList | In this paper, we study the hub location problem of an airline that wants to set up its hub and spoke network, in order to maximize its market share in a competitive market. The market share is maximized under the assumption that customers choose amongst competing airlines on the basis of utility provided by the respective airlines. We provide model formulations for the airline's problem for two alternate network settings: one in the multiple allocation setting and another in the single allocation setting. Both these formulations are non-linear integer programs, which are intractable for most of the off-the-shelf commercial solvers. We propose two alternate approaches for each of the formulations to solve them optimally. The first among them is based on a mixed integer second order conic program reformulation, and the second uses Kelley's cutting plane method within Lagrangian relaxation. On the basis of extensive numerical tests on well-known data-sets (CAB and AP), we conclude that the Kelley's cutting plane within Lagrangian relaxation is computationally the best for both the single and multiple allocation settings, especially for large instances. We are able to solve instances upto 50 nodes from AP data-set within 120 and 10 minutes of CPU time for single and multiple allocation settings, respectively, which were unsolved by mixed integer second order cone based reformulation or Kelley's cutting plane algorithm in the maximum allowed CPU time (3 hours for single allocation and 1 hour for multiple allocation). •We study the hub location problem faced by an airline entering a competitive market in single and multiple allocation network setting.•The problem is modelled as a non-linear integer program.•We propose four different approaches to solve it.•Our best performing method uses Kelley’s cutting plane within Lagrangian relaxation.•We are able to solve instances upto 50 nodes from AP data-set within 120 and 10 min of CPU time for single and multiple allocation settings, respectively. In this paper, we study the hub location problem of an airline that wants to set up its hub and spoke network, in order to maximize its market share in a competitive market. The market share is maximized under the assumption that customers choose amongst competing airlines on the basis of utility provided by the respective airlines. We provide model formulations for the airline’s problem for two alternate network settings: one in the multiple allocation setting and another in the single allocation setting. Both these formulations are non-linear integer programs, which are intractable for most of the off-the-shelf commercial solvers. We propose two alternate approaches for each of the formulations to solve them optimally. The first among them is based on a mixed integer second order conic program reformulation, and the second uses Kelley’s cutting plane method within Lagrangian relaxation. On the basis of extensive numerical tests on well-known data-sets (CAB and AP), we conclude that the Kelley’s cutting plane within Lagrangian relaxation is computationally the best for both the single and multiple allocation settings, especially for large instances. We are able to solve instances upto 50 nodes from AP data-set within 120 and 10 minutes of CPU time for single and multiple allocation settings, respectively, which were unsolved by mixed integer second order cone based reformulation or Kelley’s cutting plane algorithm in the maximum allowed CPU time (3 hours for single allocation and 1 hour for multiple allocation). |
| Author | Sinha, Ankur Jayaswal, Sachin Tiwari, Richa |
| Author_xml | – sequence: 1 givenname: Richa surname: Tiwari fullname: Tiwari, Richa email: richat@iima.ac.in – sequence: 2 givenname: Sachin surname: Jayaswal fullname: Jayaswal, Sachin – sequence: 3 givenname: Ankur surname: Sinha fullname: Sinha, Ankur |
| BookMark | eNp9kEtPwzAQhC1UJNrCD-AWiXOCHSd2AgeEKl5SERc4W35sVEdpXGynEv-epOXEodJIe9j9djSzQLPe9YDQNcEZwYTdtln0KstxTjI8KT9Dc1LxOs0p4zM0x6Qmac5IeYEWIbQYY1pgMkcPK7fdQbTR7iHZDCrpnJbRuj7Zeac62N4l785Al8jeJMF1w2End-NW6g2ES3TeyC7A1d9coq_np8_Va7r-eHlbPa5TTcsqpooZBdoUkhWlUiavGtBUUVAcM8llU0nWAKmBNApzKA2UlBW0pLxqGJa4oUt0c_w7Gn8PEKJo3eD70VKMqTAhBa_z8Yocr7R3IXhoxM7brfQ_gmAx9SRaMfYkpp4EnjQx_B-jbTxUEL203Uny_kjCGHxvwYugLfQajPWgozDOnqB_AUj0hTU |
| CitedBy_id | crossref_primary_10_1080_00207543_2022_2098073 crossref_primary_10_3390_su17156982 crossref_primary_10_1016_j_tre_2025_104285 crossref_primary_10_1016_j_tre_2024_103882 crossref_primary_10_1007_s11067_024_09622_6 crossref_primary_10_3390_aerospace12070574 crossref_primary_10_1016_j_tre_2024_103940 crossref_primary_10_1016_j_jairtraman_2021_102160 crossref_primary_10_1016_j_jenvman_2025_126751 crossref_primary_10_1016_j_tre_2024_103756 crossref_primary_10_1016_j_cie_2025_110992 crossref_primary_10_1016_j_cor_2025_107146 crossref_primary_10_1016_j_ejor_2024_07_013 |
| Cites_doi | 10.1137/0108053 10.1016/j.ejor.2013.06.006 10.1023/B:COAP.0000033964.95511.23 10.1080/01441649208716811 10.1007/BF02592064 10.1080/00207543.2016.1145816 10.1016/j.dam.2003.09.011 10.1007/BF01580223 10.1016/S0377-2217(00)00169-7 10.1016/j.ejor.2010.09.017 10.1016/S0966-8349(96)00011-3 10.1287/opre.44.6.923 10.1016/S0377-2217(96)00340-2 10.1016/j.ejor.2015.09.008 10.1016/S0377-2217(98)00195-7 10.1016/0377-2217(94)90318-2 10.1111/0022-4146.00207 10.1016/0377-2217(94)90062-0 10.1016/j.ejor.2010.11.028 10.1016/j.cor.2014.02.014 10.1016/j.ejor.2006.10.057 10.1007/BF02060471 10.1007/s10479-017-2656-3 10.1177/002224296402800307 10.1016/j.cor.2014.01.009 10.2307/3145346 10.1016/j.trb.2009.09.002 10.1287/mnsc.44.12.S235 10.1016/j.ejor.2007.06.008 10.1016/0377-2217(93)E0173-U 10.1007/978-3-642-56082-8_12 10.1016/j.cor.2008.11.014 10.1287/ijoc.1070.0256 10.1287/opre.1110.1037 10.1287/mnsc.27.1.1 10.1016/0377-2217(95)00100-X 10.1007/s10898-015-0399-8 10.1287/opre.2014.1279 10.1287/trsc.1120.0410 10.1007/s101070100263 10.1287/trsc.20.2.92 10.1287/ijoc.1090.0335 10.1007/s10107-002-0339-5 10.1007/s11590-016-1005-9 10.1111/j.1435-5597.1986.tb00985.x 10.1016/S0377-2217(87)80007-3 10.1016/j.orl.2005.01.004 |
| ContentType | Journal Article |
| Copyright | 2021 Elsevier Ltd Copyright Elsevier Science Ltd. Apr 2021 |
| Copyright_xml | – notice: 2021 Elsevier Ltd – notice: Copyright Elsevier Science Ltd. Apr 2021 |
| DBID | AAYXX CITATION 7ST 8FD C1K FR3 KR7 SOI |
| DOI | 10.1016/j.trb.2021.01.012 |
| DatabaseName | CrossRef Environment Abstracts Technology Research Database Environmental Sciences and Pollution Management Engineering Research Database Civil Engineering Abstracts Environment Abstracts |
| DatabaseTitle | CrossRef Civil Engineering Abstracts Engineering Research Database Technology Research Database Environment Abstracts Environmental Sciences and Pollution Management |
| DatabaseTitleList | Civil Engineering Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Economics Engineering |
| EISSN | 1879-2367 |
| EndPage | 261 |
| ExternalDocumentID | 10_1016_j_trb_2021_01_012 S0191261521000199 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 7-5 71M 8P~ 9JO AAAKF AAAKG AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABDEX ABDMP ABFNM ABLJU ABMAC ABMMH ABPPZ ABUCO ABXDB ABYKQ ACDAQ ACGFS ACNCT ACRLP ADBBV ADEZE ADMUD AEBSH AEKER AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHRSL AIEXJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK APLSM ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HAMUX HMY HVGLF HZ~ H~9 IHE J1W KOM LY1 LY7 M3Y M41 MO0 MS~ N9A O-L O9- OAUVE OHT OZT P-8 P-9 P2P PC. PRBVW Q38 R2- RIG ROL RPZ SDF SDG SDP SDS SES SET SEW SPCBC SSB SSD SSO SSS SSZ T5K WUQ XPP ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ADNMO AEIPS AFJKZ AGQPQ AIIUN ANKPU APXCP CITATION EFKBS ~HD 7ST 8FD AGCQF C1K FR3 KR7 SOI |
| ID | FETCH-LOGICAL-c358t-b6dbecd4a645bbd28fec3b3eb706a7af8a6fe19e1fb07e5de536435378f60a0f3 |
| ISICitedReferencesCount | 15 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000634189500011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0191-2615 |
| IngestDate | Wed Aug 13 06:42:52 EDT 2025 Sat Nov 29 07:22:42 EST 2025 Tue Nov 18 21:16:44 EST 2025 Fri Feb 23 02:48:10 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Competition Non-linear program Exact solution methods Hub and spoke networks |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c358t-b6dbecd4a645bbd28fec3b3eb706a7af8a6fe19e1fb07e5de536435378f60a0f3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2610114792 |
| PQPubID | 2047452 |
| PageCount | 25 |
| ParticipantIDs | proquest_journals_2610114792 crossref_primary_10_1016_j_trb_2021_01_012 crossref_citationtrail_10_1016_j_trb_2021_01_012 elsevier_sciencedirect_doi_10_1016_j_trb_2021_01_012 |
| PublicationCentury | 2000 |
| PublicationDate | April 2021 2021-04-00 20210401 |
| PublicationDateYYYYMMDD | 2021-04-01 |
| PublicationDate_xml | – month: 04 year: 2021 text: April 2021 |
| PublicationDecade | 2020 |
| PublicationPlace | Oxford |
| PublicationPlace_xml | – name: Oxford |
| PublicationTitle | Transportation research. Part B: methodological |
| PublicationYear | 2021 |
| Publisher | Elsevier Ltd Elsevier Science Ltd |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier Science Ltd |
| References | Campbell (bib0013) 1994; 72 Skorin-Kapov, Skorin-Kapov, O’Kelly (bib0049) 1996; 94 Campbell, J., Ernst, A., Krishnamoorthy, M., 2002. Hub location problems. facility location: applications and theory, 12, 373–407. Vidyarthi, Jayaswal, Chetty (bib0052) 2016; 65 Vielma, Ahmed, Nemhauser (bib0053) 2008; 20 Aykin (bib0009) 1995; 83 Mahmutogullari, Kara (bib0040) 2016; 250 Hamacher, Labbé, Nickel, Sonneborn (bib0027) 2004; 145 Elhedhli (bib0021) 2005; 33 Elhedhli, Wu (bib0022) 2010; 22 Marianov, Serra, ReVelle (bib0041) 1999; 114 Drezner, Drezner (bib0018) 2001; 41 Jayaswal, Vidyarthi, Das (bib0034) 2017; 11 Campbell (bib0012) 1992; 40 Held, Wolfe, Crowder (bib0028) 1974; 6 Jayaswal, Jewkes, Ray (bib0032) 2011; 210 . Azizi, Vidyarthi, Chauhan (bib0010) 2018; 264 Lüer-Villagra, Marianov (bib0039) 2013; 231 Ishfaq, Sox (bib0031) 2011; 210 de Dios Ortuzar, Willumsen (bib0016) 2011 Alizadeh, Goldfarb (bib0004) 2003; 95 Campbell, O’Kelly (bib0015) 2012; 46 O’Kelly (bib0042) 1986; 20 Wagner (bib0054) 2008; 184 Campbell (bib0014) 1996; 44 Antoniou, Lu (bib0006) 2007 Ernst, Krishnamoorthy (bib0024) 1998; 104 Huff (bib0030) 1966; 42 Jayaswal, Jewkes (bib0033) 2016; 54 Kara, Taner (bib0035) 2011 Eiselt, Marianov (bib0020) 2009; 36 Ahmadi-Javid, A., Hoseinpour, P., 2017. Convexification of queueing formulas by mixed-integer second-order cone programming: an application to a discrete location problem with congestion. Sasaki, Campbell, Krishnamoorthy, Ernst (bib0047) 2014; 47 Atamtürk, Berenguer, Shen (bib0007) 2012; 60 Plastria (bib0045) 2001; 129 Huff (bib0029) 1964 Aykin (bib0008) 1994; 79 Kelley (bib0036) 1960; 8 Lin, Lee (bib0038) 2010; 44 Dolan, Moré (bib0017) 2002; 91 O’Kelly (bib0043) 1987; 32 Ernst, Krishnamoorthy (bib0023) 1996; 4 Pirkul, Schilling (bib0044) 1998; 44 Alumur, Kara (bib0005) 2008; 190 Sasaki, Fukushima (bib0048) 2001; 44 Sasaki (bib0046) 2005; 48 Grove, O’Kelly (bib0026) 1986; 59 Alamdari, Black (bib0003) 1992; 12 Tiwari, Jayaswal, Sinha (bib0050) 2020 Aktürk, Atamtürk, Gürel (bib0002) 2014; 62 Duran, Grossmann (bib0019) 1986; 36 Kuo, Mittelmann (bib0037) 2004; 28 Vidyarthi, Jayaswal (bib0051) 2014; 48 Fisher (bib0025) 1981; 27 Grove (10.1016/j.trb.2021.01.012_bib0026) 1986; 59 de Dios Ortuzar (10.1016/j.trb.2021.01.012_bib0016) 2011 Drezner (10.1016/j.trb.2021.01.012_bib0018) 2001; 41 Jayaswal (10.1016/j.trb.2021.01.012_bib0032) 2011; 210 Aykin (10.1016/j.trb.2021.01.012_bib0009) 1995; 83 Elhedhli (10.1016/j.trb.2021.01.012_bib0021) 2005; 33 Sasaki (10.1016/j.trb.2021.01.012_bib0048) 2001; 44 Skorin-Kapov (10.1016/j.trb.2021.01.012_bib0049) 1996; 94 Alizadeh (10.1016/j.trb.2021.01.012_bib0004) 2003; 95 Campbell (10.1016/j.trb.2021.01.012_bib0015) 2012; 46 Fisher (10.1016/j.trb.2021.01.012_bib0025) 1981; 27 Huff (10.1016/j.trb.2021.01.012_bib0029) 1964 Kuo (10.1016/j.trb.2021.01.012_bib0037) 2004; 28 Kara (10.1016/j.trb.2021.01.012_bib0035) 2011 Aktürk (10.1016/j.trb.2021.01.012_bib0002) 2014; 62 Campbell (10.1016/j.trb.2021.01.012_bib0013) 1994; 72 Jayaswal (10.1016/j.trb.2021.01.012_bib0033) 2016; 54 O’Kelly (10.1016/j.trb.2021.01.012_bib0042) 1986; 20 Dolan (10.1016/j.trb.2021.01.012_bib0017) 2002; 91 Antoniou (10.1016/j.trb.2021.01.012_sbref0006) 2007 Ernst (10.1016/j.trb.2021.01.012_bib0023) 1996; 4 Alumur (10.1016/j.trb.2021.01.012_bib0005) 2008; 190 Plastria (10.1016/j.trb.2021.01.012_bib0045) 2001; 129 Elhedhli (10.1016/j.trb.2021.01.012_bib0022) 2010; 22 Campbell (10.1016/j.trb.2021.01.012_bib0012) 1992; 40 Campbell (10.1016/j.trb.2021.01.012_bib0014) 1996; 44 Lin (10.1016/j.trb.2021.01.012_bib0038) 2010; 44 Wagner (10.1016/j.trb.2021.01.012_bib0054) 2008; 184 10.1016/j.trb.2021.01.012_bib0001 Mahmutogullari (10.1016/j.trb.2021.01.012_bib0040) 2016; 250 Atamtürk (10.1016/j.trb.2021.01.012_bib0007) 2012; 60 Eiselt (10.1016/j.trb.2021.01.012_bib0020) 2009; 36 Ernst (10.1016/j.trb.2021.01.012_bib0024) 1998; 104 Kelley (10.1016/j.trb.2021.01.012_bib0036) 1960; 8 Vielma (10.1016/j.trb.2021.01.012_bib0053) 2008; 20 Hamacher (10.1016/j.trb.2021.01.012_bib0027) 2004; 145 Jayaswal (10.1016/j.trb.2021.01.012_bib0034) 2017; 11 Vidyarthi (10.1016/j.trb.2021.01.012_bib0051) 2014; 48 Marianov (10.1016/j.trb.2021.01.012_bib0041) 1999; 114 Vidyarthi (10.1016/j.trb.2021.01.012_bib0052) 2016; 65 Aykin (10.1016/j.trb.2021.01.012_bib0008) 1994; 79 Huff (10.1016/j.trb.2021.01.012_bib0030) 1966; 42 Lüer-Villagra (10.1016/j.trb.2021.01.012_bib0039) 2013; 231 Azizi (10.1016/j.trb.2021.01.012_bib0010) 2018; 264 Sasaki (10.1016/j.trb.2021.01.012_bib0047) 2014; 47 10.1016/j.trb.2021.01.012_bib0011 O’Kelly (10.1016/j.trb.2021.01.012_bib0043) 1987; 32 Held (10.1016/j.trb.2021.01.012_bib0028) 1974; 6 Tiwari (10.1016/j.trb.2021.01.012_bib0050) 2020 Pirkul (10.1016/j.trb.2021.01.012_bib0044) 1998; 44 Alamdari (10.1016/j.trb.2021.01.012_bib0003) 1992; 12 Duran (10.1016/j.trb.2021.01.012_bib0019) 1986; 36 Sasaki (10.1016/j.trb.2021.01.012_bib0046) 2005; 48 Ishfaq (10.1016/j.trb.2021.01.012_bib0031) 2011; 210 |
| References_xml | – volume: 210 start-page: 716 year: 2011 end-page: 728 ident: bib0032 article-title: Product differentiation and operations strategy in a capacitated environment publication-title: Eur. J. Oper. Res. – volume: 59 start-page: 103 year: 1986 end-page: 119 ident: bib0026 article-title: Hub networks and simulated schedule delay publication-title: Pap. Reg. Sci. – volume: 210 start-page: 213 year: 2011 end-page: 230 ident: bib0031 article-title: Hub location–allocation in intermodal logistic networks publication-title: Eur. J. Oper. Res. – volume: 60 start-page: 366 year: 2012 end-page: 381 ident: bib0007 article-title: A conic integer programming approach to stochastic joint location-inventory problems publication-title: Oper. Res. – volume: 32 start-page: 393 year: 1987 end-page: 404 ident: bib0043 article-title: A quadratic integer program for the location of interacting hub facilities publication-title: Eur. J. Oper. Res. – year: 2020 ident: bib0050 article-title: Alternate solution approaches for competitive hub location problems publication-title: Eur. J. Oper. Res. – reference: Campbell, J., Ernst, A., Krishnamoorthy, M., 2002. Hub location problems. facility location: applications and theory, 12, 373–407. – year: 2007 ident: bib0006 article-title: Semidefinite and second-order cone programming publication-title: Practical Optimization: Algorithms and Engineering Applications – volume: 46 start-page: 153 year: 2012 end-page: 169 ident: bib0015 article-title: Twenty-five years of hub location research publication-title: Transp. Sci. – volume: 54 start-page: 2791 year: 2016 end-page: 2806 ident: bib0033 article-title: Price and lead time differentiation, capacity strategy and market competition publication-title: Int. J. Prod. Res. – volume: 94 start-page: 582 year: 1996 end-page: 593 ident: bib0049 article-title: Tight linear programming relaxations of uncapacitated p-hub median problems publication-title: Eur. J. Oper. Res. – volume: 250 start-page: 214 year: 2016 end-page: 225 ident: bib0040 article-title: Hub location under competition publication-title: Eur. J. Oper. Res. – volume: 41 start-page: 67 year: 2001 end-page: 72 ident: bib0018 article-title: A note on applying the gravity rule to the airline hub problem publication-title: J. Reg. Sci. – volume: 91 start-page: 201 year: 2002 end-page: 213 ident: bib0017 article-title: Benchmarking optimization software with performance profiles publication-title: Math. Program. – volume: 145 start-page: 104 year: 2004 end-page: 116 ident: bib0027 article-title: Adapting polyhedral properties from facility to hub location problems publication-title: Discrete Appl. Math. – volume: 104 start-page: 100 year: 1998 end-page: 112 ident: bib0024 article-title: Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem publication-title: Eur. J. Oper. Res. – volume: 79 start-page: 501 year: 1994 end-page: 523 ident: bib0008 article-title: Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem publication-title: Eur. J. Oper. Res. – start-page: 34 year: 1964 end-page: 38 ident: bib0029 article-title: Defining and estimating a trading area publication-title: J. Mark. – volume: 44 start-page: S235 year: 1998 end-page: S242 ident: bib0044 article-title: An efficient procedure for designing single allocation hub and spoke systems publication-title: Manage. Sci. – year: 2011 ident: bib0016 article-title: Modelling Transport – volume: 20 start-page: 92 year: 1986 end-page: 106 ident: bib0042 article-title: The location of interacting hub facilities publication-title: Transp. Sci. – reference: Ahmadi-Javid, A., Hoseinpour, P., 2017. Convexification of queueing formulas by mixed-integer second-order cone programming: an application to a discrete location problem with congestion. – volume: 22 start-page: 282 year: 2010 end-page: 296 ident: bib0022 article-title: A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion publication-title: INFORMS J. Comput. – volume: 44 start-page: 618 year: 2010 end-page: 629 ident: bib0038 article-title: The competition game on hub network design publication-title: Transp. Res. Part B – volume: 20 start-page: 438 year: 2008 end-page: 450 ident: bib0053 article-title: A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs publication-title: INFORMS J. Comput. – volume: 62 start-page: 829 year: 2014 end-page: 845 ident: bib0002 article-title: Aircraft rescheduling with cruise speed control publication-title: Oper. Res. – volume: 95 start-page: 3 year: 2003 end-page: 51 ident: bib0004 article-title: Second-order cone programming publication-title: Math. Program. – volume: 184 start-page: 57 year: 2008 end-page: 62 ident: bib0054 article-title: A note on “location of hubs in a competitive environment” publication-title: European Journal of Operational Research – volume: 44 start-page: 390 year: 2001 end-page: 402 ident: bib0048 article-title: Stackelberg hub location problem publication-title: J. Oper. Res. Soc.Jpn. – volume: 36 start-page: 3128 year: 2009 end-page: 3135 ident: bib0020 article-title: A conditional p-hub location problem with attraction functions publication-title: Comput. Oper. Res. – volume: 264 start-page: 1 year: 2018 end-page: 40 ident: bib0010 article-title: Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion publication-title: Ann. Oper. Res. – volume: 72 start-page: 387 year: 1994 end-page: 405 ident: bib0013 article-title: Integer programming formulations of discrete hub location problems publication-title: Eur. J. Oper. Res. – volume: 44 start-page: 923 year: 1996 end-page: 935 ident: bib0014 article-title: Hub location and the p-hub median problem publication-title: Oper. Res. – volume: 42 start-page: 293 year: 1966 end-page: 303 ident: bib0030 article-title: A programmed solution for approximating an optimum retail location publication-title: Land Econ. – volume: 12 start-page: 153 year: 1992 end-page: 170 ident: bib0003 article-title: Passengers’ choice of airline under competition: the use of the logit model publication-title: Transp. Rev. – volume: 33 start-page: 615 year: 2005 end-page: 624 ident: bib0021 article-title: Exact solution of a class of nonlinear knapsack problems publication-title: Oper. Res. Lett. – volume: 114 start-page: 363 year: 1999 end-page: 371 ident: bib0041 article-title: Location of hubs in a competitive environment publication-title: Eur. J. Oper. Res. – volume: 129 start-page: 461 year: 2001 end-page: 470 ident: bib0045 article-title: Static competitive facility location: an overview of optimisation approaches publication-title: Eur. J. Oper. Res. – volume: 231 start-page: 734 year: 2013 end-page: 744 ident: bib0039 article-title: A competitive hub location and pricing problem publication-title: Eur. J. Oper. Res. – volume: 83 start-page: 200 year: 1995 end-page: 219 ident: bib0009 article-title: The hub location and routing problem publication-title: Eur. J. Oper. Res. – volume: 48 start-page: 158 year: 2005 end-page: 171 ident: bib0046 article-title: Hub network design model in a competitive environment with flow threshold publication-title: J. Oper. Res. Soc.Jpn. – volume: 36 start-page: 307 year: 1986 end-page: 339 ident: bib0019 article-title: An outer-approximation algorithm for a class of mixed-integer nonlinear programs publication-title: Math. Program. – volume: 190 start-page: 1 year: 2008 end-page: 21 ident: bib0005 article-title: Network hub location problems: the state of the art publication-title: Eur. J. Oper. Res. – volume: 65 start-page: 745 year: 2016 end-page: 776 ident: bib0052 article-title: Bandwidth packing problem with queueing delays: modelling and exact solution approach publication-title: J. Global Optim. – volume: 48 start-page: 20 year: 2014 end-page: 30 ident: bib0051 article-title: Efficient solution of a class of location–allocation problems with stochastic demand and congestion publication-title: Comput. Oper. Res. – volume: 8 start-page: 703 year: 1960 end-page: 712 ident: bib0036 article-title: The cutting-plane method for solving convex programs publication-title: J. Soc. Ind. Appl.Math. – start-page: 273 year: 2011 end-page: 288 ident: bib0035 article-title: Hub location problems: the location of interacting facilities publication-title: Foundations of Location Analysis – reference: . – volume: 27 start-page: 1 year: 1981 end-page: 18 ident: bib0025 article-title: The lagrangian relaxation method for solving integer programming problems publication-title: Manage. Sci. – volume: 47 start-page: 27 year: 2014 end-page: 41 ident: bib0047 article-title: A stackelberg hub arc location model for a competitive environment publication-title: Comput. Oper. Res. – volume: 4 start-page: 139 year: 1996 end-page: 154 ident: bib0023 article-title: Efficient algorithms for the uncapacitated single allocation p-hub median problem publication-title: Location Sci. – volume: 40 start-page: 77 year: 1992 end-page: 99 ident: bib0012 article-title: Location and allocation for distribution systems with transshipments and transportion economies of scale publication-title: Ann. Oper. Res. – volume: 11 start-page: 225 year: 2017 end-page: 239 ident: bib0034 article-title: A cutting plane approach to combinatorial bandwidth packing problem with queuing delays publication-title: Optim. Lett. – volume: 6 start-page: 62 year: 1974 end-page: 88 ident: bib0028 article-title: Validation of subgradient optimization publication-title: Math. Program. – volume: 28 start-page: 255 year: 2004 end-page: 285 ident: bib0037 article-title: Interior point methods for second-order cone programming and or applications publication-title: Comput. Optim. Appl. – volume: 8 start-page: 703 issue: 4 year: 1960 ident: 10.1016/j.trb.2021.01.012_bib0036 article-title: The cutting-plane method for solving convex programs publication-title: J. Soc. Ind. Appl.Math. doi: 10.1137/0108053 – volume: 231 start-page: 734 issue: 3 year: 2013 ident: 10.1016/j.trb.2021.01.012_bib0039 article-title: A competitive hub location and pricing problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2013.06.006 – volume: 28 start-page: 255 issue: 3 year: 2004 ident: 10.1016/j.trb.2021.01.012_bib0037 article-title: Interior point methods for second-order cone programming and or applications publication-title: Comput. Optim. Appl. doi: 10.1023/B:COAP.0000033964.95511.23 – volume: 12 start-page: 153 issue: 2 year: 1992 ident: 10.1016/j.trb.2021.01.012_bib0003 article-title: Passengers’ choice of airline under competition: the use of the logit model publication-title: Transp. Rev. doi: 10.1080/01441649208716811 – volume: 36 start-page: 307 issue: 3 year: 1986 ident: 10.1016/j.trb.2021.01.012_bib0019 article-title: An outer-approximation algorithm for a class of mixed-integer nonlinear programs publication-title: Math. Program. doi: 10.1007/BF02592064 – volume: 54 start-page: 2791 issue: 9 year: 2016 ident: 10.1016/j.trb.2021.01.012_bib0033 article-title: Price and lead time differentiation, capacity strategy and market competition publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2016.1145816 – volume: 48 start-page: 158 issue: 2 year: 2005 ident: 10.1016/j.trb.2021.01.012_bib0046 article-title: Hub network design model in a competitive environment with flow threshold publication-title: J. Oper. Res. Soc.Jpn. – volume: 145 start-page: 104 issue: 1 year: 2004 ident: 10.1016/j.trb.2021.01.012_bib0027 article-title: Adapting polyhedral properties from facility to hub location problems publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2003.09.011 – volume: 6 start-page: 62 issue: 1 year: 1974 ident: 10.1016/j.trb.2021.01.012_bib0028 article-title: Validation of subgradient optimization publication-title: Math. Program. doi: 10.1007/BF01580223 – volume: 129 start-page: 461 issue: 3 year: 2001 ident: 10.1016/j.trb.2021.01.012_bib0045 article-title: Static competitive facility location: an overview of optimisation approaches publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(00)00169-7 – volume: 210 start-page: 213 issue: 2 year: 2011 ident: 10.1016/j.trb.2021.01.012_bib0031 article-title: Hub location–allocation in intermodal logistic networks publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2010.09.017 – volume: 4 start-page: 139 issue: 3 year: 1996 ident: 10.1016/j.trb.2021.01.012_bib0023 article-title: Efficient algorithms for the uncapacitated single allocation p-hub median problem publication-title: Location Sci. doi: 10.1016/S0966-8349(96)00011-3 – volume: 44 start-page: 923 issue: 6 year: 1996 ident: 10.1016/j.trb.2021.01.012_bib0014 article-title: Hub location and the p-hub median problem publication-title: Oper. Res. doi: 10.1287/opre.44.6.923 – volume: 104 start-page: 100 issue: 1 year: 1998 ident: 10.1016/j.trb.2021.01.012_bib0024 article-title: Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(96)00340-2 – volume: 250 start-page: 214 issue: 1 year: 2016 ident: 10.1016/j.trb.2021.01.012_bib0040 article-title: Hub location under competition publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2015.09.008 – year: 2020 ident: 10.1016/j.trb.2021.01.012_bib0050 article-title: Alternate solution approaches for competitive hub location problems publication-title: Eur. J. Oper. Res. – ident: 10.1016/j.trb.2021.01.012_bib0001 – volume: 114 start-page: 363 issue: 2 year: 1999 ident: 10.1016/j.trb.2021.01.012_bib0041 article-title: Location of hubs in a competitive environment publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(98)00195-7 – volume: 72 start-page: 387 issue: 2 year: 1994 ident: 10.1016/j.trb.2021.01.012_bib0013 article-title: Integer programming formulations of discrete hub location problems publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(94)90318-2 – year: 2007 ident: 10.1016/j.trb.2021.01.012_sbref0006 article-title: Semidefinite and second-order cone programming – volume: 41 start-page: 67 issue: 1 year: 2001 ident: 10.1016/j.trb.2021.01.012_bib0018 article-title: A note on applying the gravity rule to the airline hub problem publication-title: J. Reg. Sci. doi: 10.1111/0022-4146.00207 – volume: 79 start-page: 501 issue: 3 year: 1994 ident: 10.1016/j.trb.2021.01.012_bib0008 article-title: Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(94)90062-0 – volume: 210 start-page: 716 issue: 3 year: 2011 ident: 10.1016/j.trb.2021.01.012_bib0032 article-title: Product differentiation and operations strategy in a capacitated environment publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2010.11.028 – volume: 48 start-page: 20 year: 2014 ident: 10.1016/j.trb.2021.01.012_bib0051 article-title: Efficient solution of a class of location–allocation problems with stochastic demand and congestion publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.02.014 – volume: 184 start-page: 57 issue: 1 year: 2008 ident: 10.1016/j.trb.2021.01.012_bib0054 article-title: A note on “location of hubs in a competitive environment” publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.10.057 – volume: 40 start-page: 77 issue: 1 year: 1992 ident: 10.1016/j.trb.2021.01.012_bib0012 article-title: Location and allocation for distribution systems with transshipments and transportion economies of scale publication-title: Ann. Oper. Res. doi: 10.1007/BF02060471 – volume: 264 start-page: 1 issue: 1–2 year: 2018 ident: 10.1016/j.trb.2021.01.012_bib0010 article-title: Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion publication-title: Ann. Oper. Res. doi: 10.1007/s10479-017-2656-3 – start-page: 34 year: 1964 ident: 10.1016/j.trb.2021.01.012_bib0029 article-title: Defining and estimating a trading area publication-title: J. Mark. doi: 10.1177/002224296402800307 – volume: 47 start-page: 27 year: 2014 ident: 10.1016/j.trb.2021.01.012_bib0047 article-title: A stackelberg hub arc location model for a competitive environment publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.01.009 – volume: 42 start-page: 293 issue: 3 year: 1966 ident: 10.1016/j.trb.2021.01.012_bib0030 article-title: A programmed solution for approximating an optimum retail location publication-title: Land Econ. doi: 10.2307/3145346 – volume: 44 start-page: 618 issue: 4 year: 2010 ident: 10.1016/j.trb.2021.01.012_bib0038 article-title: The competition game on hub network design publication-title: Transp. Res. Part B doi: 10.1016/j.trb.2009.09.002 – volume: 44 start-page: S235 issue: 12-part-2 year: 1998 ident: 10.1016/j.trb.2021.01.012_bib0044 article-title: An efficient procedure for designing single allocation hub and spoke systems publication-title: Manage. Sci. doi: 10.1287/mnsc.44.12.S235 – volume: 190 start-page: 1 issue: 1 year: 2008 ident: 10.1016/j.trb.2021.01.012_bib0005 article-title: Network hub location problems: the state of the art publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.06.008 – volume: 83 start-page: 200 issue: 1 year: 1995 ident: 10.1016/j.trb.2021.01.012_bib0009 article-title: The hub location and routing problem publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(93)E0173-U – ident: 10.1016/j.trb.2021.01.012_bib0011 doi: 10.1007/978-3-642-56082-8_12 – volume: 36 start-page: 3128 issue: 12 year: 2009 ident: 10.1016/j.trb.2021.01.012_bib0020 article-title: A conditional p-hub location problem with attraction functions publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2008.11.014 – volume: 44 start-page: 390 issue: 4 year: 2001 ident: 10.1016/j.trb.2021.01.012_bib0048 article-title: Stackelberg hub location problem publication-title: J. Oper. Res. Soc.Jpn. – volume: 20 start-page: 438 issue: 3 year: 2008 ident: 10.1016/j.trb.2021.01.012_bib0053 article-title: A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.1070.0256 – volume: 60 start-page: 366 issue: 2 year: 2012 ident: 10.1016/j.trb.2021.01.012_bib0007 article-title: A conic integer programming approach to stochastic joint location-inventory problems publication-title: Oper. Res. doi: 10.1287/opre.1110.1037 – volume: 27 start-page: 1 issue: 1 year: 1981 ident: 10.1016/j.trb.2021.01.012_bib0025 article-title: The lagrangian relaxation method for solving integer programming problems publication-title: Manage. Sci. doi: 10.1287/mnsc.27.1.1 – volume: 94 start-page: 582 issue: 3 year: 1996 ident: 10.1016/j.trb.2021.01.012_bib0049 article-title: Tight linear programming relaxations of uncapacitated p-hub median problems publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(95)00100-X – volume: 65 start-page: 745 issue: 4 year: 2016 ident: 10.1016/j.trb.2021.01.012_bib0052 article-title: Bandwidth packing problem with queueing delays: modelling and exact solution approach publication-title: J. Global Optim. doi: 10.1007/s10898-015-0399-8 – volume: 62 start-page: 829 issue: 4 year: 2014 ident: 10.1016/j.trb.2021.01.012_bib0002 article-title: Aircraft rescheduling with cruise speed control publication-title: Oper. Res. doi: 10.1287/opre.2014.1279 – volume: 46 start-page: 153 issue: 2 year: 2012 ident: 10.1016/j.trb.2021.01.012_bib0015 article-title: Twenty-five years of hub location research publication-title: Transp. Sci. doi: 10.1287/trsc.1120.0410 – volume: 91 start-page: 201 issue: 2 year: 2002 ident: 10.1016/j.trb.2021.01.012_bib0017 article-title: Benchmarking optimization software with performance profiles publication-title: Math. Program. doi: 10.1007/s101070100263 – volume: 20 start-page: 92 issue: 2 year: 1986 ident: 10.1016/j.trb.2021.01.012_bib0042 article-title: The location of interacting hub facilities publication-title: Transp. Sci. doi: 10.1287/trsc.20.2.92 – volume: 22 start-page: 282 issue: 2 year: 2010 ident: 10.1016/j.trb.2021.01.012_bib0022 article-title: A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.1090.0335 – start-page: 273 year: 2011 ident: 10.1016/j.trb.2021.01.012_bib0035 article-title: Hub location problems: the location of interacting facilities – volume: 95 start-page: 3 issue: 1 year: 2003 ident: 10.1016/j.trb.2021.01.012_bib0004 article-title: Second-order cone programming publication-title: Math. Program. doi: 10.1007/s10107-002-0339-5 – year: 2011 ident: 10.1016/j.trb.2021.01.012_bib0016 – volume: 11 start-page: 225 issue: 1 year: 2017 ident: 10.1016/j.trb.2021.01.012_bib0034 article-title: A cutting plane approach to combinatorial bandwidth packing problem with queuing delays publication-title: Optim. Lett. doi: 10.1007/s11590-016-1005-9 – volume: 59 start-page: 103 issue: 1 year: 1986 ident: 10.1016/j.trb.2021.01.012_bib0026 article-title: Hub networks and simulated schedule delay publication-title: Pap. Reg. Sci. doi: 10.1111/j.1435-5597.1986.tb00985.x – volume: 32 start-page: 393 issue: 3 year: 1987 ident: 10.1016/j.trb.2021.01.012_bib0043 article-title: A quadratic integer program for the location of interacting hub facilities publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(87)80007-3 – volume: 33 start-page: 615 issue: 6 year: 2005 ident: 10.1016/j.trb.2021.01.012_bib0021 article-title: Exact solution of a class of nonlinear knapsack problems publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2005.01.004 |
| SSID | ssj0003401 |
| Score | 2.399731 |
| Snippet | •We study the hub location problem faced by an airline entering a competitive market in single and multiple allocation network setting.•The problem is modelled... In this paper, we study the hub location problem of an airline that wants to set up its hub and spoke network, in order to maximize its market share in a... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 237 |
| SubjectTerms | Airlines Algorithms Competition Cutting Datasets Exact solution methods Hub and spoke networks Market shares Markets Mixed integer Non-linear program Site selection |
| Title | Competitive hub location problem: Model and solution approaches |
| URI | https://dx.doi.org/10.1016/j.trb.2021.01.012 https://www.proquest.com/docview/2610114792 |
| Volume | 146 |
| WOSCitedRecordID | wos000634189500011&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: 1879-2367 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003401 issn: 0191-2615 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELfKhgQ8IBggBgPlAfFAlSrftnlBZeoEqCpIdKhvlp04WssUSppuQ_zznL_SdIgKHpCiKEqT1PL9fD6f736H0AsuVUlbGvlxgSNYoBSZz7HEfsDjgkd5QKVOj_4yxpMJmc3op17vp8uFuTjHVUWurujyv4oa7oGwVersP4i7_SjcgGsQOpxB7HD-K8Efa0vYhASdrUVfzVZayLZ2jPIBqApohiPAtaUlF7cxhYvOVKZNdP2QpQY6G4DlWTf9t-pbpga106GtJ2B-yU0Su07dbwN1-A--utRFBvqfdRxn6-KZV2bvaVh9XdddZ0QUdmJYtIfMZck4xbQJTdLOSxr6sGIzu9jSKFyCqa9Y5LY0crKlUw0rzG-63rgdFoOmFgPVFk2_amOyt3i1Jx_Zyel4zKaj2fTl8ruvSo6prXlbf-UG2o9wSkGr7w_fj2Yf2ok8TgJbztI0222K6_DAa__6J7Pm2gSvrZbpPXTXLje8oYHJfdST1QG65bLRVwfoToeQ8gF60wGPB-DxHHg8C57XnoaOB9DxHHS8DXQeotOT0fT4nW9LbPh5nJLGF1kBg7hIeJakQhQRKWUei1gKHGQc85LwrJQhlWEpAizTQqYxmLBpjEmZBTwo40dor_pWycfIg6VEGHMZ8ZwUCUmoCFJRFrD6yGhEREkOUeB6iOWWf16VQTlnLtBwwaBTmepUFqgjOkSv2leWhnxl18OJ63ZmrUdjFTIAzK7XjpyImB3FKwbSVo4CTKMnu39-im5vhsER2mvqtXyGbuYXzXxVP7eA-gVCwphj |
| 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=Competitive+hub+location+problem%3A+Model+and+solution+approaches&rft.jtitle=Transportation+research.+Part+B%3A+methodological&rft.au=Tiwari%2C+Richa&rft.au=Jayaswal%2C+Sachin&rft.au=Sinha%2C+Ankur&rft.date=2021-04-01&rft.pub=Elsevier+Science+Ltd&rft.issn=0191-2615&rft.eissn=1879-2367&rft.volume=146&rft.spage=237&rft_id=info:doi/10.1016%2Fj.trb.2021.01.012&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0191-2615&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0191-2615&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0191-2615&client=summon |