A fast (2+27)-approximation algorithm for capacitated cycle covering
We consider the capacitated cycle covering problem : given an undirected, complete graph G with metric edge lengths and demands on the vertices, we want to cover the vertices with vertex-disjoint cycles, each serving a demand of at most one. The objective is to minimize a linear combination of the t...
Saved in:
| Published in | Mathematical programming Vol. 192; no. 1-2; pp. 497 - 518 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.03.2022
Springer Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0025-5610 1436-4646 1436-4646 |
| DOI | 10.1007/s10107-021-01678-3 |
Cover
| Abstract | We consider the
capacitated cycle covering problem
: given an undirected, complete graph
G
with metric edge lengths and demands on the vertices, we want to cover the vertices with vertex-disjoint cycles, each serving a demand of at most one. The objective is to minimize a linear combination of the total length and the number of cycles. This problem is closely related to the capacitated vehicle routing problem (CVRP) and other cycle cover problems such as min-max cycle cover and bounded cycle cover. We show that a greedy algorithm followed by a post-processing step yields a
(
2
+
2
7
)
-approximation for this problem by comparing the solution to a polymatroid relaxation. We also show that the analysis of our algorithm is tight and provide a
2
+
ϵ
lower bound for the relaxation. |
|---|---|
| AbstractList | We consider the capacitated cycle covering problem: given an undirected, complete graph G with metric edge lengths and demands on the vertices, we want to cover the vertices with vertex-disjoint cycles, each serving a demand of at most one. The objective is to minimize a linear combination of the total length and the number of cycles. This problem is closely related to the capacitated vehicle routing problem (CVRP) and other cycle cover problems such as min-max cycle cover and bounded cycle cover. We show that a greedy algorithm followed by a post-processing step yields a (2+27)-approximation for this problem by comparing the solution to a polymatroid relaxation. We also show that the analysis of our algorithm is tight and provide a 2+ϵ lower bound for the relaxation. We consider the capacitated cycle covering problem: given an undirected, complete graph G with metric edge lengths and demands on the vertices, we want to cover the vertices with vertex-disjoint cycles, each serving a demand of at most one. The objective is to minimize a linear combination of the total length and the number of cycles. This problem is closely related to the capacitated vehicle routing problem (CVRP) and other cycle cover problems such as min-max cycle cover and bounded cycle cover. We show that a greedy algorithm followed by a post-processing step yields a [Formula omitted]-approximation for this problem by comparing the solution to a polymatroid relaxation. We also show that the analysis of our algorithm is tight and provide a [Formula omitted] lower bound for the relaxation. We consider the capacitated cycle covering problem : given an undirected, complete graph G with metric edge lengths and demands on the vertices, we want to cover the vertices with vertex-disjoint cycles, each serving a demand of at most one. The objective is to minimize a linear combination of the total length and the number of cycles. This problem is closely related to the capacitated vehicle routing problem (CVRP) and other cycle cover problems such as min-max cycle cover and bounded cycle cover. We show that a greedy algorithm followed by a post-processing step yields a $$(2 + \frac{2}{7})$$ ( 2 + 2 7 ) -approximation for this problem by comparing the solution to a polymatroid relaxation. We also show that the analysis of our algorithm is tight and provide a $$2 + \epsilon $$ 2 + ϵ lower bound for the relaxation. We consider the capacitated cycle covering problem : given an undirected, complete graph G with metric edge lengths and demands on the vertices, we want to cover the vertices with vertex-disjoint cycles, each serving a demand of at most one. The objective is to minimize a linear combination of the total length and the number of cycles. This problem is closely related to the capacitated vehicle routing problem (CVRP) and other cycle cover problems such as min-max cycle cover and bounded cycle cover. We show that a greedy algorithm followed by a post-processing step yields a ( 2 + 2 7 ) -approximation for this problem by comparing the solution to a polymatroid relaxation. We also show that the analysis of our algorithm is tight and provide a 2 + ϵ lower bound for the relaxation. |
| Audience | Academic |
| Author | Traub, Vera Tröbst, Thorben |
| Author_xml | – sequence: 1 givenname: Vera surname: Traub fullname: Traub, Vera organization: ETH Zürich – sequence: 2 givenname: Thorben orcidid: 0000-0003-3350-7337 surname: Tröbst fullname: Tröbst, Thorben email: t.troebst@uci.edu organization: University of California Irvine |
| BookMark | eNqNkE1rFTEUhoNU8Lb6B1wNuFEk9eRj8rG8VFuFghtdh9NMck2ZOxmTudb77007BcFFkSwOhPMc3vc5JSdTngIhrxmcMwD9oTJgoClwRoEpbah4RjZMCkWlkuqEbAB4T3vF4AU5rfUWAJgwZkM-bruIdene8vdcv6M4zyX_TntcUp46HHe5pOXHvou5dB5n9GnBJQydP_oxdD7_CiVNu5fkecSxhleP84x8v_z07eIzvf569eVie029BL5Q3QsJg7LaS4kGmdcWjRbKQgvW2364iVxiGKS50aGPTHOOA7dWGy2tiEqcEbHePUwzHu9wHN1cWthydAzcvQi3inBNhHsQ4USj3qxUq_bzEOribvOhTC2o40poJY1gfds6X7d2OAaXppiXgr69IeyTb7Zjav9bDcJKo4RtgFkBX3KtJUT3IKd5a2Aan07E_0H_q8Zj-TrfOw_lb40nqD-LjJ21 |
| CitedBy_id | crossref_primary_10_1007_s10878_024_01216_9 |
| Cites_doi | 10.1007/978-3-030-17953-3_27 10.1016/j.disopt.2006.04.002 10.1016/0167-6377(87)90012-5 10.1007/11538462_14 10.1287/opre.39.4.616 10.1287/moor.10.4.527 10.1016/j.ejor.2013.09.045 10.1287/mnsc.6.1.80 10.1007/s10107-004-0506-y 10.1007/s12532-016-0108-8 10.1016/j.disopt.2017.02.003 10.1007/s10878-018-0268-8 10.1007/s00453-014-9906-4 10.1007/978-3-319-44914-2_16 10.1016/j.orl.2003.11.010 10.1007/978-3-030-24766-9_8 10.1016/j.tcs.2016.01.041 10.1016/j.tcs.2019.04.009 10.1007/978-3-030-73879-2_1 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2021 COPYRIGHT 2022 Springer The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: The Author(s) 2021 – notice: COPYRIGHT 2022 Springer – notice: The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | C6C AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D ADTOC UNPAY |
| DOI | 10.1007/s10107-021-01678-3 |
| DatabaseName | Springer Nature OA Free Journals CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts CrossRef |
| Database_xml | – sequence: 1 dbid: C6C name: Springer Nature OA Free Journals url: http://www.springeropen.com/ sourceTypes: Publisher – sequence: 2 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics |
| EISSN | 1436-4646 |
| EndPage | 518 |
| ExternalDocumentID | 10.1007/s10107-021-01678-3 A703948639 10_1007_s10107_021_01678_3 |
| GrantInformation_xml | – fundername: National Science Foundation grantid: CCF-1815901 funderid: http://dx.doi.org/10.13039/100000001 |
| GroupedDBID | --K --Z -52 -5D -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 199 1B1 1N0 1OL 1SB 203 28- 29M 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 6TJ 78A 7WY 88I 8AO 8FE 8FG 8FL 8TC 8UJ 8VB 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACNCT ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMOZ AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFFNX AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHQJS AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS C6C CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EAD EAP EBA EBLON EBR EBS EBU ECS EDO EIOEI EJD EMI EMK EPL ESBYG EST ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IAO IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV KOW L6V LAS LLZTM M0C M0N M2P M4Y M7S MA- N2Q N9A NB0 NDZJH NPVJJ NQ- NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9R PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS QWB R4E R89 R9I RHV RIG RNI RNS ROL RPX RPZ RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SDD SDH SDM SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TH9 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WH7 WK8 XPP YLTOR Z45 Z5O Z7R Z7S Z7X Z7Y Z7Z Z81 Z83 Z86 Z88 Z8M Z8N Z8R Z8T Z8W Z92 ZL0 ZMTXR ZWQNP ~02 ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG ADXHL AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PQGLB PUEGO 7SC 8FD JQ2 L7M L~C L~D ADTOC UNPAY |
| ID | FETCH-LOGICAL-c402t-75340d697c44a8a1c79a873690561595dbf24aed48b7e5f1722ad299787493f63 |
| IEDL.DBID | C6C |
| ISSN | 0025-5610 1436-4646 |
| IngestDate | Tue Aug 19 21:31:27 EDT 2025 Thu Sep 25 00:45:23 EDT 2025 Mon Oct 20 16:52:01 EDT 2025 Thu Apr 24 22:52:24 EDT 2025 Wed Oct 01 02:58:28 EDT 2025 Fri Feb 21 02:47:29 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1-2 |
| Keywords | 68W20 68W25 90C05 90C27 90B06 |
| Language | English |
| License | cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c402t-75340d697c44a8a1c79a873690561595dbf24aed48b7e5f1722ad299787493f63 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0003-3350-7337 |
| OpenAccessLink | https://doi.org/10.1007/s10107-021-01678-3 |
| PQID | 2637648315 |
| PQPubID | 25307 |
| PageCount | 22 |
| ParticipantIDs | unpaywall_primary_10_1007_s10107_021_01678_3 proquest_journals_2637648315 gale_infotracacademiconefile_A703948639 crossref_citationtrail_10_1007_s10107_021_01678_3 crossref_primary_10_1007_s10107_021_01678_3 springer_journals_10_1007_s10107_021_01678_3 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2022-03-01 |
| PublicationDateYYYYMMDD | 2022-03-01 |
| PublicationDate_xml | – month: 03 year: 2022 text: 2022-03-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg – name: Heidelberg |
| PublicationSubtitle | A Publication of the Mathematical Optimization Society |
| PublicationTitle | Mathematical programming |
| PublicationTitleAbbrev | Math. Program |
| PublicationYear | 2022 |
| Publisher | Springer Berlin Heidelberg Springer Springer Nature B.V |
| Publisher_xml | – name: Springer Berlin Heidelberg – name: Springer – name: Springer Nature B.V |
| References | Labbé, Laporte, Mercure (CR16) 1991; 39 Schrijver (CR20) 2003 Das, Mathieu (CR9) 2015; 73 Dantzig, Ramser (CR8) 1959; 6 Diarrassouba (CR11) 2017; 25 CR10 Yu, Liu (CR24) 2019; 37 Khachay, Dubinin, Kochetov, Khachay, Beresnev, Nurminski, Pardalos (CR15) 2016 Pessoa, Sadykov, Uchoa, Vanderbeck, Lodi, Nagarajan (CR19) 2019 CR2 CR3 CR5 Maßberg, Vygen, Chekuri, Jansen, Rolim, Trevisan (CR17) 2005 Altinkemer, Gavish (CR1) 1987; 6 CR25 Goemans (CR13) 1995; 69 Vidal, Crainic, Gendreau, Prins (CR22) 2014; 234 Pecin, Pessoa, Poggi, Uchoa (CR18) 2017; 9 CR21 Yu, Liu (CR23) 2016; 654 Becker, Klein, Schild, Friggstad, Sack, Salavatipour (CR4) 2019 Even, Garg, Koenemann, Ravi, Sinha (CR12) 2004; 32 Haimovich, Kan (CR14) 1985; 10 Bompadre, Dror, Orlin (CR6) 2006; 3 Carr, Vempala (CR7) 2004; 100 T Vidal (1678_CR22) 2014; 234 G Even (1678_CR12) 2004; 32 MX Goemans (1678_CR13) 1995; 69 D Pecin (1678_CR18) 2017; 9 A Das (1678_CR9) 2015; 73 K Altinkemer (1678_CR1) 1987; 6 A Pessoa (1678_CR19) 2019 R Carr (1678_CR7) 2004; 100 M Labbé (1678_CR16) 1991; 39 J Maßberg (1678_CR17) 2005 GB Dantzig (1678_CR8) 1959; 6 W Yu (1678_CR23) 2016; 654 1678_CR10 1678_CR5 1678_CR3 1678_CR2 M Khachay (1678_CR15) 2016 1678_CR25 W Yu (1678_CR24) 2019; 37 I Diarrassouba (1678_CR11) 2017; 25 M Haimovich (1678_CR14) 1985; 10 1678_CR21 A Becker (1678_CR4) 2019 A Bompadre (1678_CR6) 2006; 3 A Schrijver (1678_CR20) 2003 |
| References_xml | – start-page: 354 year: 2019 end-page: 369 ident: CR19 article-title: A generic exact solver for vehicle routing and related problems publication-title: Integer Programming and Combinatorial Optimization doi: 10.1007/978-3-030-17953-3_27 – volume: 3 start-page: 299 issue: 4 year: 2006 end-page: 316 ident: CR6 article-title: Improved bounds for vehicle routing solutions publication-title: Discrete Optim. doi: 10.1016/j.disopt.2006.04.002 – volume: 6 start-page: 149 issue: 4 year: 1987 end-page: 158 ident: CR1 article-title: Heuristics for unequal weight delivery problems with a fixed error guarantee publication-title: Oper. Res. Lett. doi: 10.1016/0167-6377(87)90012-5 – ident: CR2 – start-page: 158 year: 2005 end-page: 169 ident: CR17 article-title: Approximation algorithms for network design and facility location with service capacities publication-title: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques doi: 10.1007/11538462_14 – ident: CR10 – volume: 39 start-page: 616 issue: 4 year: 1991 end-page: 622 ident: CR16 article-title: Capacitated vehicle routing on trees publication-title: Oper. Res. doi: 10.1287/opre.39.4.616 – volume: 10 start-page: 527 issue: 4 year: 1985 end-page: 542 ident: CR14 article-title: Bounds and heuristics for capacitated routing problems publication-title: Math. Oper. Res. doi: 10.1287/moor.10.4.527 – year: 2003 ident: CR20 publication-title: Combinatorial Optimization: Polyhedra and Efficiency – volume: 234 start-page: 658 issue: 3 year: 2014 end-page: 673 ident: CR22 article-title: A unified solution framework for multi-attribute vehicle routing problems publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2013.09.045 – volume: 6 start-page: 80 issue: 1 year: 1959 end-page: 91 ident: CR8 article-title: The truck dispatching problem publication-title: Manag. Sci. doi: 10.1287/mnsc.6.1.80 – volume: 100 start-page: 569 issue: 3 year: 2004 end-page: 587 ident: CR7 article-title: On the Held–Karp relaxation for the asymmetric and symmetric traveling salesman problems publication-title: Math. Program. doi: 10.1007/s10107-004-0506-y – ident: CR25 – ident: CR21 – ident: CR3 – volume: 9 start-page: 61 issue: 1 year: 2017 end-page: 100 ident: CR18 article-title: Improved branch-cut-and-price for capacitated vehicle routing publication-title: Math. Program. Comput. doi: 10.1007/s12532-016-0108-8 – volume: 69 start-page: 335 issue: 1 year: 1995 end-page: 349 ident: CR13 article-title: Worst-case comparison of valid inequalities for the TSP publication-title: Math. Program. – volume: 25 start-page: 86 year: 2017 end-page: 104 ident: CR11 article-title: On the complexity of the separation problem for rounded capacity inequalities publication-title: Discrete Optim. doi: 10.1016/j.disopt.2017.02.003 – volume: 37 start-page: 563 issue: 2 year: 2019 end-page: 578 ident: CR24 article-title: Better approximability results for min–max tree/cycle/path cover problems publication-title: J. Comb. Optim. doi: 10.1007/s10878-018-0268-8 – volume: 73 start-page: 115 issue: 1 year: 2015 end-page: 142 ident: CR9 article-title: A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing publication-title: Algorithmica doi: 10.1007/s00453-014-9906-4 – start-page: 193 year: 2016 end-page: 205 ident: CR15 article-title: PTAS for the Euclidean capacitated vehicle routing problem in publication-title: Discrete Optimization and Operations Research doi: 10.1007/978-3-319-44914-2_16 – ident: CR5 – volume: 32 start-page: 309 issue: 4 year: 2004 end-page: 315 ident: CR12 article-title: Min-max tree covers of graphs publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2003.11.010 – start-page: 99 year: 2019 end-page: 111 ident: CR4 article-title: A PTAS for bounded-capacity vehicle routing in planar graphs publication-title: Algorithms and Data Structures doi: 10.1007/978-3-030-24766-9_8 – volume: 654 start-page: 45 year: 2016 end-page: 58 ident: CR23 article-title: Improved approximation algorithms for some min–max and minimum cycle cover problems publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2016.01.041 – volume: 39 start-page: 616 issue: 4 year: 1991 ident: 1678_CR16 publication-title: Oper. Res. doi: 10.1287/opre.39.4.616 – ident: 1678_CR3 – volume: 10 start-page: 527 issue: 4 year: 1985 ident: 1678_CR14 publication-title: Math. Oper. Res. doi: 10.1287/moor.10.4.527 – volume: 654 start-page: 45 year: 2016 ident: 1678_CR23 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2016.01.041 – volume: 234 start-page: 658 issue: 3 year: 2014 ident: 1678_CR22 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2013.09.045 – volume: 73 start-page: 115 issue: 1 year: 2015 ident: 1678_CR9 publication-title: Algorithmica doi: 10.1007/s00453-014-9906-4 – volume: 6 start-page: 80 issue: 1 year: 1959 ident: 1678_CR8 publication-title: Manag. Sci. doi: 10.1287/mnsc.6.1.80 – volume: 3 start-page: 299 issue: 4 year: 2006 ident: 1678_CR6 publication-title: Discrete Optim. doi: 10.1016/j.disopt.2006.04.002 – volume: 37 start-page: 563 issue: 2 year: 2019 ident: 1678_CR24 publication-title: J. Comb. Optim. doi: 10.1007/s10878-018-0268-8 – ident: 1678_CR25 doi: 10.1016/j.tcs.2019.04.009 – volume: 25 start-page: 86 year: 2017 ident: 1678_CR11 publication-title: Discrete Optim. doi: 10.1016/j.disopt.2017.02.003 – ident: 1678_CR21 – volume: 32 start-page: 309 issue: 4 year: 2004 ident: 1678_CR12 publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2003.11.010 – volume: 6 start-page: 149 issue: 4 year: 1987 ident: 1678_CR1 publication-title: Oper. Res. Lett. doi: 10.1016/0167-6377(87)90012-5 – ident: 1678_CR2 – volume: 100 start-page: 569 issue: 3 year: 2004 ident: 1678_CR7 publication-title: Math. Program. doi: 10.1007/s10107-004-0506-y – ident: 1678_CR10 – start-page: 193 volume-title: Discrete Optimization and Operations Research year: 2016 ident: 1678_CR15 doi: 10.1007/978-3-319-44914-2_16 – ident: 1678_CR5 doi: 10.1007/978-3-030-73879-2_1 – start-page: 99 volume-title: Algorithms and Data Structures year: 2019 ident: 1678_CR4 doi: 10.1007/978-3-030-24766-9_8 – start-page: 158 volume-title: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques year: 2005 ident: 1678_CR17 doi: 10.1007/11538462_14 – volume: 69 start-page: 335 issue: 1 year: 1995 ident: 1678_CR13 publication-title: Math. Program. – volume-title: Combinatorial Optimization: Polyhedra and Efficiency year: 2003 ident: 1678_CR20 – volume: 9 start-page: 61 issue: 1 year: 2017 ident: 1678_CR18 publication-title: Math. Program. Comput. doi: 10.1007/s12532-016-0108-8 – start-page: 354 volume-title: Integer Programming and Combinatorial Optimization year: 2019 ident: 1678_CR19 doi: 10.1007/978-3-030-17953-3_27 |
| SSID | ssj0001388 |
| Score | 2.369144 |
| Snippet | We consider the
capacitated cycle covering problem
: given an undirected, complete graph
G
with metric edge lengths and demands on the vertices, we want to... We consider the capacitated cycle covering problem: given an undirected, complete graph G with metric edge lengths and demands on the vertices, we want to... |
| SourceID | unpaywall proquest gale crossref springer |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 497 |
| SubjectTerms | Algorithms Analysis Apexes Approximation Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Graph theory Greedy algorithms Lower bounds Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Route planning Theoretical Vehicle routing |
| SummonAdditionalLinks | – databaseName: Unpaywall dbid: UNPAY link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1baxQxFD7U7YP2wbu4tUoeBlTa2e4kmczM46KWIrQIulBBCElmUovb6bI7i9bS_-45c9muRYri45BMrifnkuT7AhBwa7nJUXgdp90qAitbVHphZoiahRP4mjb0Dw7V_li-P4qP1uBth4Wpb7t3R5INpoFYmspqd5r73RXgW0RbbJxCYUUH_ANMvgXrKkaPvAfr48MPo8_da63kItQgI6FCqaRqsTN_Lug3-3RdS68cl27A7UU5NeffzWSyYpH27kHR9aW5iPJtsKjswP28RvP4v529D3dbl5WNGhl7AGtF-RA2VogM8etgyf46fwQfR8ybecWC4BVn2-yLnxl3wS8vksvXQRDWLOY_ThrIJDOT47PZSfX1lKH3zByabkeotyJn7hxrY46umGIdj2G89-7Tm_2wfbwhdBiSViGGQXKYqyxxUprURC7JTJoIDMZxOuIszq3n0hS5TG1SxB79KJQZtI2oQGQmvBJPoFeelcVTYEORcp8kQ8WNkNZHaR6l6FgJb9KCW2X6EHVTpl3LbE4PbEz0FSczDaHGIdT1EGrRh-3lP9OG1-PG3C9JEjQteizZmRa7gO0j-iw9Qr2ZSWpUH7Y6YdGtNphrrlCNy1REcR92uvm-Sr6p3p2lkP1FMzf_LfszuMMJzFHfqNuCXjVbFM_Rxarsi3YF_QJ98RTD priority: 102 providerName: Unpaywall |
| Title | A fast (2+27)-approximation algorithm for capacitated cycle covering |
| URI | https://link.springer.com/article/10.1007/s10107-021-01678-3 https://www.proquest.com/docview/2637648315 https://link.springer.com/content/pdf/10.1007/s10107-021-01678-3.pdf |
| UnpaywallVersion | publishedVersion |
| Volume | 192 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 1436-4646 dateEnd: 20241102 omitProxy: true ssIdentifier: ssj0001388 issn: 1436-4646 databaseCode: ABDBF dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVEBS databaseName: Mathematics Source customDbUrl: eissn: 1436-4646 dateEnd: 20241102 omitProxy: false ssIdentifier: ssj0001388 issn: 1436-4646 databaseCode: AMVHM dateStart: 19711201 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/mathematics-source providerName: EBSCOhost – providerCode: PRVLSH databaseName: SpringerLink Journals customDbUrl: mediaType: online eissn: 1436-4646 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001388 issn: 1436-4646 databaseCode: AFBBN dateStart: 19711201 isFulltext: true providerName: Library Specific Holdings – providerCode: PRVAVX databaseName: SpringerLINK - Czech Republic Consortium customDbUrl: eissn: 1436-4646 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001388 issn: 1436-4646 databaseCode: AGYKE dateStart: 19970101 isFulltext: true titleUrlDefault: http://link.springer.com providerName: Springer Nature – providerCode: PRVAVX databaseName: SpringerLink Journals (ICM) customDbUrl: eissn: 1436-4646 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001388 issn: 1436-4646 databaseCode: U2A dateStart: 19970101 isFulltext: true titleUrlDefault: http://www.springerlink.com/journals/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB58HNSD-MTVVXIQVLSwTdI0PZb1sSgrHlzRU0jTVoV1Fbei_ntnut11FRG9tPQ1DTNJZibJ9wVgmycJtylWXsdptIrAygl2el5kiZqFE_iaBvTb56rVkafXwXVFk0NYmG_z9wRx82kwjVPSq2gqfxKm0UmpcmJWNUe9ri-0Hm7PSjFBBZD5WcYXJ_S9Kx6bE52DmZfek31_td3umNs5XoD5Kl5k8cDAizCR9ZZgboxFEK_aI-rV_jIcxiy3_YLt8n0e7nklZ_jb_QCgyGz39vH5vrh7YBirMoeO0hHGLEuZe0fxzNGCThS6Ap3jo8tmy6u2SvAcJoCFh0mHbKQqCp2UVlvfhZHVocDUF3URREGa5FzaLJU6CbMgx6gFLYSeCJurjESuxCpM9R572RqwhtA8D8OG4lbIJPd16msMY0RudcYTZWvgD3VnXMUjTttZdM0nAzLp26C-TalvI2qwP_rmacCi8evbO2QSQ00MJTtbIQWwfERWZWLspSJJhapBfWg1U7W9vsG6ESqphR_U4GBoyc_Hv_33YGTtPxRz_X_SN2CWE3SiXL9Wh6ni-SXbxICmSLZgOj65OTuic_uq1d4qazYeOzzGe53zi_jmA9h26So |
| linkProvider | Springer Nature |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT9swFH6CcgAOG2NM62DMByQ2tUGN7STOsRp0HaU9tRI7WbaTbGhdW9FUG_z1e69NSkEIwTFK8uLYz--H_b7PAEfcWm4SVF7HabWKwMoWjZ4XG6Jm4QS-pgX9bi9sD-T5ZXBZgMKmZbV7uSU5t9QrYDefltU4pb8hbeqvw4bEBIVXYKP57UfnbGmBfaFUeVQrxQcFWOZxKfcc0kOzvLI_ug2bs9HE3Pw1w-GKC2q9hkHZ-EXlye-TWW5P3O0DXseX_t0OvCpiUtZcKNEbWEtHu7C9wlSIV90lvev0LZw2WWamOfvMazz64s15yf9dLUCQzAx_jq-v8l9_GMbDzKEzdoRjSxPmblA8c1Q0ikL3YNA6639te8VxDJ7DJDP3MLGRjSSMIyelUcZ3UWxUJDC9xj4O4iCxGZcmTaSyURpkGBmhFqC3Q5MgY5GF4h1URuNR-h5YQyieRVEj5EZIm_kq8RWGSiIzKuU2NFXwyzHRruAqpyMzhvqOZZn6S2N_6Xl_aVGF2vKdyYKp48mnj2moNU1jlOxMgUbA9hEhlm6iJYwlNaoKB6U26GJ-TzUP0TBLJfygCvVyQO9uP_Xd-lKLntHMDy-T_gk22_3uhb743uvswxYnqMa8Xu4AKvn1LP2IAVRuD4v58h_vhAdt |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1ZS8QwEB48wONBPHE98yCoaHGbpG36uKwu3vig4FtI01aFtS5uRf33znTbtYqIPpa20zDTzJHk-wZgi0cRNzH-vJbTahWBlSN0ek5oiJqFE_iaFvQvLv3jG3l6693WUPzFafdqS3KAaSCWpiw_6MXpQQ345tISG6dS2KcN_lEYlxjdqIdB228PfbErlKqatlKmUMJmfpbxJTR9d9C1ndJpmHzJeub91XS7tWDUmYWZMotkrYHZ52AkyeZhusYtiFcXQ0LW_gIctlhq-jnb4Xs82HUKJvG3hwFskZnu3dPzQ37_yDCDZRbDpyXkWRIz-47imaVjnih0EW46R9ftY6dsoOBYLAtzB0sR2Yz9MLBSGmVcG4RGBQILYtSFF3pxlHJpkliqKEi8FHMZtBvGJ5zEMhSpL5ZgLHvKkmVgTaF4GgRNnxsho9RVsaswuRGpUQmPfNMAt9KdtiW7ODW56OpPXmTSt0Z960LfWjRgb_hOb8Ct8evT22QSTRMPJVtT4gdwfERhpVvou0JJg2rAWmU1Xc7IvuY-ulKphOs1YL-y5Oft3767P7T2H4a58j_pmzBxddjR5yeXZ6swxQlbURxwW4Ox_PklWceMJ482ip_6A4Ld7pc |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1baxQxFD7U7YP2wbu4tUoeBlTa2e4kmczM46KWIrQIulBBCElmUovb6bI7i9bS_-45c9muRYri45BMrifnkuT7AhBwa7nJUXgdp90qAitbVHphZoiahRP4mjb0Dw7V_li-P4qP1uBth4Wpb7t3R5INpoFYmspqd5r73RXgW0RbbJxCYUUH_ANMvgXrKkaPvAfr48MPo8_da63kItQgI6FCqaRqsTN_Lug3-3RdS68cl27A7UU5NeffzWSyYpH27kHR9aW5iPJtsKjswP28RvP4v529D3dbl5WNGhl7AGtF-RA2VogM8etgyf46fwQfR8ybecWC4BVn2-yLnxl3wS8vksvXQRDWLOY_ThrIJDOT47PZSfX1lKH3zByabkeotyJn7hxrY46umGIdj2G89-7Tm_2wfbwhdBiSViGGQXKYqyxxUprURC7JTJoIDMZxOuIszq3n0hS5TG1SxB79KJQZtI2oQGQmvBJPoFeelcVTYEORcp8kQ8WNkNZHaR6l6FgJb9KCW2X6EHVTpl3LbE4PbEz0FSczDaHGIdT1EGrRh-3lP9OG1-PG3C9JEjQteizZmRa7gO0j-iw9Qr2ZSWpUH7Y6YdGtNphrrlCNy1REcR92uvm-Sr6p3p2lkP1FMzf_LfszuMMJzFHfqNuCXjVbFM_Rxarsi3YF_QJ98RTD |
| 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+fast+%282%2B27%29-approximation+algorithm+for+capacitated+cycle+covering&rft.jtitle=Mathematical+programming&rft.au=Traub%2C+Vera&rft.au=Tr%C3%B6bst+Thorben&rft.date=2022-03-01&rft.pub=Springer+Nature+B.V&rft.issn=0025-5610&rft.eissn=1436-4646&rft.volume=192&rft.issue=1-2&rft.spage=497&rft.epage=518&rft_id=info:doi/10.1007%2Fs10107-021-01678-3&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0025-5610&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0025-5610&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0025-5610&client=summon |