A cut-and-solve based algorithm for the single-source capacitated facility location problem
► The Single Source Capacitated Facility Location Problem (SSCFLP) is studied. ► A cut-and-solve based exact method is proposed for SSCFLP. ► New Fenchel cutting plane algorithm is proposed to separate 0–1 knapsack polytopes. ► Partial integrality strategy is used to further tighten the lower bound...
Saved in:
| Published in: | European journal of operational research Vol. 221; no. 3; pp. 521 - 532 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Amsterdam
Elsevier B.V
16.09.2012
Elsevier Elsevier Sequoia S.A |
| Subjects: | |
| ISSN: | 0377-2217, 1872-6860 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | ► The Single Source Capacitated Facility Location Problem (SSCFLP) is studied. ► A cut-and-solve based exact method is proposed for SSCFLP. ► New Fenchel cutting plane algorithm is proposed to separate 0–1 knapsack polytopes. ► Partial integrality strategy is used to further tighten the lower bound of SSCFLP. ► Numerical experiments demonstrate the effectiveness of the proposed method.
In this paper, we present a cut-and-solve (CS) based exact algorithm for the Single Source Capacitated Facility Location Problem (SSCFLP). At each level of CS’s branching tree, it has only two nodes, corresponding to the Sparse Problem (SP) and the Dense Problem (DP), respectively. The SP, whose solution space is relatively small with the values of some variables fixed to zero, is solved to optimality by using a commercial MIP solver and its solution if it exists provides an upper bound to the SSCFLP. Meanwhile, the resolution of the LP of DP provides a lower bound for the SSCFLP. A cutting plane method which combines the lifted cover inequalities and Fenchel cutting planes to separate the 0–1 knapsack polytopes is applied to strengthen the lower bound of SSCFLP and that of DP. These lower bounds are further tightened with a partial integrality strategy. Numerical tests on benchmark instances demonstrate the effectiveness of the proposed cutting plane algorithm and the partial integrality strategy in reducing integrality gap and the effectiveness of the CS approach in searching an optimal solution in a reasonable time. Computational results on large sized instances are also presented. |
|---|---|
| AbstractList | In this paper, we present a cut-and-solve (CS) based exact algorithm for the Single Source Capacitated Facility Location Problem (SSCFLP). At each level of CS's branching tree, it has only two nodes, corresponding to the Sparse Problem (SP) and the Dense Problem (DP), respectively. The SP, whose solution space is relatively small with the values of some variables fixed to zero, is solved to optimality by using a commercial MIP solver and its solution if it exists provides an upper bound to the SSCFLP. Meanwhile, the resolution of the LP of DP provides a lower bound for the SSCFLP. A cutting plane method which combines the lifted cover inequalities and Fenchel cutting planes to separate the 0-1 knapsack polytopes is applied to strengthen the lower bound of SSCFLP and that of DP. These lower bounds are further tightened with a partial integrality strategy. Numerical tests on benchmark instances demonstrate the effectiveness of the proposed cutting plane algorithm and the partial integrality strategy in reducing integrality gap and the effectiveness of the CS approach in searching an optimal solution in a reasonable time. Computational results on large sized instances are also presented. [PUBLICATION ABSTRACT] ► The Single Source Capacitated Facility Location Problem (SSCFLP) is studied. ► A cut-and-solve based exact method is proposed for SSCFLP. ► New Fenchel cutting plane algorithm is proposed to separate 0–1 knapsack polytopes. ► Partial integrality strategy is used to further tighten the lower bound of SSCFLP. ► Numerical experiments demonstrate the effectiveness of the proposed method. In this paper, we present a cut-and-solve (CS) based exact algorithm for the Single Source Capacitated Facility Location Problem (SSCFLP). At each level of CS’s branching tree, it has only two nodes, corresponding to the Sparse Problem (SP) and the Dense Problem (DP), respectively. The SP, whose solution space is relatively small with the values of some variables fixed to zero, is solved to optimality by using a commercial MIP solver and its solution if it exists provides an upper bound to the SSCFLP. Meanwhile, the resolution of the LP of DP provides a lower bound for the SSCFLP. A cutting plane method which combines the lifted cover inequalities and Fenchel cutting planes to separate the 0–1 knapsack polytopes is applied to strengthen the lower bound of SSCFLP and that of DP. These lower bounds are further tightened with a partial integrality strategy. Numerical tests on benchmark instances demonstrate the effectiveness of the proposed cutting plane algorithm and the partial integrality strategy in reducing integrality gap and the effectiveness of the CS approach in searching an optimal solution in a reasonable time. Computational results on large sized instances are also presented. In this paper, we present a cut-and-solve (CS) based exact algorithm for the Single Source Capacitated Facility Location Problem (SSCFLP). At each level of CSas branching tree, it has only two nodes, corresponding to the Sparse Problem (SP) and the Dense Problem (DP), respectively. The SP, whose solution space is relatively small with the values of some variables fixed to zero, is solved to optimality by using a commercial MIP solver and its solution if it exists provides an upper bound to the SSCFLP. Meanwhile, the resolution of the LP of DP provides a lower bound for the SSCFLP. A cutting plane method which combines the lifted cover inequalities and Fenchel cutting planes to separate the 0a1 knapsack polytopes is applied to strengthen the lower bound of SSCFLP and that of DP. These lower bounds are further tightened with a partial integrality strategy. Numerical tests on benchmark instances demonstrate the effectiveness of the proposed cutting plane algorithm and the partial integrality strategy in reducing integrality gap and the effectiveness of the CS approach in searching an optimal solution in a reasonable time. Computational results on large sized instances are also presented. n this paper, we present a cut-and-solve (CS) based exact algorithm for the Single Source Capacitated Facility Location Problem (SSCFLP). At each level of CS's branching tree, it has only two nodes, corresponding to the Sparse Problem (SP) and the Dense Problem (DP), respectively. The SP, whose solution space is relatively small with the values of some variables fixed to zero, is solved to optimality by using a commercial MIP solver and its solution if it exists provides an upper bound to the SSCFLP. Meanwhile, the resolution of the LP of DP provides a lower bound for the SSCFLP. A cutting plane method which combines the lifted cover inequalities and Fenchel cutting planes to separate the 0-1 knapsack polytopes is applied to strengthen the lower bound of SSCFLP and that of DP. These lower bounds are further tightened with a partial integrality strategy. Numerical tests on benchmark instances demonstrate the effectiveness of the proposed cutting plane algorithm and the partial integrality strategy in reducing integrality gap and the effectiveness of the CS approach in searching an optimal solution in a reasonable time. Computational results on large sized instances are also presented. |
| Author | Yang, Zhen Chu, Feng Chen, Haoxun |
| Author_xml | – sequence: 1 givenname: Zhen surname: Yang fullname: Yang, Zhen email: zhenyang.utt@gmail.com organization: Industrial Systems Optimization Laboratory, Charles Delaunay Institute and UMR CNRS STMR 6279, University of Technology of Troyes, 12 rue Marie Curie, BP 2060, Troyes 10010, France – sequence: 2 givenname: Feng surname: Chu fullname: Chu, Feng email: feng.chu@iup.univ-evry.fr organization: Laboratoire d’Informatique, Biologie Intégrative et Systèmes Complexes (IBISC), EA 4526, Université d’Evry Val d’Essonne, 40 Rue du Pelvoux, CE1455 Courcouronnes, 91020 Evry Cedex, France – sequence: 3 givenname: Haoxun surname: Chen fullname: Chen, Haoxun email: haoxun.chen@utt.fr organization: Industrial Systems Optimization Laboratory, Charles Delaunay Institute and UMR CNRS STMR 6279, University of Technology of Troyes, 12 rue Marie Curie, BP 2060, Troyes 10010, France |
| BackLink | http://www.econis.eu/PPNSET?PPN=719717825$$DView this record in ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=25963236$$DView record in Pascal Francis https://hal.science/hal-00735248$$DView record in HAL |
| BookMark | eNp9kU9rGzEQxZeSQp20X6CXLpRCe1hXf3YlGXoxoW0Khl7aUw9iVjuKtcgrV5IN-fbVxm4IOeSkQfzezJt5l9XFFCasqreULCmh4vO4xDHEJSOULQlfkla-qBZUSdYIJchFtSBcyoYxKl9VlymNhBDa0W5R_VnX5pAbmIYmBX_EuoeEQw3-NkSXt7vahljnLdbJTbceC3SIBmsDezAuQy6sLZV3-a72wUB2Yar3MfQed6-rlxZ8wjfn96r6_e3rr-ubZvPz-4_r9aYxHeG5UcIo2xveGQktSCHQ2sGsJAWArgfVr1RPbI9CmV6InvSMALPAsFV8sErwq-rTqe8WvN5Ht4N4pwM4fbPe6PmPEMk71qojLezHE1s8_j1gynrnkkHvYcJwSJoKSXmn5IoV9P0TdCzLT2UTPd9cMk7bVaE-nClIBryNMBmXHmywbiU447PJdycOTZgeAZKWTaViXSHUiTAxpBTR6vsLl4PmCM6Xofdz9ajnrPWctSZcl6yLlD2R_m__rOjL2VHJ5ugw6mQcTgYHF9FkPQT3nPwfQaXDqw |
| CODEN | EJORDT |
| CitedBy_id | crossref_primary_10_3390_app11209687 crossref_primary_10_1007_s10479_018_3014_9 crossref_primary_10_1109_TITS_2023_3342319 crossref_primary_10_1155_2014_832814 crossref_primary_10_1007_s10732_023_09524_9 crossref_primary_10_1016_j_ejor_2017_04_032 crossref_primary_10_1016_j_ejor_2022_06_047 crossref_primary_10_1016_j_omega_2017_06_009 crossref_primary_10_1108_IMDS_07_2019_0380 crossref_primary_10_1109_JSYST_2021_3065306 crossref_primary_10_1016_j_ejor_2023_02_042 crossref_primary_10_1109_TSMC_2015_2417509 crossref_primary_10_1007_s10472_021_09756_0 crossref_primary_10_1007_s13675_017_0084_4 crossref_primary_10_1155_2016_1506084 crossref_primary_10_1016_j_eswa_2016_11_025 crossref_primary_10_3390_electronics14050961 crossref_primary_10_1016_j_cie_2014_12_014 crossref_primary_10_1080_09720502_2017_1358879 crossref_primary_10_1109_ACCESS_2025_3565153 crossref_primary_10_1109_TITS_2014_2368594 crossref_primary_10_1016_j_cor_2019_07_007 crossref_primary_10_1007_s10489_024_05441_x crossref_primary_10_1109_TITS_2016_2631893 crossref_primary_10_1109_TSMC_2016_2531696 crossref_primary_10_1016_j_tre_2020_101943 crossref_primary_10_1080_03155986_2025_2539634 crossref_primary_10_1080_21681015_2021_1955309 crossref_primary_10_1520_JTE20210449 crossref_primary_10_1109_ACCESS_2016_2633558 crossref_primary_10_1016_j_ejor_2014_04_007 crossref_primary_10_1007_s10479_023_05572_3 crossref_primary_10_1016_j_future_2024_01_010 crossref_primary_10_1016_j_cor_2022_105932 crossref_primary_10_1016_j_ejor_2018_11_062 crossref_primary_10_1016_j_cie_2019_05_036 crossref_primary_10_1016_j_asoc_2014_11_004 crossref_primary_10_1016_j_ejor_2019_02_055 crossref_primary_10_1016_j_ejor_2019_07_045 crossref_primary_10_1080_00207543_2019_1636320 crossref_primary_10_1080_01605682_2019_1639478 crossref_primary_10_1016_j_trc_2012_07_004 crossref_primary_10_1016_j_ejor_2019_07_008 crossref_primary_10_1287_ijoo_2021_0057 |
| Cites_doi | 10.1016/0377-2217(84)90211-X 10.1057/palgrave.jors.2601810 10.1057/jors.1986.84 10.1137/0803038 10.1287/opre.42.1.53 10.1016/j.tre.2007.09.001 10.1016/j.artint.2006.02.005 10.1007/s10479-007-0193-1 10.1016/S0377-2217(02)00829-9 10.1002/net.20059 10.1287/mnsc.1030.0193 10.1016/0377-2217(93)90118-7 10.1016/0377-2217(91)90261-S 10.1016/S0377-2217(98)00008-3 10.1016/0305-0548(87)90022-0 10.1057/palgrave.jors.2601353 10.1287/ijoc.11.1.117 10.1007/s10107-010-0359-5 10.1016/S0377-2217(99)00300-8 10.1007/s10852-007-9074-5 10.1057/jors.1983.242 10.1023/A:1009841107478 10.1016/S0167-6377(98)00025-X 10.1016/S0377-2217(98)00045-9 10.1137/S1052623493254455 10.1016/0377-2217(93)90219-D 10.1080/03155986.1999.11732381 10.1287/ijoc.10.4.427 10.1137/0134010 10.1007/BF02614517 10.1007/BF01580440 10.1287/opre.31.5.803 10.1057/palgrave.jors.2600621 10.1016/0377-2217(94)00013-3 |
| ContentType | Journal Article |
| Copyright | 2012 Elsevier B.V. 2015 INIST-CNRS Copyright Elsevier Sequoia S.A. Sep 16, 2012 Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2012 Elsevier B.V. – notice: 2015 INIST-CNRS – notice: Copyright Elsevier Sequoia S.A. Sep 16, 2012 – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION OQ6 IQODW 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D 7TA JG9 1XC |
| DOI | 10.1016/j.ejor.2012.03.047 |
| DatabaseName | CrossRef ECONIS Pascal-Francis Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Materials Business File Materials Research Database Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Materials Research Database Materials Business File |
| DatabaseTitleList | Technology Research Database Materials Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business Applied Sciences |
| EISSN | 1872-6860 |
| EndPage | 532 |
| ExternalDocumentID | oai:HAL:hal-00735248v1 2671589261 25963236 719717825 10_1016_j_ejor_2012_03_047 S0377221712002731 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADMUD AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AALRI AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADIYS ADJOM ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HVGLF R2- SEW VH1 WUQ ~HD AAYOK OQ6 AFXIZ AGCQF AGRNS BNPGV IQODW SSH 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D 7TA JG9 1XC |
| ID | FETCH-LOGICAL-c503t-86c8fbc35c7a4a766effdc971aaa5ba8b98b0fbe68cb66b0b20a2fa2e483df863 |
| ISICitedReferencesCount | 49 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000305768700006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Tue Oct 14 20:10:37 EDT 2025 Sun Nov 09 10:52:50 EST 2025 Sun Nov 30 05:40:14 EST 2025 Mon Jul 21 09:14:59 EDT 2025 Sat Mar 08 16:23:13 EST 2025 Sat Nov 29 01:41:05 EST 2025 Tue Nov 18 21:59:30 EST 2025 Fri Feb 23 02:32:27 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Facility location Cut-and-solve Cutting-plane method Polytope Branching Lower bound Tree(graph) Mixed integer programming Combinatorial optimization Cutting plane method Location problem Knapsack problem Upper bound Zero one programming Experimental design Capacity constraint |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0 Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c503t-86c8fbc35c7a4a766effdc971aaa5ba8b98b0fbe68cb66b0b20a2fa2e483df863 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| ORCID | 0000-0003-1225-8319 |
| PQID | 1016723149 |
| PQPubID | 45678 |
| PageCount | 12 |
| ParticipantIDs | hal_primary_oai_HAL_hal_00735248v1 proquest_miscellaneous_1671358792 proquest_journals_1016723149 pascalfrancis_primary_25963236 econis_primary_719717825 crossref_citationtrail_10_1016_j_ejor_2012_03_047 crossref_primary_10_1016_j_ejor_2012_03_047 elsevier_sciencedirect_doi_10_1016_j_ejor_2012_03_047 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-09-16 |
| PublicationDateYYYYMMDD | 2012-09-16 |
| PublicationDate_xml | – month: 09 year: 2012 text: 2012-09-16 day: 16 |
| PublicationDecade | 2010 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2012 |
| Publisher | Elsevier B.V Elsevier Elsevier Sequoia S.A |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier – name: Elsevier Sequoia S.A |
| References | Neebe, Rao (b0160) 1983; 34 Boyd, E. 1993b. Solving Integer Programs with Cutting Planes and Preprocessing. In: IPCO, pp. 209–220. Boyd (b0050) 1994; 42 Klabjan, Nemhauser, Tovey (b0145) 1998; 23 Gu, Nemhauser, Savelsbergh (b0125) 2000; 4 Pisinger (b0170) 1995; 87 Boccia, Sforza, Sterle, Vasilyev (b0035) 2008; 7 Agar, Salhi (b0005) 1998; 49 Climer, Zhang (b0065) 2006; 170 Chen, Ting (b0060) 2008; 44 Cortinhal, Captivo (b0080) 2003; 151 Ferreira, Martin, Weismantel (b0110) 1996; 6 Klincewica, Luss (b0150) 1986; 37 Pirkul (b0165) 1987; 14 Beasley (b0030) 1993; 65 Ceselli, Righini (b0055) 2005; 45 Rönnqvist, Tragantalerngsak, Holt (b0180) 1999; 116 Contreras, Dı´az (b0070) 2008; 157 Gu, Nemhauser, Savelsbergh (b0120) 1999; 11 Sridharan (b0185) 1993; 66 Ramos, Sáez (b0175) 2005; 56 CPLEX, 2009. ILOG CPLEX 12.1. Reference Manual. Cornuéjols, Sridharan, Thizy (b0075) 1991; 50 Weismantel (b0190) 1997; 77 Balas, Zemel (b0020) 1978; 34 Barcelo, Casanovas (b0025) 1984; 15 Delmaire, Dı´az, Fernández, Ortega (b0095) 1999; 37 Boyd (b0040) 1993; 3 Dı´az, Fernández (b0100) 2002; 53 Holmberg, Ronnqvist, Yuan (b0130) 1999; 113 Ahuja, Orlin, Pallottino, Scaparra, Scutellà. (b0010) 2004; 50 Crowder, Johnson, Padberg (b0090) 1983; 31 Klose (b0155) 2000; 126 Balas (b0015) 1975; 8 Kaparis, Letchford (b0140) 2010; 124 Gu, Nemhauser, Savelsbergh (b0115) 1998; 10 Boyd (10.1016/j.ejor.2012.03.047_b0040) 1993; 3 Balas (10.1016/j.ejor.2012.03.047_b0015) 1975; 8 10.1016/j.ejor.2012.03.047_b0045 Klincewica (10.1016/j.ejor.2012.03.047_b0150) 1986; 37 Balas (10.1016/j.ejor.2012.03.047_b0020) 1978; 34 Cortinhal (10.1016/j.ejor.2012.03.047_b0080) 2003; 151 Chen (10.1016/j.ejor.2012.03.047_b0060) 2008; 44 10.1016/j.ejor.2012.03.047_b0085 Boccia (10.1016/j.ejor.2012.03.047_b0035) 2008; 7 Ceselli (10.1016/j.ejor.2012.03.047_b0055) 2005; 45 Cornuéjols (10.1016/j.ejor.2012.03.047_b0075) 1991; 50 Rönnqvist (10.1016/j.ejor.2012.03.047_b0180) 1999; 116 Kaparis (10.1016/j.ejor.2012.03.047_b0140) 2010; 124 Pisinger (10.1016/j.ejor.2012.03.047_b0170) 1995; 87 Sridharan (10.1016/j.ejor.2012.03.047_b0185) 1993; 66 Holmberg (10.1016/j.ejor.2012.03.047_b0130) 1999; 113 Klabjan (10.1016/j.ejor.2012.03.047_b0145) 1998; 23 Contreras (10.1016/j.ejor.2012.03.047_b0070) 2008; 157 Agar (10.1016/j.ejor.2012.03.047_b0005) 1998; 49 Beasley (10.1016/j.ejor.2012.03.047_b0030) 1993; 65 Barcelo (10.1016/j.ejor.2012.03.047_b0025) 1984; 15 Boyd (10.1016/j.ejor.2012.03.047_b0050) 1994; 42 Pirkul (10.1016/j.ejor.2012.03.047_b0165) 1987; 14 Ahuja (10.1016/j.ejor.2012.03.047_b0010) 2004; 50 Climer (10.1016/j.ejor.2012.03.047_b0065) 2006; 170 Gu (10.1016/j.ejor.2012.03.047_b0115) 1998; 10 Ramos (10.1016/j.ejor.2012.03.047_b0175) 2005; 56 Delmaire (10.1016/j.ejor.2012.03.047_b0095) 1999; 37 Gu (10.1016/j.ejor.2012.03.047_b0120) 1999; 11 Gu (10.1016/j.ejor.2012.03.047_b0125) 2000; 4 Weismantel (10.1016/j.ejor.2012.03.047_b0190) 1997; 77 Crowder (10.1016/j.ejor.2012.03.047_b0090) 1983; 31 Neebe (10.1016/j.ejor.2012.03.047_b0160) 1983; 34 Dı´az (10.1016/j.ejor.2012.03.047_b0100) 2002; 53 Ferreira (10.1016/j.ejor.2012.03.047_b0110) 1996; 6 Klose (10.1016/j.ejor.2012.03.047_b0155) 2000; 126 |
| References_xml | – volume: 77 start-page: 49 year: 1997 end-page: 68 ident: b0190 article-title: On the 0–1 knapsack polytope publication-title: Mathematical Programming – volume: 65 start-page: 383 year: 1993 end-page: 399 ident: b0030 article-title: Lagrangian heuristics for location problems publication-title: European Journal of Operational Research – volume: 10 start-page: 427 year: 1998 end-page: 437 ident: b0115 article-title: Cover inequalities for 0–1 linear programs: computation publication-title: INFORMS Journal on Computing – volume: 4 start-page: 109 year: 2000 end-page: 129 ident: b0125 article-title: Sequence independent lifting in mixed integer programming publication-title: Journal of Combinatorial Optimization – volume: 87 start-page: 175 year: 1995 end-page: 187 ident: b0170 article-title: An expanding-core algorithm for the exact 0–1 knapsack problem publication-title: European Journal of Operational Research – volume: 11 start-page: 117 year: 1999 end-page: 123 ident: b0120 article-title: inequalities for 0–1 linear programs: complexity publication-title: INFORMS Journal on Computing – volume: 53 start-page: 728 year: 2002 end-page: 740 ident: b0100 article-title: A branch-and-price algorithm for the single source capacitated plant location problem publication-title: Journal of the Operational Research Society – volume: 50 start-page: 280 year: 1991 end-page: 297 ident: b0075 article-title: A comparison of heuristics and relaxations for the capacitated plant location problem publication-title: European Journal of Operational Research – volume: 113 start-page: 544 year: 1999 end-page: 559 ident: b0130 article-title: An exact algorithm for the capacitated facility location problems with single sourcing publication-title: European Journal of Operational Research – volume: 42 start-page: 53 year: 1994 end-page: 64 ident: b0050 article-title: Fenchel cutting planes for integer programs publication-title: Operation Research – volume: 34 start-page: 1107 year: 1983 end-page: 1113 ident: b0160 article-title: An algorithm for the fixed-charge assigning users to sources problem publication-title: Journal of the Operational Research Society – volume: 151 start-page: 333 year: 2003 end-page: 351 ident: b0080 article-title: Upper and lower bounds for the single source capacitated location problem publication-title: European Journal of Operational Research – volume: 37 start-page: 194 year: 1999 end-page: 225 ident: b0095 article-title: Reactive grasp and tabu search based heuristics for the single source capacitated plant location problem publication-title: Information Systems and Operational Research – volume: 45 start-page: 125 year: 2005 end-page: 142 ident: b0055 article-title: A branch and price algorithm for the capacitated p-median problem publication-title: Networks – volume: 3 start-page: 734 year: 1993 end-page: 750 ident: b0040 article-title: Generating Fenchel cutting planes for knapsack polyhedra publication-title: SIAM Journal on Optimization – volume: 116 start-page: 51 year: 1999 end-page: 68 ident: b0180 article-title: A repeated matching heuristic for the single-source capacitated facility location problem publication-title: European Journal of Operational Research – reference: CPLEX, 2009. ILOG CPLEX 12.1. Reference Manual. – volume: 56 start-page: 297 year: 2005 end-page: 306 ident: b0175 article-title: Solving capacitated facility location problems by Fenchel cutting planes publication-title: Journal of the Operational Research Society – volume: 7 start-page: 43 year: 2008 end-page: 58 ident: b0035 article-title: A cut and branch approach for the capacitated p-median problem based on Fenchel cutting planes publication-title: Journal of Mathematical Modeling and Algorithms – volume: 157 start-page: 73 year: 2008 end-page: 89 ident: b0070 article-title: Scatter search for the single source capacitated facility location problem publication-title: Annals of Operations Research – volume: 126 start-page: 408 year: 2000 end-page: 421 ident: b0155 article-title: A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem publication-title: European Journal of Operational Research – volume: 66 start-page: 305 year: 1993 end-page: 312 ident: b0185 article-title: A lagrangian heuristic for the capacitated plant location problem with single source constraints publication-title: European Journal of Operational Research – volume: 50 start-page: 749 year: 2004 end-page: 760 ident: b0010 article-title: A multi-exchange heuristic for the single-source capacitated facility location problem publication-title: Management Science – reference: Boyd, E. 1993b. Solving Integer Programs with Cutting Planes and Preprocessing. In: IPCO, pp. 209–220. – volume: 49 start-page: 1072 year: 1998 end-page: 1084 ident: b0005 article-title: Lagrangean heuristics applied to a variety of large capacitated plant location problems publication-title: Journal of the Operational Research Society – volume: 37 start-page: 495 year: 1986 end-page: 500 ident: b0150 article-title: A lagrangian relaxation heuristic for capacitated facility location with single-source constraints publication-title: Journal of the Operational Research Society – volume: 8 start-page: 146 year: 1975 end-page: 164 ident: b0015 article-title: Facets of the knapsack polytope publication-title: Mathematical Programming – volume: 6 start-page: 858 year: 1996 end-page: 877 ident: b0110 article-title: Solving multiple knapsack problems by cutting planes publication-title: SIAM Journal on Optimization – volume: 124 start-page: 69 year: 2010 end-page: 91 ident: b0140 article-title: Separation algorithms for 0–1 knapsack polytopes publication-title: Optimization Online, Mathematical Programming – volume: 14 start-page: 197 year: 1987 end-page: 208 ident: b0165 article-title: Efficient algorithm for the capacitated concentrator location problem publication-title: Computers and Operations Research – volume: 23 start-page: 35 year: 1998 end-page: 40 ident: b0145 article-title: The complexity of cover inequality separation publication-title: Operations Research Letters – volume: 44 start-page: 1099 year: 2008 end-page: 1122 ident: b0060 article-title: Combining lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem publication-title: Transportation Research Part E – volume: 15 start-page: 212 year: 1984 end-page: 226 ident: b0025 article-title: A heuristic Lagrangian algorithm for the capacitated plant location problem publication-title: European Journal of Operational Research – volume: 31 start-page: 803 year: 1983 end-page: 834 ident: b0090 article-title: Solving large-scale 0–1 linear programming programs publication-title: Operation Research – volume: 34 start-page: 119 year: 1978 end-page: 148 ident: b0020 article-title: Facets of the knapsack polytope from minimal covers publication-title: SIAM Journal on Applied Mathematics – volume: 170 start-page: 714 year: 2006 end-page: 738 ident: b0065 article-title: Cut-and-solve: an iterative search strategy for combinatorial optimization problems publication-title: Artificial Intelligence – volume: 15 start-page: 212 year: 1984 ident: 10.1016/j.ejor.2012.03.047_b0025 article-title: A heuristic Lagrangian algorithm for the capacitated plant location problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(84)90211-X – volume: 56 start-page: 297 year: 2005 ident: 10.1016/j.ejor.2012.03.047_b0175 article-title: Solving capacitated facility location problems by Fenchel cutting planes publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2601810 – volume: 37 start-page: 495 year: 1986 ident: 10.1016/j.ejor.2012.03.047_b0150 article-title: A lagrangian relaxation heuristic for capacitated facility location with single-source constraints publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1986.84 – volume: 3 start-page: 734 year: 1993 ident: 10.1016/j.ejor.2012.03.047_b0040 article-title: Generating Fenchel cutting planes for knapsack polyhedra publication-title: SIAM Journal on Optimization doi: 10.1137/0803038 – volume: 42 start-page: 53 year: 1994 ident: 10.1016/j.ejor.2012.03.047_b0050 article-title: Fenchel cutting planes for integer programs publication-title: Operation Research doi: 10.1287/opre.42.1.53 – volume: 44 start-page: 1099 year: 2008 ident: 10.1016/j.ejor.2012.03.047_b0060 article-title: Combining lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem publication-title: Transportation Research Part E doi: 10.1016/j.tre.2007.09.001 – volume: 170 start-page: 714 year: 2006 ident: 10.1016/j.ejor.2012.03.047_b0065 article-title: Cut-and-solve: an iterative search strategy for combinatorial optimization problems publication-title: Artificial Intelligence doi: 10.1016/j.artint.2006.02.005 – volume: 157 start-page: 73 year: 2008 ident: 10.1016/j.ejor.2012.03.047_b0070 article-title: Scatter search for the single source capacitated facility location problem publication-title: Annals of Operations Research doi: 10.1007/s10479-007-0193-1 – volume: 151 start-page: 333 year: 2003 ident: 10.1016/j.ejor.2012.03.047_b0080 article-title: Upper and lower bounds for the single source capacitated location problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00829-9 – volume: 45 start-page: 125 issue: 3 year: 2005 ident: 10.1016/j.ejor.2012.03.047_b0055 article-title: A branch and price algorithm for the capacitated p-median problem publication-title: Networks doi: 10.1002/net.20059 – ident: 10.1016/j.ejor.2012.03.047_b0085 – volume: 50 start-page: 749 issue: 6 year: 2004 ident: 10.1016/j.ejor.2012.03.047_b0010 article-title: A multi-exchange heuristic for the single-source capacitated facility location problem publication-title: Management Science doi: 10.1287/mnsc.1030.0193 – volume: 65 start-page: 383 year: 1993 ident: 10.1016/j.ejor.2012.03.047_b0030 article-title: Lagrangian heuristics for location problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(93)90118-7 – ident: 10.1016/j.ejor.2012.03.047_b0045 – volume: 50 start-page: 280 year: 1991 ident: 10.1016/j.ejor.2012.03.047_b0075 article-title: A comparison of heuristics and relaxations for the capacitated plant location problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(91)90261-S – volume: 113 start-page: 544 year: 1999 ident: 10.1016/j.ejor.2012.03.047_b0130 article-title: An exact algorithm for the capacitated facility location problems with single sourcing publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(98)00008-3 – volume: 14 start-page: 197 year: 1987 ident: 10.1016/j.ejor.2012.03.047_b0165 article-title: Efficient algorithm for the capacitated concentrator location problem publication-title: Computers and Operations Research doi: 10.1016/0305-0548(87)90022-0 – volume: 53 start-page: 728 year: 2002 ident: 10.1016/j.ejor.2012.03.047_b0100 article-title: A branch-and-price algorithm for the single source capacitated plant location problem publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2601353 – volume: 11 start-page: 117 year: 1999 ident: 10.1016/j.ejor.2012.03.047_b0120 article-title: inequalities for 0–1 linear programs: complexity publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.11.1.117 – volume: 124 start-page: 69 issue: 1–2 year: 2010 ident: 10.1016/j.ejor.2012.03.047_b0140 article-title: Separation algorithms for 0–1 knapsack polytopes publication-title: Optimization Online, Mathematical Programming doi: 10.1007/s10107-010-0359-5 – volume: 126 start-page: 408 year: 2000 ident: 10.1016/j.ejor.2012.03.047_b0155 article-title: A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00300-8 – volume: 7 start-page: 43 year: 2008 ident: 10.1016/j.ejor.2012.03.047_b0035 article-title: A cut and branch approach for the capacitated p-median problem based on Fenchel cutting planes publication-title: Journal of Mathematical Modeling and Algorithms doi: 10.1007/s10852-007-9074-5 – volume: 34 start-page: 1107 year: 1983 ident: 10.1016/j.ejor.2012.03.047_b0160 article-title: An algorithm for the fixed-charge assigning users to sources problem publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1983.242 – volume: 4 start-page: 109 year: 2000 ident: 10.1016/j.ejor.2012.03.047_b0125 article-title: Sequence independent lifting in mixed integer programming publication-title: Journal of Combinatorial Optimization doi: 10.1023/A:1009841107478 – volume: 23 start-page: 35 year: 1998 ident: 10.1016/j.ejor.2012.03.047_b0145 article-title: The complexity of cover inequality separation publication-title: Operations Research Letters doi: 10.1016/S0167-6377(98)00025-X – volume: 116 start-page: 51 year: 1999 ident: 10.1016/j.ejor.2012.03.047_b0180 article-title: A repeated matching heuristic for the single-source capacitated facility location problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(98)00045-9 – volume: 6 start-page: 858 year: 1996 ident: 10.1016/j.ejor.2012.03.047_b0110 article-title: Solving multiple knapsack problems by cutting planes publication-title: SIAM Journal on Optimization doi: 10.1137/S1052623493254455 – volume: 66 start-page: 305 year: 1993 ident: 10.1016/j.ejor.2012.03.047_b0185 article-title: A lagrangian heuristic for the capacitated plant location problem with single source constraints publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(93)90219-D – volume: 37 start-page: 194 issue: 3 year: 1999 ident: 10.1016/j.ejor.2012.03.047_b0095 article-title: Reactive grasp and tabu search based heuristics for the single source capacitated plant location problem publication-title: Information Systems and Operational Research doi: 10.1080/03155986.1999.11732381 – volume: 10 start-page: 427 year: 1998 ident: 10.1016/j.ejor.2012.03.047_b0115 article-title: Cover inequalities for 0–1 linear programs: computation publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.10.4.427 – volume: 34 start-page: 119 year: 1978 ident: 10.1016/j.ejor.2012.03.047_b0020 article-title: Facets of the knapsack polytope from minimal covers publication-title: SIAM Journal on Applied Mathematics doi: 10.1137/0134010 – volume: 77 start-page: 49 year: 1997 ident: 10.1016/j.ejor.2012.03.047_b0190 article-title: On the 0–1 knapsack polytope publication-title: Mathematical Programming doi: 10.1007/BF02614517 – volume: 8 start-page: 146 year: 1975 ident: 10.1016/j.ejor.2012.03.047_b0015 article-title: Facets of the knapsack polytope publication-title: Mathematical Programming doi: 10.1007/BF01580440 – volume: 31 start-page: 803 year: 1983 ident: 10.1016/j.ejor.2012.03.047_b0090 article-title: Solving large-scale 0–1 linear programming programs publication-title: Operation Research doi: 10.1287/opre.31.5.803 – volume: 49 start-page: 1072 year: 1998 ident: 10.1016/j.ejor.2012.03.047_b0005 article-title: Lagrangean heuristics applied to a variety of large capacitated plant location problems publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2600621 – volume: 87 start-page: 175 year: 1995 ident: 10.1016/j.ejor.2012.03.047_b0170 article-title: An expanding-core algorithm for the exact 0–1 knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)00013-3 |
| SSID | ssj0001515 |
| Score | 2.2862344 |
| Snippet | ► The Single Source Capacitated Facility Location Problem (SSCFLP) is studied. ► A cut-and-solve based exact method is proposed for SSCFLP. ► New Fenchel... In this paper, we present a cut-and-solve (CS) based exact algorithm for the Single Source Capacitated Facility Location Problem (SSCFLP). At each level of... n this paper, we present a cut-and-solve (CS) based exact algorithm for the Single Source Capacitated Facility Location Problem (SSCFLP). At each level of CS's... |
| SourceID | hal proquest pascalfrancis econis crossref elsevier |
| SourceType | Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 521 |
| SubjectTerms | Algorithms Applied sciences Branch & bound algorithms Computer Science Cut-and-solve Cutting Cutting stock problem Cutting-plane method Exact sciences and technology Facility location Flows in networks. Combinatorial problems Integer programming Logistics Lower bounds Mathematical analysis Mathematical models Mathematical programming Operational research and scientific management Operational research. Management science Operations Research Optimization algorithms Planes Position (location) Strategy Studies |
| Title | A cut-and-solve based algorithm for the single-source capacitated facility location problem |
| URI | https://dx.doi.org/10.1016/j.ejor.2012.03.047 http://www.econis.eu/PPNSET?PPN=719717825 https://www.proquest.com/docview/1016723149 https://www.proquest.com/docview/1671358792 https://hal.science/hal-00735248 |
| Volume | 221 |
| WOSCitedRecordID | wos000305768700006&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: ScienceDirect Freedom Collection - Elsevier customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLZYNyEQ4lJAC4zJIN6qTKkTx85jNQ0VhCYehlTgIbIde21VkqqXqT-f49jJ2k2b4IGXKHLcOM357HP85VwQ-qg1LYgSOjQRY2GSGusEQLJQCyEpNSpSgtfFJtj5OR-Nsm-e0F_W5QRYWfLNJpv_V1FDGwjbhs7-g7jbm0IDnIPQ4Qhih-NfCX7QU-tVKMoihHGsazroqaInZpfVYrIa_279Ci1JMNOhY-97CpSmsvFm0NfAWW2dW0VX48OXnbmTxvcmLTQsGnLRZxFq2eYfnpj-Ob4OPjsdr2vjWXv1WTe5dXAoqs263OYkrHNHFrqQSUeUea2-tZbFgARCXJhms_ASFxvtERZvLaPUX3EamToG9NZi73iH6YmeVjazq2V145PIJfC8kUSb9TPYt8JueA_tE0Yz3kH7g89noy-t1raGXf3FyT-oD7ByvoA3R9gxYg4sczFZ7lgze2PrVvtkLpYw04wrkXJL29cmzMVz9NTvPfDAYeYFeqDLLnrYhD500bOmxAf2K34XPd7KV_kS_RrgHWzhGlu4xRYGbGHAFt7BFt7CFm6whRtsYY-tV-j7p7OL02Hoq3OEikbxKuSp4kaqmComEsHSVBtTKHjNQggqBZcZl5GROuVKpqmMJIkEMYLohMeF4Wn8GnXKqtSHCEsmpCRZmomCJoYIKcAoTUhfS8m0YDpA_eZ158qnrrcVVGZ546M4za2IciuiPIpzEFGAeu1v5i5xy729D50U274tYgJEG7nm3ip11mYOOLz3lh8ABO39bBr34eBrbtvs53FKEn7VD9DxDkba7oSCZiRxGqCjBjS5n8_LekQGG7MkC9D79jLoBfuxT5S6WkOf1Bbf5Cwjb-7-b2_Ro-vpe4Q6q8Vav0MH6mo1WS6O_RT5AyzQ2KE |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+cut-and-solve+based+algorithm+for+the+single-source+capacitated+facility+location+problem&rft.jtitle=European+journal+of+operational+research&rft.au=Yang%2C+Zhen&rft.au=Chu%2C+Feng&rft.au=Chen%2C+Haoxun&rft.date=2012-09-16&rft.pub=Elsevier&rft.issn=0377-2217&rft.volume=221&rft.issue=3&rft.spage=521&rft.epage=532&rft_id=info:doi/10.1016%2Fj.ejor.2012.03.047&rft.externalDocID=719717825 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |