Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
This paper studies the generalized hop-constrained minimum spanning tree problem (GHMSTP) which has applications in backbone network design subject to quality-of-service constraints that restrict the maximum number of intermediate routers along each communication path. Different possibilities to mod...
Saved in:
| Published in: | Computers & operations research Vol. 65; pp. 1 - 18 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Elsevier Ltd
01.01.2016
Pergamon Press Inc |
| Subjects: | |
| ISSN: | 0305-0548, 1873-765X, 0305-0548 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | This paper studies the generalized hop-constrained minimum spanning tree problem (GHMSTP) which has applications in backbone network design subject to quality-of-service constraints that restrict the maximum number of intermediate routers along each communication path. Different possibilities to model the GHMSTP as an integer linear program and strengthening valid inequalities are studied. The obtained formulations are compared theoretically, i.e., by means of their linear programming relaxation. In addition, branch-and-cut approaches based on these formulations are developed and compared in a computational study.
•New optimization problem generalizing the generalized minimum spanning tree problem and the hop constrained minimum spanning tree problem.•Extended formulations based on layered graph reformulations and strength- ening valid inequalities.•Theoretical and computational comparisons between all formulations. |
|---|---|
| AbstractList | This paper studies the generalized hop-constrained minimum spanning tree problem (GHMSTP) which has applications in backbone network design subject to quality-of-service constraints that restrict the maximum number of intermediate routers along each communication path. Different possibilities to model the GHMSTP as an integer linear program and strengthening valid inequalities are studied. The obtained formulations are compared theoretically, i.e., by means of their linear programming relaxation. In addition, branch-and-cut approaches based on these formulations are developed and compared in a computational study. This paper studies the generalized hop-constrained minimum spanning tree problem (GHMSTP) which has applications in backbone network design subject to quality-of-service constraints that restrict the maximum number of intermediate routers along each communication path. Different possibilities to model the GHMSTP as an integer linear program and strengthening valid inequalities are studied. The obtained formulations are compared theoretically, i.e., by means of their linear programming relaxation. In addition, branch-and-cut approaches based on these formulations are developed and compared in a computational study. •New optimization problem generalizing the generalized minimum spanning tree problem and the hop constrained minimum spanning tree problem.•Extended formulations based on layered graph reformulations and strength- ening valid inequalities.•Theoretical and computational comparisons between all formulations. |
| Author | Leitner, Markus |
| Author_xml | – sequence: 1 givenname: Markus orcidid: 0000-0002-3313-9610 surname: Leitner fullname: Leitner, Markus email: markus.leitner@univie.ac.at organization: Department of Statistics and Operations Research, University of Vienna, Oskar-Morgenstern-Platz 1, 1090 Vienna, Austria |
| BookMark | eNp9kU9vEzEQxS3USqSBD8DNEhcuu_hP1vaKE6poQYrEBaTeLMceJw679mI7iPLp6yiceuhcRiO938wbvRt0FVMEhN5R0lNCxcdjb1PuGaFDT0RPKHuFVlRJ3kkxPFyhFeFk6MiwUa_RTSlH0koyukK_tuYRMji8z2Y54Dk5mAo20WH4a2zFZtqnHOphLtinjOsB8B4iZDOFf406pKWzKZaaTYhtnkMM82nGZTExhrjHNQPgJafdBPMbdO3NVODt_75GP---_Lj92m2_33-7_bztLFdj7ZjjFry31nA6OkL8KEbKR2acZYwLPyrmnQTFNztBd4b50QolqFV-aH9zy9fow2Vvu_v7BKXqORQL02QipFPRVFFBpFSENun7Z9JjOuXY3GkqmdywDSWsqeRFZXMqJYPXNlRTQ4rnvydNiT6HoI-6haDPIWgi9NnMGtFn5JLDbPLji8ynC9OSgD8Bsi42QLTgQgZbtUvhBfoJq06i2g |
| CODEN | CMORAP |
| CitedBy_id | crossref_primary_10_1002_net_22086 crossref_primary_10_1111_itor_12880 crossref_primary_10_1016_j_eswa_2022_119372 crossref_primary_10_1016_j_tcs_2021_09_003 crossref_primary_10_1002_net_22005 crossref_primary_10_17230_ingciencia_13_25_3 crossref_primary_10_1016_j_cor_2017_10_005 crossref_primary_10_1007_s10589_016_9836_y crossref_primary_10_1016_j_cor_2018_09_007 crossref_primary_10_1016_j_ejor_2017_04_061 crossref_primary_10_1016_j_cie_2020_106365 crossref_primary_10_1016_j_cor_2019_07_003 crossref_primary_10_1016_j_ejor_2019_05_017 |
| Cites_doi | 10.1016/S0377-2217(00)00143-0 10.1023/A:1018967121276 10.1016/0377-2217(95)00090-9 10.1007/s10107-013-0743-z 10.1007/PL00009180 10.1016/S0167-6377(98)00029-7 10.1002/net.3230260407 10.1016/0305-0548(88)90033-0 10.1287/opre.45.3.378 10.1287/ijoc.3.4.376 10.1016/j.ejor.2007.08.021 10.1016/j.ejor.2004.07.058 10.1007/s10107-009-0297-2 10.1007/s10479-006-0049-0 10.1287/ijoc.1040.0077 10.1007/978-3-642-20807-2_30 10.1016/0305-0548(94)00074-I 10.1002/net.10105 10.1016/j.ejor.2010.08.011 10.1287/ijoc.1110.0472 10.1016/S0377-2217(00)00267-8 10.1002/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O 10.1287/ijoc.11.2.188 10.1016/j.ejor.2013.11.029 10.1007/s10732-007-9047-x 10.1287/ijoc.1120.0500 10.1007/s10732-009-9123-5 10.1002/net.20370 10.1007/978-0-387-48793-9_11 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier Ltd Copyright Pergamon Press Inc. Jan 2016 |
| Copyright_xml | – notice: 2015 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Jan 2016 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.cor.2015.06.012 |
| DatabaseName | 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 |
| 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 Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1873-765X 0305-0548 |
| EndPage | 18 |
| ExternalDocumentID | 3847885531 10_1016_j_cor_2015_06_012 S030505481500163X |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD AFXIZ AGCQF AGRNS JQ2 L7M L~C L~D SSH |
| ID | FETCH-LOGICAL-c389t-2d3ceffcca319d00f9691392adc2236f982fd7e834b61ba2f9c6861c8f50123c3 |
| ISICitedReferencesCount | 15 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000364272000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Sat Sep 27 17:05:30 EDT 2025 Mon Jul 14 10:40:57 EDT 2025 Sat Nov 29 03:23:38 EST 2025 Tue Nov 18 21:43:31 EST 2025 Fri Feb 23 02:33:26 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Integer programming Generalized network design Hop-constraints Layered graph Branch-and-cut |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c389t-2d3ceffcca319d00f9691392adc2236f982fd7e834b61ba2f9c6861c8f50123c3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| ORCID | 0000-0002-3313-9610 |
| PQID | 1727424102 |
| PQPubID | 45870 |
| PageCount | 18 |
| ParticipantIDs | proquest_miscellaneous_1816077801 proquest_journals_1727424102 crossref_citationtrail_10_1016_j_cor_2015_06_012 crossref_primary_10_1016_j_cor_2015_06_012 elsevier_sciencedirect_doi_10_1016_j_cor_2015_06_012 |
| PublicationCentury | 2000 |
| PublicationDate | 2016-01-01 |
| PublicationDateYYYYMMDD | 2016-01-01 |
| PublicationDate_xml | – month: 01 year: 2016 text: 2016-01-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2016 |
| Publisher | Elsevier Ltd Pergamon Press Inc |
| Publisher_xml | – name: Elsevier Ltd – name: Pergamon Press Inc |
| References | Gouveia (bib9) 1995; 22 Gouveia, Requejo (bib11) 2001; 132 Gouveia, Leitner, Ljubić (bib15) 2014; 236 Gouveia (bib10) 1996; 95 Mario Ruthmair. On solving constrained tree problems and an adaptive layers framework [Ph.D. thesis]. Vienna University of Technology; 2008. Gouveia, Magnanti, Requejo (bib12) 2006; 146 Botton, Fortz, Goueia, Poss (bib1) 2013; 25 Cherkassky, Goldberg (bib2) 1994; 19 Corinne Feremans. Generalized spanning trees and extensions [Ph.D. thesis]. Universite Libre de Bruxelles, 2001. Gouveia, Paias, Sharma (bib13) 2011; 17 Reinelt (bib28) 1991; 3 Öncan, Cordeau, Laporte (bib25) 2008; 191 Fischetti, José, González, Toth (bib7) 1997; 45 Dahl, Gouveia, Requejo (bib4) 2006 Pop, Kern, Still. (bib27) 2006; 170 Ljubić, Gollowitzer (bib23) 2013; 25 Gouveia, Simonetti, Uchoa (bib14) 2011; 128 Feremans, Labbé, Laporte (bib6) 2004; 43 Woolston, Albin (bib33) 1988; 15 LeBlanc, Chifflet, Mahey (bib22) 1999; 11 Dahl (bib3) 1998; 23 Ruthmair M, Raidl GR A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems. In: Proceedings of the 15th Conference on Integer Programming and Combinatorial Optimization (IPCO XV), vol. 6655 of LNCS; 2011. p. 376–388. Golden, Raghavan, Stanojević (bib8) 2005; 17 Myung, Lee, Tcha (bib24) 1995; 26 John Silberholz, Bruce Golden. The generalized traveling salesman problem: a new genetic algorithm approach. In: Edward K Baker, Anito Joseph, Anuj Mehrotra, Michael A. Trick, editors. Extending the horizons: advances in computing, optimization, and decision technologies. Operations research/computer science interfaces series, vol. 37; 2007. p. 165–81. Gouveia, Leitner, Ljubić (bib16) 2015; 150 Bin Hu. Hybrid Metaheuristics for generalized network design problems [Ph.D. thesis]. Vienna University of Technology, 2008. Voß (bib32) 1999; 86 Hu, Leitner, Raidl (bib18) 2008; 14 Hu, Leitner, Raidl (bib19) 2010; 55 Koch, Martin (bib21) 1998; 32 Petrica C. Pop. The generalized minimum spanning tree problem [Ph.D. thesis]. University of Twente; 2002. Karapetyan, Gutin (bib20) 2011; 208 Gouveia (10.1016/j.cor.2015.06.012_bib13) 2011; 17 10.1016/j.cor.2015.06.012_bib5 Koch (10.1016/j.cor.2015.06.012_bib21) 1998; 32 Voß (10.1016/j.cor.2015.06.012_bib32) 1999; 86 Hu (10.1016/j.cor.2015.06.012_bib18) 2008; 14 Karapetyan (10.1016/j.cor.2015.06.012_bib20) 2011; 208 Gouveia (10.1016/j.cor.2015.06.012_bib15) 2014; 236 Ljubić (10.1016/j.cor.2015.06.012_bib23) 2013; 25 Gouveia (10.1016/j.cor.2015.06.012_bib16) 2015; 150 Pop (10.1016/j.cor.2015.06.012_bib27) 2006; 170 10.1016/j.cor.2015.06.012_bib17 Gouveia (10.1016/j.cor.2015.06.012_bib14) 2011; 128 Gouveia (10.1016/j.cor.2015.06.012_bib11) 2001; 132 10.1016/j.cor.2015.06.012_bib31 10.1016/j.cor.2015.06.012_bib30 Golden (10.1016/j.cor.2015.06.012_bib8) 2005; 17 Botton (10.1016/j.cor.2015.06.012_bib1) 2013; 25 Gouveia (10.1016/j.cor.2015.06.012_bib9) 1995; 22 LeBlanc (10.1016/j.cor.2015.06.012_bib22) 1999; 11 Cherkassky (10.1016/j.cor.2015.06.012_bib2) 1994; 19 Öncan (10.1016/j.cor.2015.06.012_bib25) 2008; 191 Gouveia (10.1016/j.cor.2015.06.012_bib10) 1996; 95 Myung (10.1016/j.cor.2015.06.012_bib24) 1995; 26 Woolston (10.1016/j.cor.2015.06.012_bib33) 1988; 15 10.1016/j.cor.2015.06.012_bib29 10.1016/j.cor.2015.06.012_bib26 Fischetti (10.1016/j.cor.2015.06.012_bib7) 1997; 45 Dahl (10.1016/j.cor.2015.06.012_bib4) 2006 Reinelt (10.1016/j.cor.2015.06.012_bib28) 1991; 3 Feremans (10.1016/j.cor.2015.06.012_bib6) 2004; 43 Hu (10.1016/j.cor.2015.06.012_bib19) 2010; 55 Dahl (10.1016/j.cor.2015.06.012_bib3) 1998; 23 Gouveia (10.1016/j.cor.2015.06.012_bib12) 2006; 146 |
| References_xml | – volume: 128 start-page: 123 year: 2011 end-page: 148 ident: bib14 article-title: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs publication-title: Math Progr – volume: 32 start-page: 207 year: 1998 end-page: 232 ident: bib21 article-title: Solving Steiner tree problems in graphs to optimality publication-title: Networks – volume: 22 start-page: 959 year: 1995 end-page: 970 ident: bib9 article-title: Using the Miller–Tucker–Zemlin constraints to formulate a minimal spanning tree problem with hop constraints publication-title: Comput Oper Res – start-page: 493 year: 2006 end-page: 515 ident: bib4 article-title: On formulations and methods for the hop-constrained minimum spanning tree problem publication-title: Handbook of optimization in telecommunications – reference: Corinne Feremans. Generalized spanning trees and extensions [Ph.D. thesis]. Universite Libre de Bruxelles, 2001. – volume: 15 start-page: 207 year: 1988 end-page: 217 ident: bib33 article-title: The design of centralized networks with reliability and availability constraints publication-title: Comput Oper Res – volume: 208 start-page: 221 year: 2011 end-page: 232 ident: bib20 article-title: Lin–Kernighan heuristic adaptations for the generalized traveling salesman problem publication-title: Eur J Oper Res – reference: Ruthmair M, Raidl GR A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems. In: Proceedings of the 15th Conference on Integer Programming and Combinatorial Optimization (IPCO XV), vol. 6655 of LNCS; 2011. p. 376–388. – volume: 25 start-page: 13 year: 2013 end-page: 26 ident: bib1 article-title: Benders decomposition for the hop-constrained survivable network design problem publication-title: INFORMS J Comput – reference: Mario Ruthmair. On solving constrained tree problems and an adaptive layers framework [Ph.D. thesis]. Vienna University of Technology; 2008. – volume: 14 start-page: 473 year: 2008 end-page: 499 ident: bib18 article-title: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem publication-title: J Heuristics – volume: 43 start-page: 71 year: 2004 end-page: 86 ident: bib6 article-title: The generalized minimum spanning tree problem publication-title: Networks – volume: 95 start-page: 178 year: 1996 end-page: 190 ident: bib10 article-title: Multicommodity flow models for spanning trees with hop constraints publication-title: Eur J Oper Res – volume: 17 start-page: 290 year: 2005 end-page: 304 ident: bib8 article-title: Heuristic search for the generalized minimum spanning tree problem publication-title: INFORMS J Comput – volume: 11 start-page: 188 year: 1999 end-page: 197 ident: bib22 article-title: Packet routing in telecommunication networks with path and flow restrictions publication-title: INFORMS J Comput – volume: 170 start-page: 900 year: 2006 end-page: 908 ident: bib27 article-title: A new relaxation method for the generalized minimum spanning tree problem publication-title: Eur J Oper Res – volume: 150 start-page: 49 year: 2015 end-page: 78 ident: bib16 article-title: The two-level diameter constrained spanning tree problem publication-title: Math Progr – volume: 19 start-page: 390 year: 1994 end-page: 410 ident: bib2 article-title: On implementing push-relabel method for the maximum flow problem publication-title: Algorithmica – reference: Bin Hu. Hybrid Metaheuristics for generalized network design problems [Ph.D. thesis]. Vienna University of Technology, 2008. – volume: 132 start-page: 539 year: 2001 end-page: 552 ident: bib11 article-title: A new Lagrangian relaxation approach for the hop-constrained minimum spanning tree problem publication-title: Eur J Oper Res – volume: 17 start-page: 23 year: 2011 end-page: 37 ident: bib13 article-title: Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem publication-title: J Heuristics – volume: 26 start-page: 231 year: 1995 end-page: 241 ident: bib24 article-title: On the generalized minimum spanning tree problem publication-title: Networks – volume: 45 start-page: 378 year: 1997 end-page: 394 ident: bib7 article-title: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem publication-title: Oper Res – volume: 55 start-page: 257 year: 2010 end-page: 275 ident: bib19 article-title: The generalized minimum edge biconnected network problem publication-title: Networks – volume: 86 start-page: 271 year: 1999 end-page: 294 ident: bib32 article-title: The Steiner tree problem with hop constraints publication-title: Ann Oper Res – volume: 3 start-page: 376 year: 1991 end-page: 384 ident: bib28 article-title: TSPLIB—a traveling salesman problem library publication-title: INFORMS J Comput – volume: 191 start-page: 306 year: 2008 end-page: 319 ident: bib25 article-title: A tabu search heuristic for the generalized minimum spanning tree problem publication-title: Eur J Oper Res – volume: 236 start-page: 100 year: 2014 end-page: 112 ident: bib15 article-title: Hop constrained Steiner trees with multiple root nodes publication-title: Eur J Oper Res – volume: 25 start-page: 256 year: 2013 end-page: 270 ident: bib23 article-title: Layered graph approaches to the hop constrained connected facility location problem publication-title: INFORMS J Comput – volume: 23 start-page: 21 year: 1998 end-page: 26 ident: bib3 article-title: The 2-hop spanning tree problem publication-title: Oper Res Lett – reference: Petrica C. Pop. The generalized minimum spanning tree problem [Ph.D. thesis]. University of Twente; 2002. – volume: 146 start-page: 19 year: 2006 end-page: 39 ident: bib12 article-title: An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees publication-title: Ann Oper Res – reference: John Silberholz, Bruce Golden. The generalized traveling salesman problem: a new genetic algorithm approach. In: Edward K Baker, Anito Joseph, Anuj Mehrotra, Michael A. Trick, editors. Extending the horizons: advances in computing, optimization, and decision technologies. Operations research/computer science interfaces series, vol. 37; 2007. p. 165–81. – volume: 132 start-page: 539 issue: 3 year: 2001 ident: 10.1016/j.cor.2015.06.012_bib11 article-title: A new Lagrangian relaxation approach for the hop-constrained minimum spanning tree problem publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(00)00143-0 – volume: 86 start-page: 271 year: 1999 ident: 10.1016/j.cor.2015.06.012_bib32 article-title: The Steiner tree problem with hop constraints publication-title: Ann Oper Res doi: 10.1023/A:1018967121276 – volume: 95 start-page: 178 year: 1996 ident: 10.1016/j.cor.2015.06.012_bib10 article-title: Multicommodity flow models for spanning trees with hop constraints publication-title: Eur J Oper Res doi: 10.1016/0377-2217(95)00090-9 – volume: 150 start-page: 49 issue: 1 year: 2015 ident: 10.1016/j.cor.2015.06.012_bib16 article-title: The two-level diameter constrained spanning tree problem publication-title: Math Progr doi: 10.1007/s10107-013-0743-z – ident: 10.1016/j.cor.2015.06.012_bib26 – volume: 19 start-page: 390 year: 1994 ident: 10.1016/j.cor.2015.06.012_bib2 article-title: On implementing push-relabel method for the maximum flow problem publication-title: Algorithmica doi: 10.1007/PL00009180 – volume: 23 start-page: 21 issue: 1–2 year: 1998 ident: 10.1016/j.cor.2015.06.012_bib3 article-title: The 2-hop spanning tree problem publication-title: Oper Res Lett doi: 10.1016/S0167-6377(98)00029-7 – volume: 26 start-page: 231 issue: 4 year: 1995 ident: 10.1016/j.cor.2015.06.012_bib24 article-title: On the generalized minimum spanning tree problem publication-title: Networks doi: 10.1002/net.3230260407 – volume: 15 start-page: 207 year: 1988 ident: 10.1016/j.cor.2015.06.012_bib33 article-title: The design of centralized networks with reliability and availability constraints publication-title: Comput Oper Res doi: 10.1016/0305-0548(88)90033-0 – volume: 45 start-page: 378 issue: 3 year: 1997 ident: 10.1016/j.cor.2015.06.012_bib7 article-title: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem publication-title: Oper Res doi: 10.1287/opre.45.3.378 – volume: 3 start-page: 376 issue: 4 year: 1991 ident: 10.1016/j.cor.2015.06.012_bib28 article-title: TSPLIB—a traveling salesman problem library publication-title: INFORMS J Comput doi: 10.1287/ijoc.3.4.376 – volume: 191 start-page: 306 issue: 2 year: 2008 ident: 10.1016/j.cor.2015.06.012_bib25 article-title: A tabu search heuristic for the generalized minimum spanning tree problem publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2007.08.021 – volume: 170 start-page: 900 issue: 3 year: 2006 ident: 10.1016/j.cor.2015.06.012_bib27 article-title: A new relaxation method for the generalized minimum spanning tree problem publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2004.07.058 – volume: 128 start-page: 123 year: 2011 ident: 10.1016/j.cor.2015.06.012_bib14 article-title: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs publication-title: Math Progr doi: 10.1007/s10107-009-0297-2 – volume: 146 start-page: 19 issue: 1 year: 2006 ident: 10.1016/j.cor.2015.06.012_bib12 article-title: An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees publication-title: Ann Oper Res doi: 10.1007/s10479-006-0049-0 – volume: 17 start-page: 290 issue: 3 year: 2005 ident: 10.1016/j.cor.2015.06.012_bib8 article-title: Heuristic search for the generalized minimum spanning tree problem publication-title: INFORMS J Comput doi: 10.1287/ijoc.1040.0077 – ident: 10.1016/j.cor.2015.06.012_bib30 doi: 10.1007/978-3-642-20807-2_30 – volume: 22 start-page: 959 year: 1995 ident: 10.1016/j.cor.2015.06.012_bib9 article-title: Using the Miller–Tucker–Zemlin constraints to formulate a minimal spanning tree problem with hop constraints publication-title: Comput Oper Res doi: 10.1016/0305-0548(94)00074-I – ident: 10.1016/j.cor.2015.06.012_bib17 – volume: 43 start-page: 71 issue: 2 year: 2004 ident: 10.1016/j.cor.2015.06.012_bib6 article-title: The generalized minimum spanning tree problem publication-title: Networks doi: 10.1002/net.10105 – ident: 10.1016/j.cor.2015.06.012_bib29 – volume: 208 start-page: 221 issue: 3 year: 2011 ident: 10.1016/j.cor.2015.06.012_bib20 article-title: Lin–Kernighan heuristic adaptations for the generalized traveling salesman problem publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2010.08.011 – volume: 25 start-page: 13 issue: 1 year: 2013 ident: 10.1016/j.cor.2015.06.012_bib1 article-title: Benders decomposition for the hop-constrained survivable network design problem publication-title: INFORMS J Comput doi: 10.1287/ijoc.1110.0472 – ident: 10.1016/j.cor.2015.06.012_bib5 doi: 10.1016/S0377-2217(00)00267-8 – volume: 32 start-page: 207 issue: 3 year: 1998 ident: 10.1016/j.cor.2015.06.012_bib21 article-title: Solving Steiner tree problems in graphs to optimality publication-title: Networks doi: 10.1002/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O – volume: 11 start-page: 188 issue: 2 year: 1999 ident: 10.1016/j.cor.2015.06.012_bib22 article-title: Packet routing in telecommunication networks with path and flow restrictions publication-title: INFORMS J Comput doi: 10.1287/ijoc.11.2.188 – start-page: 493 year: 2006 ident: 10.1016/j.cor.2015.06.012_bib4 article-title: On formulations and methods for the hop-constrained minimum spanning tree problem – volume: 236 start-page: 100 year: 2014 ident: 10.1016/j.cor.2015.06.012_bib15 article-title: Hop constrained Steiner trees with multiple root nodes publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2013.11.029 – volume: 14 start-page: 473 issue: 5 year: 2008 ident: 10.1016/j.cor.2015.06.012_bib18 article-title: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem publication-title: J Heuristics doi: 10.1007/s10732-007-9047-x – volume: 25 start-page: 256 year: 2013 ident: 10.1016/j.cor.2015.06.012_bib23 article-title: Layered graph approaches to the hop constrained connected facility location problem publication-title: INFORMS J Comput doi: 10.1287/ijoc.1120.0500 – volume: 17 start-page: 23 issue: 1 year: 2011 ident: 10.1016/j.cor.2015.06.012_bib13 article-title: Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem publication-title: J Heuristics doi: 10.1007/s10732-009-9123-5 – volume: 55 start-page: 257 issue: 3 year: 2010 ident: 10.1016/j.cor.2015.06.012_bib19 article-title: The generalized minimum edge biconnected network problem publication-title: Networks doi: 10.1002/net.20370 – ident: 10.1016/j.cor.2015.06.012_bib31 doi: 10.1007/978-0-387-48793-9_11 |
| SSID | ssj0000721 |
| Score | 2.2350209 |
| Snippet | This paper studies the generalized hop-constrained minimum spanning tree problem (GHMSTP) which has applications in backbone network design subject to... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1 |
| SubjectTerms | Algorithms Branch-and-cut Computer simulation Generalized network design Graph algorithms Graph theory Graphs Hop-constraints Inequalities Integer programming Layered graph Linear programming Mathematical models Operations research Quality of service Routers Studies |
| Title | Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem |
| URI | https://dx.doi.org/10.1016/j.cor.2015.06.012 https://www.proquest.com/docview/1727424102 https://www.proquest.com/docview/1816077801 |
| Volume | 65 |
| WOSCitedRecordID | wos000364272000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9wwEBYlKaU99LFtadKkqNBTg8EPWbaPoaQ0ZQk9pLA3I8tSsnnYy663bPvrM6OH19mS0Bx6Mbt-COH5NPokz3xDyCfGuciZTIKwqnXAqlAEIk3qQKVJwWQWiqIyOrPj7OQkn0yKH65c6sKUE8iaJl-titl_NTWcA2Nj6uwDzN03CifgNxgdjmB2OP6T4cfiN9bfPDBS1LbSjdVhVivMhxRXZ-182p1bIQbDO8-s9PT0Dzx13s4CiZwRS0fAf5QeuV5eH4DjMcWNMDIdc6tMGZohs_XlIRYGTO1MzV2QnZMT6redx2rauSwbTBS6vfEQDTceXMIVxv2lVijTO1OeDrxhNJhWrZf9y2HbvYMLeN8ozhqlRkzVBVbfEsfemLT6UEIfpXZRQhMlNlFipB4Wnt6Os7QAZ719eHw0-b6enzOTjdd333_rNlF_G_24i61szNuGjJy-JM_dKoIeWuu_Io9UMyJPfBLDiLzw1qDOd4_Is4Hy5Gty6VBCDUqoRQkFlFCDErpGCQWUUEAJHaCEbqCEOpRQjxKKKKEOJW_Iz69Hp1--Ba7uRiCBvnZBXCdSaQ1jG_xzHYa64CgeG4taApnkushjXWcqT1jFo0rEupA855HMdYoMXSZvyVbTNuodoVzIJFa5qAumWaZ0pWC5yyKhBSyTwyrdIaF_v6V0ovTY9avyTrvukM_9IzOryHLfzcwbrXSU0lLFEgB432N73sClG9qLEqk-A8IbwuWP_WXwxviJTTSqXcI9OQo2ZkD7dh_Szffk6XqE7ZGtbr5U--Sx_NVNF_MPDsA3F1exWg |
| 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=Layered+graph+models+and+exact+algorithms+for+the+generalized+hop-constrained+minimum+spanning+tree+problem&rft.jtitle=Computers+%26+operations+research&rft.au=Leitner%2C+Markus&rft.date=2016-01-01&rft.issn=0305-0548&rft.volume=65&rft.spage=1&rft.epage=18&rft_id=info:doi/10.1016%2Fj.cor.2015.06.012&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cor_2015_06_012 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |