Multi-period hub location problems in transportation

•A novel mathematical model for the multi-period hub location with budget constraints is proposed.•A very efficient decomposition scheme is proposed.•A very efficient metaheuristic is developed. Many transport service providers operate on hub-and-spoke network structures. Major operators may have se...

Full description

Saved in:
Bibliographic Details
Published inTransportation research. Part E, Logistics and transportation review Vol. 75; pp. 67 - 94
Main Authors Gelareh, Shahin, Neamatian Monemi, Rahimeh, Nickel, Stefan
Format Journal Article
LanguageEnglish
Published Exeter Elsevier India Pvt Ltd 01.03.2015
Elsevier Sequoia S.A
Elsevier
Subjects
Algorithms
Benders decomposition
Budgeting
Computer Science
Contracts
Decision making models
Heuristic
Horizon
Hub location problems
Location analysis
Mathematical models
Mathematics
Meta-heuristic
Multi-period planning
Ports
Route optimization
Studies
Transport
Transportation
Transportation problem (Operations research)
Meta-heuristic
Benders decomposition
Multi-period planning
Hub location problems
Online AccessGet full text

Cover

Abstract •A novel mathematical model for the multi-period hub location with budget constraints is proposed.•A very efficient decomposition scheme is proposed.•A very efficient metaheuristic is developed. Many transport service providers operate on hub-and-spoke network structures. Major operators may have several dedicated hub facilities that are leased for a time horizon rather than being owned or constructed. For a given discrete planning horizon, service providers must decide on the location of the hub ports (i.e. terminals), the period when the lease contract starts, the period when the existing contracts must be terminated and the flow routing over the entire planning horizon so as to minimize the total operational cost. Thus, we propose a mathematical model for a Multi-period Uncapacitated Multiple Allocation Hub Location Problem with Budget Constraint. The proposed model incorporates several features of practice, particularly from maritime and land transport practices. We also propose a meta-heuristic solution algorithm that produces high-quality solutions in a reasonable amount of time. By exploiting the decomposable structure of the model, we extended a Benders decomposition approach by proposing several improvements. Extensive computational experiments confirm the efficiency of the proposed methods and also show its limitations.
AbstractList Many transport service providers operate on hub-and-spoke network structures. Major operators may have several dedicated hub facilities that are leased for a time horizon rather than being owned or constructed. For a given discrete planning horizon, service providers must decide on the location of the hub ports (i.e. terminals), the period when the lease contract starts, the period when the existing contracts must be terminated and the flow routing over the entire planning horizon so as to minimize the total operational cost. Thus, we propose a mathematical model for a Multi-period Uncapacitated Multiple Allocation Hub Location Problem with Budget Constraint. The proposed model incorporates several features of practice, particularly from maritime and land transport practices. We also propose a meta-heuristic solution algorithm that produces high-quality solutions in a reasonable amount of time. By exploiting the decomposable structure of the model, we extended a Benders decomposition approach by proposing several improvements. Extensive computational experiments confirm the efficiency of the proposed methods and also show its limitations.
•A novel mathematical model for the multi-period hub location with budget constraints is proposed.•A very efficient decomposition scheme is proposed.•A very efficient metaheuristic is developed. Many transport service providers operate on hub-and-spoke network structures. Major operators may have several dedicated hub facilities that are leased for a time horizon rather than being owned or constructed. For a given discrete planning horizon, service providers must decide on the location of the hub ports (i.e. terminals), the period when the lease contract starts, the period when the existing contracts must be terminated and the flow routing over the entire planning horizon so as to minimize the total operational cost. Thus, we propose a mathematical model for a Multi-period Uncapacitated Multiple Allocation Hub Location Problem with Budget Constraint. The proposed model incorporates several features of practice, particularly from maritime and land transport practices. We also propose a meta-heuristic solution algorithm that produces high-quality solutions in a reasonable amount of time. By exploiting the decomposable structure of the model, we extended a Benders decomposition approach by proposing several improvements. Extensive computational experiments confirm the efficiency of the proposed methods and also show its limitations.
Author Neamatian Monemi, Rahimeh
Gelareh, Shahin
Nickel, Stefan
Author_xml – sequence: 1
  givenname: Shahin
  surname: Gelareh
  fullname: Gelareh, Shahin
  email: shahin.gelareh@univ-artois.fr, shahin.gelareh@gmail.com
  organization: Université Lille Nord de France, F-59000 Lille, France
– sequence: 2
  givenname: Rahimeh
  surname: Neamatian Monemi
  fullname: Neamatian Monemi, Rahimeh
  organization: Ifsttar, Univ. Lille Nord de France, rue Élisée Reclus 20, F-59666 Villeneuve d’Ascq, Lille, France
– sequence: 3
  givenname: Stefan
  surname: Nickel
  fullname: Nickel, Stefan
  organization: Institute for Operations Research, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany
BackLink https://hal.science/hal-04538465$$DView record in HAL
BookMark eNp9kD9PwzAQxS1UJNrCB2CLxAJDgh3_SSqmqgKKVMQCs-XYF9VVGhc7qcS3x2kQAwPTnd793unuzdCkdS0gdE1wRjAR97us85DlmLCM5FlUztCUlEWZ8mLBJrGnQqScM36BZiHsMI4Iz6eIvfZNZ9MDeOtMsu2rpHFadda1ycG7qoF9SGybdF614eB8dxpdovNaNQGufuocfTw9vq_W6ebt-WW13KSacdGlguiqNHmNGaamLOqCGwIaCkHBUGGA0UVZcYNJXcICFNclq7WgOVWa6boidI7uxr1b1ciDt3vlv6RTVq6XGzlomHFaMsGPA3s7svHszx5CJ_c2aGga1YLrgyRFgfMCUz6gN3_Qnet9Gz-RRIgcc7o4UWSktHcheKh_LyBYDpnLnYyZyyFzSXIZleh5GD0QUzla8DJoC60GYz3oThpn_3F_A8gWif4
CODEN TRERFW
CitedBy_id crossref_primary_10_1016_j_ejor_2017_06_044
crossref_primary_10_1108_K_05_2023_0903
crossref_primary_10_1051_matecconf_20168605017
crossref_primary_10_1016_j_ejor_2023_02_003
crossref_primary_10_1016_j_eti_2021_101758
crossref_primary_10_1016_j_jairtraman_2018_08_006
crossref_primary_10_1016_j_compchemeng_2019_01_003
crossref_primary_10_1016_j_tre_2020_102201
crossref_primary_10_1016_j_tre_2021_102602
crossref_primary_10_1016_j_tre_2016_09_008
crossref_primary_10_1108_IJRDM_07_2015_0094
crossref_primary_10_1177_1687814018822934
crossref_primary_10_1007_s10479_019_03421_w
crossref_primary_10_1080_15568318_2022_2059726
crossref_primary_10_1016_j_trb_2022_01_002
crossref_primary_10_1016_j_ejor_2016_12_005
crossref_primary_10_1002_cpe_4981
crossref_primary_10_1016_j_ejor_2017_09_024
crossref_primary_10_1016_j_engappai_2020_104056
crossref_primary_10_1016_j_eti_2021_101904
crossref_primary_10_1080_01900692_2019_1652315
crossref_primary_10_1287_trsc_2021_1094
crossref_primary_10_1016_j_ejor_2024_03_007
crossref_primary_10_1016_j_orhc_2018_05_002
crossref_primary_10_1155_2015_430109
crossref_primary_10_1016_j_cor_2020_105136
crossref_primary_10_1007_s11356_021_13718_8
crossref_primary_10_1016_j_trb_2018_07_003
crossref_primary_10_1016_j_cie_2017_11_007
crossref_primary_10_1016_j_cie_2018_09_010
crossref_primary_10_1016_j_cor_2018_11_014
crossref_primary_10_1016_j_trb_2019_03_007
crossref_primary_10_1016_j_tre_2017_11_007
crossref_primary_10_1016_j_cie_2018_12_058
crossref_primary_10_1016_j_ocecoaman_2017_06_008
crossref_primary_10_1016_j_ijpe_2022_108493
crossref_primary_10_1007_s10098_020_01955_3
crossref_primary_10_1016_j_eswa_2023_119850
crossref_primary_10_1007_s10878_018_0320_8
crossref_primary_10_1016_j_tre_2022_102821
crossref_primary_10_1007_s00521_019_04666_z
crossref_primary_10_1007_s40092_016_0150_1
crossref_primary_10_1007_s12046_018_0958_z
crossref_primary_10_1016_j_cie_2019_06_024
crossref_primary_10_1016_j_tre_2016_10_001
crossref_primary_10_1016_j_cor_2023_106357
crossref_primary_10_1016_j_omega_2017_01_011
crossref_primary_10_1155_2017_9387302
crossref_primary_10_1016_j_tre_2016_04_006
crossref_primary_10_1016_j_jairtraman_2016_04_008
crossref_primary_10_1051_ro_2021155
crossref_primary_10_1007_s12652_022_03879_w
crossref_primary_10_1016_j_cie_2018_05_027
crossref_primary_10_1080_21680566_2024_2352494
crossref_primary_10_1080_00207543_2024_2334419
crossref_primary_10_1287_ijoc_2023_0339
crossref_primary_10_1007_s00500_022_07302_6
crossref_primary_10_1080_17517575_2018_1533588
crossref_primary_10_2478_fcds_2023_0013
crossref_primary_10_1007_s10479_017_2569_1
crossref_primary_10_3390_math9243177
crossref_primary_10_1016_j_trb_2022_11_008
crossref_primary_10_2139_ssrn_3201012
crossref_primary_10_1080_0305215X_2020_1808973
crossref_primary_10_1016_j_tre_2023_103263
crossref_primary_10_1007_s11356_021_15867_2
crossref_primary_10_1007_s00291_018_0526_2
crossref_primary_10_1016_j_ejor_2020_09_039
crossref_primary_10_1051_ro_2022134
crossref_primary_10_1590_0101_7438_2018_038_02_0307
crossref_primary_10_3390_su15031945
Cites_doi 10.1016/S0377-2217(87)80007-3
10.1016/0377-2217(94)90318-2
10.1016/j.cor.2014.04.014
10.1016/j.apm.2011.10.016
10.1287/trsc.1120.0410
10.1287/opre.29.3.464
10.1007/s10287-004-0020-y
10.1287/opre.12.3.450
10.1016/0098-1354(91)85027-R
10.1016/j.trb.2009.04.004
10.1023/A:1013827731218
10.1287/trsc.3.4.352
10.1016/j.orl.2011.07.005
10.1016/j.cor.2006.07.002
10.1007/BF01386316
10.1016/j.tre.2011.04.009
10.1007/s11067-013-9197-3
10.1287/trsc.1080.0233
10.1287/opre.1110.0965
10.1057/palgrave.jors.2602307
10.1016/j.omega.2009.10.008
10.1287/opre.1060.0286
10.1590/S0101-74382003000100012
10.1007/BF01585180
10.1016/j.cor.2014.01.009
10.1016/0191-2615(90)90015-Q
10.1016/j.ejor.2009.05.044
10.1287/trsc.1100.0326
10.1016/S0966-8349(96)00011-3
10.1287/mnsc.24.3.312
10.1287/trsc.20.2.92
10.1007/BFb0121090
10.1111/j.1538-4632.1986.tb00106.x
10.1016/j.cor.2008.10.004
10.1016/j.ejor.2008.10.033
10.1016/j.cor.2004.07.005
10.1137/S1052623498342186
10.1016/j.cor.2008.12.009
10.1016/j.ejor.2007.06.008
10.1057/jors.2008.92
10.1016/j.cie.2013.01.012
10.1016/S0191-2615(98)00021-6
ContentType Journal Article
Copyright 2015 Elsevier Ltd
Copyright Elsevier Sequoia S.A. Mar 2015
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: 2015 Elsevier Ltd
– notice: Copyright Elsevier Sequoia S.A. Mar 2015
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
8FD
FR3
KR7
1XC
DOI 10.1016/j.tre.2014.12.016
DatabaseName CrossRef
Technology Research Database
Engineering Research Database
Civil Engineering Abstracts
Hyper Article en Ligne (HAL)
DatabaseTitle CrossRef
Technology Research Database
Civil Engineering Abstracts
Engineering Research Database
DatabaseTitleList Technology Research Database
Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Military & Naval Science
Engineering
Mathematics
Computer Science
EISSN 1878-5794
EndPage 94
ExternalDocumentID oai_HAL_hal_04538465v1
3620516631
10_1016_j_tre_2014_12_016
S1366554514002282
Genre Feature
GroupedDBID --K
--M
-~X
.~1
0R~
123
13V
1B1
1~.
1~5
29Q
4.4
457
4G.
5VS
7-5
71M
8P~
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAFJI
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
ABFNM
ABJNI
ABKBG
ABMAC
ABMMH
ABMVD
ABUCO
ABXDB
ABYKQ
ACDAQ
ACHRH
ACIWK
ACNTT
ACRLP
ADBBV
ADEZE
ADMUD
AEBSH
AEKER
AFKWA
AFTJW
AGHFR
AGJBL
AGUBO
AGUMN
AGYEJ
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
AKYCK
ALEQD
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOMHK
APLSM
ASPBG
AVARZ
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
BNSAS
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
HAMUX
HVGLF
HZ~
H~9
IHE
J1W
KOM
M41
MO0
N9A
O-L
O9-
OAUVE
OHT
OZT
P-8
P-9
P2P
PC.
PQQKQ
PRBVW
PZZ
Q38
R2-
RIG
ROL
RPZ
RWL
RXW
SCC
SDF
SDG
SDP
SES
SEW
SPCBC
SSB
SSD
SSL
SSO
SSZ
T5K
TAE
TN5
ZCA
~G-
AAXKI
AAYXX
AFJKZ
CITATION
8FD
FR3
KR7
1XC
ID FETCH-LOGICAL-c456t-61cb8d2f0403d87f75d1ece763ed36de4398b5d01f8e9ea5c84fc6323ac4cfb13
IEDL.DBID AIKHN
ISSN 1366-5545
IngestDate Fri Sep 06 13:10:21 EDT 2024
Sat Aug 17 01:16:19 EDT 2024
Fri Sep 13 01:46:09 EDT 2024
Thu Sep 26 18:12:33 EDT 2024
Fri Feb 23 02:21:55 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Meta-heuristic
Benders decomposition
Multi-period planning
Hub location problems
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c456t-61cb8d2f0403d87f75d1ece763ed36de4398b5d01f8e9ea5c84fc6323ac4cfb13
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ORCID 0000-0002-6606-9698
PQID 1662053951
PQPubID 17110
PageCount 28
ParticipantIDs hal_primary_oai_HAL_hal_04538465v1
proquest_miscellaneous_1770270351
proquest_journals_1662053951
crossref_primary_10_1016_j_tre_2014_12_016
elsevier_sciencedirect_doi_10_1016_j_tre_2014_12_016
PublicationCentury 2000
PublicationDate 2015-03-01
PublicationDateYYYYMMDD 2015-03-01
PublicationDate_xml – month: 03
  year: 2015
  text: 2015-03-01
  day: 01
PublicationDecade 2010
PublicationPlace Exeter
PublicationPlace_xml – name: Exeter
PublicationTitle Transportation research. Part E, Logistics and transportation review
PublicationYear 2015
Publisher Elsevier India Pvt Ltd
Elsevier Sequoia S.A
Elsevier
Publisher_xml – name: Elsevier India Pvt Ltd
– name: Elsevier Sequoia S.A
– name: Elsevier
References Alumur, Kara, Karasan (b0020) 2009; 43
McDaniel, Devine (b0190) 1977; 24
Gelareh, S., 2008. Hub location models in public transport planning. Ph.D. thesis, Tecnical University of Kaiserslautern, Germany.
O’Kelly (b0210) 1986; 20
Frangioni (b0130) 1997; 62
Sasaki, Campbell, Krishnamoorthy, Ernst (b0245) 2014; 47
Ernst, Krishnamoorthy (b0115) 1996; 4
Benders (b0040) 1962; 4
Nickel, Schobel, Sonneborn (b0205) 2001
Sahinidis, Grossmann (b0240) 1991; 15
Goldman (b0155) 1969; 3
de Camargo, Miranda, Luna (b0110) 2008; 35
Melo, Nickel, Saldanha da Gama (b0200) 2006; 33
Poojari, Beasley (b0230) 2009; 199
Baena, Castro (b0030) 2011; 39
Campbell (b0050) 1990; 24
Kara, Taner (b0165) 2011
de Camargo, de Miranda, Luna (b0105) 2009; 43
Hakimi (b0160) 1964; 12
Albareda-Sambola, Fernández, Hinojosa, Puerto (b0005) 2008; 36
Maculan, Plateau, Lisser (b0170) 2003; 23
Contreras, Fernández, Marín (b0090) 2010; 202
Appleget, Wood (b0025) 2000
Toh, Higgins (b0260) 1985; 24
Yoon, Current (b0270) 2008; 59
Contreras, Cordeau, Laporte (b0080) 2011; 45
Magnanti, Wong (b0185) 1981; 29
Codato, Fischetti (b0070) 2006; 54
Mehrotra, Ye (b0195) 1993; 62
O’Kelly (b0220) 1987; 32
Contreras, Cordeau, Laporte (b0075) 2011; 59
UNCTAD (Ed.), 2012. Review Of Maritime Transport 2012. United Nations Conference on Trade and Development (UNCTAD) Geneva and New York.
Correia, Nickel, Saldanha-da Gama (b0095) 2014; 14
Boysen, Fliedner (b0045) 2010; 38
O’Kelly (b0215) 1986; 18
Contreras, Fernández, Marín (b0085) 2009; 36
Freund, R.M., Roundy, R., Todd, M.J., 1985. Identifying the set of always-active constraints in a system of linear inequalities by a single linear program. Tech. Rep. Massachusetts Institute of Technology (MIT), Sloan School of Management, Working papers, No: 1674–1685.
Taghipourian, Mahdavi, Mahdavi-Amiri, Makui (b0255) 2012; 36
Magnanti, Mireault, Wong (b0175) 1986
Campbell, O’Kelly (b0065) 2012; 46
Alumur, Kara (b0015) 2009; 60
Rodríguez-Martín, Salazar-González, Yaman (b0235) 2014; 50
de Camargo, de Miranda, Ferreira, Luna (b0100) 2009; 36
O’Kelly, Bryan (b0225) 1998; 32
Benders (b0035) 2005; 2
Gelareh, Nickel (b0150) 2011; 47
Campbell, Ernst, Krishnamoorthy (b0060) 2002
Sherali, Fraticelli (b0250) 2002; 22
Farahani, Hekmatfar, Arabani, Nikbakhsh (b0120) 2013; 64
Frangioni (b0135) 2002; 13
Campbell (b0055) 1994; 72
Alumur, Kara (b0010) 2008; 190
Fischetti, M., Salvagnin, D., Zanette, A., 2009. Minimal infeasible subsystems and Benders cuts. Mathematical Programming to appear.
Magnanti, Wong (b0180) 1981; 29
Gelareh (10.1016/j.tre.2014.12.016_b0150) 2011; 47
Poojari (10.1016/j.tre.2014.12.016_b0230) 2009; 199
Maculan (10.1016/j.tre.2014.12.016_b0170) 2003; 23
O’Kelly (10.1016/j.tre.2014.12.016_b0225) 1998; 32
Alumur (10.1016/j.tre.2014.12.016_b0020) 2009; 43
Kara (10.1016/j.tre.2014.12.016_b0165) 2011
Campbell (10.1016/j.tre.2014.12.016_b0050) 1990; 24
Rodríguez-Martín (10.1016/j.tre.2014.12.016_b0235) 2014; 50
Codato (10.1016/j.tre.2014.12.016_b0070) 2006; 54
Goldman (10.1016/j.tre.2014.12.016_b0155) 1969; 3
Nickel (10.1016/j.tre.2014.12.016_b0205) 2001
Magnanti (10.1016/j.tre.2014.12.016_b0185) 1981; 29
de Camargo (10.1016/j.tre.2014.12.016_b0100) 2009; 36
Campbell (10.1016/j.tre.2014.12.016_b0060) 2002
Mehrotra (10.1016/j.tre.2014.12.016_b0195) 1993; 62
Boysen (10.1016/j.tre.2014.12.016_b0045) 2010; 38
Frangioni (10.1016/j.tre.2014.12.016_b0130) 1997; 62
de Camargo (10.1016/j.tre.2014.12.016_b0110) 2008; 35
Appleget (10.1016/j.tre.2014.12.016_b0025) 2000
Correia (10.1016/j.tre.2014.12.016_b0095) 2014; 14
O’Kelly (10.1016/j.tre.2014.12.016_b0220) 1987; 32
10.1016/j.tre.2014.12.016_b0125
O’Kelly (10.1016/j.tre.2014.12.016_b0215) 1986; 18
Farahani (10.1016/j.tre.2014.12.016_b0120) 2013; 64
Benders (10.1016/j.tre.2014.12.016_b0035) 2005; 2
Sherali (10.1016/j.tre.2014.12.016_b0250) 2002; 22
Taghipourian (10.1016/j.tre.2014.12.016_b0255) 2012; 36
Campbell (10.1016/j.tre.2014.12.016_b0055) 1994; 72
Alumur (10.1016/j.tre.2014.12.016_b0010) 2008; 190
Baena (10.1016/j.tre.2014.12.016_b0030) 2011; 39
Ernst (10.1016/j.tre.2014.12.016_b0115) 1996; 4
Contreras (10.1016/j.tre.2014.12.016_b0085) 2009; 36
Contreras (10.1016/j.tre.2014.12.016_b0075) 2011; 59
Albareda-Sambola (10.1016/j.tre.2014.12.016_b0005) 2008; 36
Campbell (10.1016/j.tre.2014.12.016_b0065) 2012; 46
Benders (10.1016/j.tre.2014.12.016_b0040) 1962; 4
Hakimi (10.1016/j.tre.2014.12.016_b0160) 1964; 12
Contreras (10.1016/j.tre.2014.12.016_b0090) 2010; 202
Melo (10.1016/j.tre.2014.12.016_b0200) 2006; 33
Toh (10.1016/j.tre.2014.12.016_b0260) 1985; 24
Magnanti (10.1016/j.tre.2014.12.016_b0175) 1986
Frangioni (10.1016/j.tre.2014.12.016_b0135) 2002; 13
McDaniel (10.1016/j.tre.2014.12.016_b0190) 1977; 24
10.1016/j.tre.2014.12.016_b0140
Alumur (10.1016/j.tre.2014.12.016_b0015) 2009; 60
O’Kelly (10.1016/j.tre.2014.12.016_b0210) 1986; 20
Contreras (10.1016/j.tre.2014.12.016_b0080) 2011; 45
Magnanti (10.1016/j.tre.2014.12.016_b0180) 1981; 29
Sahinidis (10.1016/j.tre.2014.12.016_b0240) 1991; 15
Sasaki (10.1016/j.tre.2014.12.016_b0245) 2014; 47
de Camargo (10.1016/j.tre.2014.12.016_b0105) 2009; 43
Yoon (10.1016/j.tre.2014.12.016_b0270) 2008; 59
10.1016/j.tre.2014.12.016_b0145
10.1016/j.tre.2014.12.016_b0265
References_xml – volume: 35
  start-page: 1047
  year: 2008
  end-page: 1064
  ident: b0110
  article-title: Benders decomposition for the uncapacitated multiple allocation hub location problem
  publication-title: Comput. Oper. Res.
  contributor:
    fullname: Luna
– volume: 23
  start-page: 161
  year: 2003
  end-page: 168
  ident: b0170
  article-title: Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems
  publication-title: Pesquisa Operacional
  contributor:
    fullname: Lisser
– volume: 46
  start-page: 153
  year: 2012
  end-page: 169
  ident: b0065
  article-title: Twenty-five years of hub location research
  publication-title: Transp. Sci.
  contributor:
    fullname: O’Kelly
– volume: 39
  start-page: 310
  year: 2011
  end-page: 317
  ident: b0030
  article-title: Using the analytic center in the feasibility pump
  publication-title: Oper. Res. Lett.
  contributor:
    fullname: Castro
– volume: 4
  start-page: 139
  year: 1996
  end-page: 154
  ident: b0115
  article-title: Efficient algorithms for the uncapacitated single allocation p-hub median problem
  publication-title: Locat. Sci.
  contributor:
    fullname: Krishnamoorthy
– volume: 54
  start-page: 756
  year: 2006
  ident: b0070
  article-title: Combinatorial Benders’ cuts for mixed-integer linear programming
  publication-title: Oper. Research-baltimore Linthicum
  contributor:
    fullname: Fischetti
– start-page: 373
  year: 2002
  end-page: 407
  ident: b0060
  article-title: Hub location problems
  publication-title: Facility Location: Applications and Theory
  contributor:
    fullname: Krishnamoorthy
– volume: 47
  start-page: 27
  year: 2014
  end-page: 41
  ident: b0245
  article-title: A stackelberg hub arc location model for a competitive environment
  publication-title: Comput. Oper. Res.
  contributor:
    fullname: Ernst
– volume: 4
  start-page: 238
  year: 1962
  end-page: 252
  ident: b0040
  article-title: Partitioning procedures for solving mixed-variables programming problems
  publication-title: Numerische mathematik
  contributor:
    fullname: Benders
– volume: 59
  start-page: 80
  year: 2008
  end-page: 89
  ident: b0270
  article-title: The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
  publication-title: J. Oper. Res. Soc.
  contributor:
    fullname: Current
– volume: 2
  start-page: 3
  year: 2005
  end-page: 19
  ident: b0035
  article-title: Partitioning procedures for solving mixed-variables programming problems
  publication-title: CMS
  contributor:
    fullname: Benders
– volume: 43
  start-page: 936
  year: 2009
  end-page: 951
  ident: b0020
  article-title: The design of single allocation incomplete hub networks
  publication-title: Transp. Res. Part B
  contributor:
    fullname: Karasan
– volume: 24
  start-page: 16
  year: 1985
  end-page: 27
  ident: b0260
  article-title: The impact of hub and spoke network centralization and route monopoly on domestic airline profitability
  publication-title: Transp. J.
  contributor:
    fullname: Higgins
– volume: 64
  start-page: 1096
  year: 2013
  end-page: 1109
  ident: b0120
  article-title: Survey: hub location problems: a review of models, classification, solution techniques, and applications
  publication-title: Comput. Ind. Eng.
  contributor:
    fullname: Nikbakhsh
– volume: 72
  start-page: 387
  year: 1994
  end-page: 405
  ident: b0055
  article-title: Integer programming formulations of discrete hub location problems
  publication-title: Eur. J. Oper. Res.
  contributor:
    fullname: Campbell
– volume: 32
  start-page: 605
  year: 1998
  end-page: 616
  ident: b0225
  article-title: Hub location with flow economies of scale
  publication-title: Transp. Res. Part B: Methodol.
  contributor:
    fullname: Bryan
– volume: 62
  start-page: 497
  year: 1993
  end-page: 515
  ident: b0195
  article-title: Finding an interior point in the optimal face of linear programs
  publication-title: Math. Program.
  contributor:
    fullname: Ye
– volume: 36
  year: 2008
  ident: b0005
  article-title: The multi-period incremental service facility location problem
  publication-title: Comput. Oper. Res.
  contributor:
    fullname: Puerto
– volume: 15
  start-page: 481
  year: 1991
  end-page: 491
  ident: b0240
  article-title: Convergence properties of generalized benders decomposition
  publication-title: Comput. Chem. Eng.
  contributor:
    fullname: Grossmann
– volume: 18
  start-page: 343
  year: 1986
  end-page: 356
  ident: b0215
  article-title: Activity levels at hub facilities in interacting networks
  publication-title: Geograph. Anal.
  contributor:
    fullname: O’Kelly
– volume: 59
  start-page: 1477
  year: 2011
  end-page: 1490
  ident: b0075
  article-title: Benders decomposition for large-scale uncapacitated hub location
  publication-title: Oper. Res.
  contributor:
    fullname: Laporte
– volume: 29
  start-page: 464
  year: 1981
  end-page: 484
  ident: b0185
  article-title: Accelerating benders decomposition: algorithmic enhancement and model selection criteria
  publication-title: Oper. Res.
  contributor:
    fullname: Wong
– volume: 202
  start-page: 390
  year: 2010
  end-page: 400
  ident: b0090
  article-title: The tree of hubs location problem
  publication-title: Eur. J. Oper. Res.
  contributor:
    fullname: Marín
– volume: 29
  start-page: 464
  year: 1981
  end-page: 484
  ident: b0180
  article-title: Accelerating Benders decomposition: algorithmic enhancement and model selection criteria
  publication-title: Oper. Res.
  contributor:
    fullname: Wong
– start-page: 1
  year: 2001
  end-page: 12
  ident: b0205
  article-title: Hub location problems in urban traffic networks
  publication-title: Mathematics Methods and Optimization in Transportation Systems
  contributor:
    fullname: Sonneborn
– volume: 24
  start-page: 173
  year: 1990
  end-page: 192
  ident: b0050
  article-title: Locating transportation terminals to serve an expanding demand
  publication-title: Transp. Res. Part B: Methodol.
  contributor:
    fullname: Campbell
– volume: 22
  start-page: 319
  year: 2002
  end-page: 342
  ident: b0250
  article-title: A modification of Benders’ decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
  publication-title: J. Global Optim.
  contributor:
    fullname: Fraticelli
– start-page: 112
  year: 1986
  end-page: 154
  ident: b0175
  article-title: Tailoring Benders decomposition for uncapacitated network design
  publication-title: Netflow at Pisa
  contributor:
    fullname: Wong
– volume: 62
  start-page: 335
  year: 1997
  end-page: 336
  ident: b0130
  article-title: Dual-ascent methods and multicommodity flow problems
  publication-title: Bulletin-european Assoc. Theoret. Comput. Sci.
  contributor:
    fullname: Frangioni
– volume: 32
  start-page: 393
  year: 1987
  end-page: 404
  ident: b0220
  article-title: A quadratic integer program for the location of interacting hub facilities
  publication-title: Eur. J. Oper. Res.
  contributor:
    fullname: O’Kelly
– volume: 36
  start-page: 3097
  year: 2009
  end-page: 3106
  ident: b0100
  article-title: Multiple allocation hub-and-spoke network design under hub congestion
  publication-title: Comput. OR
  contributor:
    fullname: Luna
– year: 2000
  ident: b0025
  article-title: Explicit-constraint Branching for Solving Mixed-integer Programs
  contributor:
    fullname: Wood
– volume: 45
  start-page: 18
  year: 2011
  end-page: 32
  ident: b0080
  article-title: The dynamic uncapacitated hub location problem
  publication-title: Transp. Sci.
  contributor:
    fullname: Laporte
– volume: 12
  start-page: 450
  year: 1964
  end-page: 459
  ident: b0160
  article-title: Optimum locations of switching centers and the absolute centers and medians of a graph
  publication-title: Oper. Res.
  contributor:
    fullname: Hakimi
– volume: 190
  start-page: 1
  year: 2008
  end-page: 21
  ident: b0010
  article-title: Network hub location problems: the state of the art
  publication-title: Eur. J. Oper. Res.
  contributor:
    fullname: Kara
– volume: 50
  start-page: 161
  year: 2014
  end-page: 174
  ident: b0235
  article-title: A branch-and-cut algorithm for the hub location and routing problem
  publication-title: Comput. Oper. Res.
  contributor:
    fullname: Yaman
– volume: 60
  start-page: 1349
  year: 2009
  end-page: 1359
  ident: b0015
  article-title: A hub covering network design problem for cargo applications in Turkey
  publication-title: J. Oper. Res. Soc.
  contributor:
    fullname: Kara
– volume: 36
  start-page: 3257
  year: 2012
  end-page: 3270
  ident: b0255
  article-title: A fuzzy programming approach for dynamic virtual hub location problem
  publication-title: Appl. Math. Model.
  contributor:
    fullname: Makui
– volume: 199
  start-page: 89
  year: 2009
  end-page: 97
  ident: b0230
  article-title: Improving benders decomposition using a genetic algorithm
  publication-title: Eur. J. Oper. Res.
  contributor:
    fullname: Beasley
– volume: 20
  start-page: 92
  year: 1986
  end-page: 105
  ident: b0210
  article-title: The location of interacting hub facilities
  publication-title: Transp. Sci.
  contributor:
    fullname: O’Kelly
– volume: 36
  start-page: 3117
  year: 2009
  end-page: 3127
  ident: b0085
  article-title: Tight bounds from a path based formulation for the tree of hub location problem
  publication-title: Comput. Oper. Res.
  contributor:
    fullname: Marín
– volume: 47
  start-page: 1092
  year: 2011
  end-page: 1111
  ident: b0150
  article-title: Hub location problems in transportation networks
  publication-title: Transp. Res. Part E
  contributor:
    fullname: Nickel
– volume: 38
  start-page: 413
  year: 2010
  end-page: 422
  ident: b0045
  article-title: Cross dock scheduling: classification, literature review and research agenda
  publication-title: Omega
  contributor:
    fullname: Fliedner
– volume: 24
  start-page: 312
  year: 1977
  end-page: 319
  ident: b0190
  article-title: A modified Benders’ partitioning algorithm for mixed integer programming
  publication-title: Manage. Sci.
  contributor:
    fullname: Devine
– volume: 43
  start-page: 86
  year: 2009
  end-page: 97
  ident: b0105
  article-title: Benders decomposition for hub location problems with economies of scale
  publication-title: Transp. Sci.
  contributor:
    fullname: Luna
– volume: 33
  start-page: 181
  year: 2006
  end-page: 208
  ident: b0200
  article-title: Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
  publication-title: Comput. Oper. Res.
  contributor:
    fullname: Saldanha da Gama
– volume: 3
  start-page: 352
  year: 1969
  end-page: 360
  ident: b0155
  article-title: Optimal location for centers in a network
  publication-title: Transp. Sci.
  contributor:
    fullname: Goldman
– start-page: 273
  year: 2011
  end-page: 288
  ident: b0165
  article-title: Hub location problems: the location of interacting facilities
  publication-title: Foundations of Location Analysis
  contributor:
    fullname: Taner
– volume: 14
  start-page: 1
  year: 2014
  end-page: 25
  ident: b0095
  article-title: Multi-product capacitated single-allocation hub location problems: formulations and inequalities
  publication-title: Networks Spatial Econom.
  contributor:
    fullname: Saldanha-da Gama
– volume: 13
  start-page: 117
  year: 2002
  end-page: 156
  ident: b0135
  article-title: Generalized bundle methods
  publication-title: SIAM J. Optim.
  contributor:
    fullname: Frangioni
– volume: 32
  start-page: 393
  issue: 3
  year: 1987
  ident: 10.1016/j.tre.2014.12.016_b0220
  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
  contributor:
    fullname: O’Kelly
– ident: 10.1016/j.tre.2014.12.016_b0145
– volume: 72
  start-page: 387
  year: 1994
  ident: 10.1016/j.tre.2014.12.016_b0055
  article-title: Integer programming formulations of discrete hub location problems
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/0377-2217(94)90318-2
  contributor:
    fullname: Campbell
– volume: 50
  start-page: 161
  year: 2014
  ident: 10.1016/j.tre.2014.12.016_b0235
  article-title: A branch-and-cut algorithm for the hub location and routing problem
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2014.04.014
  contributor:
    fullname: Rodríguez-Martín
– volume: 36
  start-page: 3257
  issue: 7
  year: 2012
  ident: 10.1016/j.tre.2014.12.016_b0255
  article-title: A fuzzy programming approach for dynamic virtual hub location problem
  publication-title: Appl. Math. Model.
  doi: 10.1016/j.apm.2011.10.016
  contributor:
    fullname: Taghipourian
– volume: 46
  start-page: 153
  issue: 2
  year: 2012
  ident: 10.1016/j.tre.2014.12.016_b0065
  article-title: Twenty-five years of hub location research
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.1120.0410
  contributor:
    fullname: Campbell
– volume: 29
  start-page: 464
  issue: 3
  year: 1981
  ident: 10.1016/j.tre.2014.12.016_b0180
  article-title: Accelerating Benders decomposition: algorithmic enhancement and model selection criteria
  publication-title: Oper. Res.
  doi: 10.1287/opre.29.3.464
  contributor:
    fullname: Magnanti
– volume: 2
  start-page: 3
  issue: 1
  year: 2005
  ident: 10.1016/j.tre.2014.12.016_b0035
  article-title: Partitioning procedures for solving mixed-variables programming problems
  publication-title: CMS
  doi: 10.1007/s10287-004-0020-y
  contributor:
    fullname: Benders
– volume: 62
  start-page: 335
  year: 1997
  ident: 10.1016/j.tre.2014.12.016_b0130
  article-title: Dual-ascent methods and multicommodity flow problems
  publication-title: Bulletin-european Assoc. Theoret. Comput. Sci.
  contributor:
    fullname: Frangioni
– volume: 12
  start-page: 450
  year: 1964
  ident: 10.1016/j.tre.2014.12.016_b0160
  article-title: Optimum locations of switching centers and the absolute centers and medians of a graph
  publication-title: Oper. Res.
  doi: 10.1287/opre.12.3.450
  contributor:
    fullname: Hakimi
– volume: 24
  start-page: 16
  issue: 4
  year: 1985
  ident: 10.1016/j.tre.2014.12.016_b0260
  article-title: The impact of hub and spoke network centralization and route monopoly on domestic airline profitability
  publication-title: Transp. J.
  contributor:
    fullname: Toh
– volume: 15
  start-page: 481
  issue: 7
  year: 1991
  ident: 10.1016/j.tre.2014.12.016_b0240
  article-title: Convergence properties of generalized benders decomposition
  publication-title: Comput. Chem. Eng.
  doi: 10.1016/0098-1354(91)85027-R
  contributor:
    fullname: Sahinidis
– volume: 36
  year: 2008
  ident: 10.1016/j.tre.2014.12.016_b0005
  article-title: The multi-period incremental service facility location problem
  publication-title: Comput. Oper. Res.
  contributor:
    fullname: Albareda-Sambola
– volume: 43
  start-page: 936
  year: 2009
  ident: 10.1016/j.tre.2014.12.016_b0020
  article-title: The design of single allocation incomplete hub networks
  publication-title: Transp. Res. Part B
  doi: 10.1016/j.trb.2009.04.004
  contributor:
    fullname: Alumur
– volume: 22
  start-page: 319
  issue: 1
  year: 2002
  ident: 10.1016/j.tre.2014.12.016_b0250
  article-title: A modification of Benders’ decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
  publication-title: J. Global Optim.
  doi: 10.1023/A:1013827731218
  contributor:
    fullname: Sherali
– ident: 10.1016/j.tre.2014.12.016_b0125
– volume: 3
  start-page: 352
  year: 1969
  ident: 10.1016/j.tre.2014.12.016_b0155
  article-title: Optimal location for centers in a network
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.3.4.352
  contributor:
    fullname: Goldman
– volume: 39
  start-page: 310
  issue: 5
  year: 2011
  ident: 10.1016/j.tre.2014.12.016_b0030
  article-title: Using the analytic center in the feasibility pump
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2011.07.005
  contributor:
    fullname: Baena
– volume: 35
  start-page: 1047
  issue: 4
  year: 2008
  ident: 10.1016/j.tre.2014.12.016_b0110
  article-title: Benders decomposition for the uncapacitated multiple allocation hub location problem
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2006.07.002
  contributor:
    fullname: de Camargo
– ident: 10.1016/j.tre.2014.12.016_b0265
– volume: 4
  start-page: 238
  issue: 1
  year: 1962
  ident: 10.1016/j.tre.2014.12.016_b0040
  article-title: Partitioning procedures for solving mixed-variables programming problems
  publication-title: Numerische mathematik
  doi: 10.1007/BF01386316
  contributor:
    fullname: Benders
– year: 2000
  ident: 10.1016/j.tre.2014.12.016_b0025
  contributor:
    fullname: Appleget
– volume: 47
  start-page: 1092
  year: 2011
  ident: 10.1016/j.tre.2014.12.016_b0150
  article-title: Hub location problems in transportation networks
  publication-title: Transp. Res. Part E
  doi: 10.1016/j.tre.2011.04.009
  contributor:
    fullname: Gelareh
– start-page: 373
  year: 2002
  ident: 10.1016/j.tre.2014.12.016_b0060
  article-title: Hub location problems
  contributor:
    fullname: Campbell
– volume: 14
  start-page: 1
  issue: 1
  year: 2014
  ident: 10.1016/j.tre.2014.12.016_b0095
  article-title: Multi-product capacitated single-allocation hub location problems: formulations and inequalities
  publication-title: Networks Spatial Econom.
  doi: 10.1007/s11067-013-9197-3
  contributor:
    fullname: Correia
– volume: 43
  start-page: 86
  issue: 1
  year: 2009
  ident: 10.1016/j.tre.2014.12.016_b0105
  article-title: Benders decomposition for hub location problems with economies of scale
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.1080.0233
  contributor:
    fullname: de Camargo
– volume: 59
  start-page: 1477
  issue: 6
  year: 2011
  ident: 10.1016/j.tre.2014.12.016_b0075
  article-title: Benders decomposition for large-scale uncapacitated hub location
  publication-title: Oper. Res.
  doi: 10.1287/opre.1110.0965
  contributor:
    fullname: Contreras
– volume: 59
  start-page: 80
  issue: 1
  year: 2008
  ident: 10.1016/j.tre.2014.12.016_b0270
  article-title: The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
  publication-title: J. Oper. Res. Soc.
  doi: 10.1057/palgrave.jors.2602307
  contributor:
    fullname: Yoon
– volume: 38
  start-page: 413
  issue: 6
  year: 2010
  ident: 10.1016/j.tre.2014.12.016_b0045
  article-title: Cross dock scheduling: classification, literature review and research agenda
  publication-title: Omega
  doi: 10.1016/j.omega.2009.10.008
  contributor:
    fullname: Boysen
– volume: 54
  start-page: 756
  issue: 4
  year: 2006
  ident: 10.1016/j.tre.2014.12.016_b0070
  article-title: Combinatorial Benders’ cuts for mixed-integer linear programming
  publication-title: Oper. Research-baltimore Linthicum
  doi: 10.1287/opre.1060.0286
  contributor:
    fullname: Codato
– volume: 29
  start-page: 464
  issue: 3
  year: 1981
  ident: 10.1016/j.tre.2014.12.016_b0185
  article-title: Accelerating benders decomposition: algorithmic enhancement and model selection criteria
  publication-title: Oper. Res.
  doi: 10.1287/opre.29.3.464
  contributor:
    fullname: Magnanti
– volume: 23
  start-page: 161
  issue: 1
  year: 2003
  ident: 10.1016/j.tre.2014.12.016_b0170
  article-title: Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems
  publication-title: Pesquisa Operacional
  doi: 10.1590/S0101-74382003000100012
  contributor:
    fullname: Maculan
– volume: 62
  start-page: 497
  issue: 1-3
  year: 1993
  ident: 10.1016/j.tre.2014.12.016_b0195
  article-title: Finding an interior point in the optimal face of linear programs
  publication-title: Math. Program.
  doi: 10.1007/BF01585180
  contributor:
    fullname: Mehrotra
– volume: 47
  start-page: 27
  year: 2014
  ident: 10.1016/j.tre.2014.12.016_b0245
  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
  contributor:
    fullname: Sasaki
– volume: 24
  start-page: 173
  issue: 3
  year: 1990
  ident: 10.1016/j.tre.2014.12.016_b0050
  article-title: Locating transportation terminals to serve an expanding demand
  publication-title: Transp. Res. Part B: Methodol.
  doi: 10.1016/0191-2615(90)90015-Q
  contributor:
    fullname: Campbell
– volume: 202
  start-page: 390
  year: 2010
  ident: 10.1016/j.tre.2014.12.016_b0090
  article-title: The tree of hubs location problem
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2009.05.044
  contributor:
    fullname: Contreras
– start-page: 1
  year: 2001
  ident: 10.1016/j.tre.2014.12.016_b0205
  article-title: Hub location problems in urban traffic networks
  contributor:
    fullname: Nickel
– volume: 45
  start-page: 18
  issue: 1
  year: 2011
  ident: 10.1016/j.tre.2014.12.016_b0080
  article-title: The dynamic uncapacitated hub location problem
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.1100.0326
  contributor:
    fullname: Contreras
– volume: 4
  start-page: 139
  year: 1996
  ident: 10.1016/j.tre.2014.12.016_b0115
  article-title: Efficient algorithms for the uncapacitated single allocation p-hub median problem
  publication-title: Locat. Sci.
  doi: 10.1016/S0966-8349(96)00011-3
  contributor:
    fullname: Ernst
– volume: 24
  start-page: 312
  issue: 3
  year: 1977
  ident: 10.1016/j.tre.2014.12.016_b0190
  article-title: A modified Benders’ partitioning algorithm for mixed integer programming
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.24.3.312
  contributor:
    fullname: McDaniel
– volume: 20
  start-page: 92
  issue: 2
  year: 1986
  ident: 10.1016/j.tre.2014.12.016_b0210
  article-title: The location of interacting hub facilities
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.20.2.92
  contributor:
    fullname: O’Kelly
– ident: 10.1016/j.tre.2014.12.016_b0140
– start-page: 112
  year: 1986
  ident: 10.1016/j.tre.2014.12.016_b0175
  article-title: Tailoring Benders decomposition for uncapacitated network design
  publication-title: Netflow at Pisa
  doi: 10.1007/BFb0121090
  contributor:
    fullname: Magnanti
– volume: 18
  start-page: 343
  issue: 4
  year: 1986
  ident: 10.1016/j.tre.2014.12.016_b0215
  article-title: Activity levels at hub facilities in interacting networks
  publication-title: Geograph. Anal.
  doi: 10.1111/j.1538-4632.1986.tb00106.x
  contributor:
    fullname: O’Kelly
– volume: 36
  start-page: 3097
  issue: 12
  year: 2009
  ident: 10.1016/j.tre.2014.12.016_b0100
  article-title: Multiple allocation hub-and-spoke network design under hub congestion
  publication-title: Comput. OR
  doi: 10.1016/j.cor.2008.10.004
  contributor:
    fullname: de Camargo
– volume: 199
  start-page: 89
  issue: 1
  year: 2009
  ident: 10.1016/j.tre.2014.12.016_b0230
  article-title: Improving benders decomposition using a genetic algorithm
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2008.10.033
  contributor:
    fullname: Poojari
– volume: 33
  start-page: 181
  issue: 1
  year: 2006
  ident: 10.1016/j.tre.2014.12.016_b0200
  article-title: Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2004.07.005
  contributor:
    fullname: Melo
– volume: 13
  start-page: 117
  issue: 1
  year: 2002
  ident: 10.1016/j.tre.2014.12.016_b0135
  article-title: Generalized bundle methods
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623498342186
  contributor:
    fullname: Frangioni
– volume: 36
  start-page: 3117
  year: 2009
  ident: 10.1016/j.tre.2014.12.016_b0085
  article-title: Tight bounds from a path based formulation for the tree of hub location problem
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2008.12.009
  contributor:
    fullname: Contreras
– volume: 190
  start-page: 1
  year: 2008
  ident: 10.1016/j.tre.2014.12.016_b0010
  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
  contributor:
    fullname: Alumur
– volume: 60
  start-page: 1349
  year: 2009
  ident: 10.1016/j.tre.2014.12.016_b0015
  article-title: A hub covering network design problem for cargo applications in Turkey
  publication-title: J. Oper. Res. Soc.
  doi: 10.1057/jors.2008.92
  contributor:
    fullname: Alumur
– volume: 64
  start-page: 1096
  issue: 4
  year: 2013
  ident: 10.1016/j.tre.2014.12.016_b0120
  article-title: Survey: hub location problems: a review of models, classification, solution techniques, and applications
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2013.01.012
  contributor:
    fullname: Farahani
– volume: 32
  start-page: 605
  issue: 8
  year: 1998
  ident: 10.1016/j.tre.2014.12.016_b0225
  article-title: Hub location with flow economies of scale
  publication-title: Transp. Res. Part B: Methodol.
  doi: 10.1016/S0191-2615(98)00021-6
  contributor:
    fullname: O’Kelly
– start-page: 273
  year: 2011
  ident: 10.1016/j.tre.2014.12.016_b0165
  article-title: Hub location problems: the location of interacting facilities
  contributor:
    fullname: Kara
SSID ssj0001652
Score 2.4426675
Snippet •A novel mathematical model for the multi-period hub location with budget constraints is proposed.•A very efficient decomposition scheme is proposed.•A very...
Many transport service providers operate on hub-and-spoke network structures. Major operators may have several dedicated hub facilities that are leased for a...
SourceID hal
proquest
crossref
elsevier
SourceType Open Access Repository
Aggregation Database
Publisher
StartPage 67
SubjectTerms Algorithms
Benders decomposition
Budgeting
Computer Science
Contracts
Decision making models
Heuristic
Horizon
Hub location problems
Location analysis
Mathematical models
Mathematics
Meta-heuristic
Multi-period planning
Ports
Route optimization
Studies
Transport
Transportation
Transportation problem (Operations research)
Title Multi-period hub location problems in transportation
URI https://dx.doi.org/10.1016/j.tre.2014.12.016
https://www.proquest.com/docview/1662053951/abstract/
https://search.proquest.com/docview/1770270351
https://hal.science/hal-04538465
Volume 75
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fT9swED5BedkeEGOb6IDKm6Y9TMpaJ7bjPFYVqDCoJjYk3qzYcUT3kKKSIvGyv313rlPBNO1hj_GPKDr7vjvnzt8BfNRFanlq64SXTiaiVj4p00wm0hZaeS3tKNRPuZyp6bU4v5E3WzDp7sJQWmXE_jWmB7SOLcMozeHdfD78zjOl0BiixQ8kLojDO2iOhOjBzvjs63S2AWSuQuEdGp_QhC64GdK82iWRZXIRfgpS1fO_m6ftW8qT_AOugw063YPd6Dyy8fr7XsGWb_bh5RNKwX04uAy028tH9onNStxGLGrvaxDhsm1C1MaLit2uLCNDRgvDYlmZezZvWNvRnYeuN3B9evJjMk1i0YTEoS_U4lHQWV2lNSpnVum8zmXFvfMII77KVOXRAdFWViNea1_4UjotaqeyNCudcLXl2VvoNYvGHwDzo5Ejdpngt9SVLkoKeuaF9LKkU3UfPneyMndrbgzTJY39NChYQ4I1PDXY0gfRSdM8W2CD2P2vaR9Q8pvXExn2dHxhqA2d0Qy9J_nA-3DULYyJKnhvuFIpIgx6kH14v-lG5aGISNn4xQrH5DkeyymY-u7_Pu8QXuCTXCelHUGvXa78MXoprR3A9pdffIB7cXJ18W0Q9-RvvCbk5A
link.rule.ids 230,315,786,790,891,4521,24144,27957,27958,45620,45714
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fT9swED6x8rDxMA22iW5smAntYVLUOrEd57FCQwHavgwk3qzYcUR5SFFJkfbf7851KjZNe9irf0TW2ffdOXf-DuBUF6nlqW0SXjmZiEb5pEozmUhbaOW1tONQP2U2V-WNuLyVtztw1r-FobTKiP0bTA9oHVtGUZqjh8Vi9INnSqExRIsfSFwQh3eFzLkYwO7k4qqcbwGZq1B4h8YnNKEPboY0r25FZJlchJ-CVPX87-bpxR3lSf4B18EGnb-B19F5ZJPN-vZhx7cHsPeMUvAADmeBdnv1k31l8wqPEYva-xZEeGybELXxsmZ3a8vIkNHGsFhW5pEtWtb1dOeh6x3cnH-_PiuTWDQhcegLdXgVdFbXaYPKmdU6b3JZc-88woivM1V7dEC0lfWYN9oXvpJOi8apLM0qJ1xjefYeBu2y9YfA_HjsiF0m-C1NrYuKgp55Ib2s6FY9hG-9rMzDhhvD9Elj9wYFa0iwhqcGW4Ygemma3zbYIHb_a9oXlPz280SGXU6mhtrQGc3Qe5JPfAhH_caYqIKPhiuVIsKgBzmEk203Kg9FRKrWL9c4Js_xWk7B1A__t7xjeFlez6ZmejG_-givsEduEtSOYNCt1v4Teiyd_RxP5C8YveVB
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=Multi-period+hub+location+problems+in+transportation&rft.jtitle=Transportation+research.+Part+E%2C+Logistics+and+transportation+review&rft.au=Gelareh%2C+Shahin&rft.au=Neamatian+Monemi%2C+Rahimeh&rft.au=Nickel%2C+Stefan&rft.date=2015-03-01&rft.issn=1366-5545&rft.volume=75&rft.spage=67&rft.epage=94&rft_id=info:doi/10.1016%2Fj.tre.2014.12.016&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tre_2014_12_016
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1366-5545&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1366-5545&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1366-5545&client=summon