Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem
The Constrained-Routing and Spectrum Assignment (C-RSA) problem arises in the design of 5 G telecommunication optical networks. Given an undirected, loopless, and connected graph G , an optical spectrum of available contiguous frequency slots S , and a set of traffic demands K , the C-RSA consists o...
Saved in:
| Published in | Journal of combinatorial optimization Vol. 47; no. 4; p. 56 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Springer US
01.05.2024
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1382-6905 1573-2886 |
| DOI | 10.1007/s10878-024-01125-x |
Cover
| Abstract | The Constrained-Routing and Spectrum Assignment (C-RSA) problem arises in the design of 5
G
telecommunication optical networks. Given an undirected, loopless, and connected graph
G
, an optical spectrum of available contiguous frequency slots
S
, and a set of traffic demands
K
, the C-RSA consists of assigning, to each traffic demand
k
∈
K
, a path in
G
between its origin and destination, and a subset of contiguous frequency slots in
S
subject to certain technological constraints while optimizing some linear objective function. In this paper, we devise an exact algorithm to solve the C-RSA. We first introduce an extended integer programming formulation for the problem. Then we investigate the associated polytope and introduce several classes of valid inequalities. Based on these results, we devise a Branch-and-Cut-and-Price algorithm for the problem and present an extensive computational study. This is also be compared with a Branch-and-Cut algorithm of the state-of-the-art. |
|---|---|
| AbstractList | The Constrained-Routing and Spectrum Assignment (C-RSA) problem arises in the design of 5G telecommunication optical networks. Given an undirected, loopless, and connected graph G, an optical spectrum of available contiguous frequency slots S, and a set of traffic demands K, the C-RSA consists of assigning, to each traffic demand k∈K, a path in G between its origin and destination, and a subset of contiguous frequency slots in S subject to certain technological constraints while optimizing some linear objective function. In this paper, we devise an exact algorithm to solve the C-RSA. We first introduce an extended integer programming formulation for the problem. Then we investigate the associated polytope and introduce several classes of valid inequalities. Based on these results, we devise a Branch-and-Cut-and-Price algorithm for the problem and present an extensive computational study. This is also be compared with a Branch-and-Cut algorithm of the state-of-the-art. The Constrained-Routing and Spectrum Assignment (C-RSA) problem arises in the design of 5 G telecommunication optical networks. Given an undirected, loopless, and connected graph G , an optical spectrum of available contiguous frequency slots S , and a set of traffic demands K , the C-RSA consists of assigning, to each traffic demand k ∈ K , a path in G between its origin and destination, and a subset of contiguous frequency slots in S subject to certain technological constraints while optimizing some linear objective function. In this paper, we devise an exact algorithm to solve the C-RSA. We first introduce an extended integer programming formulation for the problem. Then we investigate the associated polytope and introduce several classes of valid inequalities. Based on these results, we devise a Branch-and-Cut-and-Price algorithm for the problem and present an extensive computational study. This is also be compared with a Branch-and-Cut algorithm of the state-of-the-art. |
| ArticleNumber | 56 |
| Author | Diarrassouba, Ibrahima Hadhbi, Youssouf Mahjoub, A. Ridha |
| Author_xml | – sequence: 1 givenname: Ibrahima surname: Diarrassouba fullname: Diarrassouba, Ibrahima organization: LMAH, FR CNRS 3335, Le Havre Normandie University – sequence: 2 givenname: Youssouf orcidid: 0000-0001-8032-087X surname: Hadhbi fullname: Hadhbi, Youssouf email: youssouf.hadhbi@uca.fr organization: LIMOS, UMR CNRS 6158, Clermont Auvergne INP – sequence: 3 givenname: A. Ridha surname: Mahjoub fullname: Mahjoub, A. Ridha organization: Departement of Statistics and Operations Research, Kuwait University, LAMSADE, UMR CNRS 7243, Paris-Dauphine PSL University |
| BookMark | eNp9ULtOwzAUtVCRaAs_wGSJ2XBtx7EzQsVLqsQCK5bjOGmqxim2I5W_x1AkNqZzhvO49yzQzI_eIXRJ4ZoCyJtIQUlFgBUEKGWCHE7QnArJCVOqnGXOFSNlBeIMLWLcAkDmxRy93wXj7YYY3xA7pR_ch946bHbdGPq0GXA7Bpw2DtvRxxRM711Dwjil3nc463HcO5vCNGATY9_5wfmE92Gsd244R6et2UV38YtL9PZw_7p6IuuXx-fV7ZpYJiGRhkqqeMmgarkoCyNaWVFBW8XylbaoWCFZ7aDlHBoKtGDUGAm1aBSTvHE1X6KrY27u_ZhcTHo7TsHnSs2ZKMqqErTKKnZU2TDGGFyr86uDCZ-agv7eUR931HlH_bOjPmQTP5piFvvOhb_of1xfbqt35g |
| Cites_doi | 10.1007/s11107-020-00918-4 10.1109/SBFoton-IOPC.2018.8610937 10.1002/9781118627372 10.1287/opre.42.5.977 10.1109/COMSNETS.2019.8711172 10.1109/ICOCN.2017.8121494 10.1007/s11107-012-0378-7 10.1007/s11750-018-0483-6 10.1111/j.1475-3995.2011.00805.x 10.1007/BF01386390 10.1007/s11107-013-0408-0 10.1007/978-3-642-97881-4 10.1007/BF01580121 10.1007/978-1-4684-2001-2_9 10.1109/NICS48868.2019.9023831 10.1109/LCOMM.2012.070512.120740 10.1016/j.yofte.2020.102355 10.1287/opre.31.5.803 10.3390/s20154190 10.1049/iet-opt.2017.0013 10.15439/2019F188 10.1016/j.jnca.2020.102576 10.1016/S0167-6377(98)00025-X 10.1007/978-3-031-18530-4_3 10.1007/978-3-319-24834-9_35 10.1007/978-3-642-19486-3_4 10.1109/TNET.2010.2044585 10.1109/INFCOM.2013.6566800 10.1109/ICTON.2014.6876290 10.1016/j.ejor.2006.01.003 10.1016/j.comnet.2014.12.004 10.1109/INFOCOM.2019.8737413 10.1109/JLT.2013.2282696 10.1109/ICTON.2015.7193482 10.1016/j.osn.2014.02.003 10.1117/1.OE.53.4.046105 10.1111/1475-3995.00003 10.1109/LCOMM.2011.060811.110281 10.1016/j.osn.2010.01.001 10.1007/978-3-319-30174-7 10.1109/35.186364 10.1145/12130.12144 10.1109/ICTON.2013.6602691 10.1364/OFC.2018.W4F.2 10.1109/26.153361 10.1109/ICTON.2016.7550385 10.1057/palgrave.jors.0430507 10.1109/JLT.2011.2125777 10.1109/SIGTELCOM.2017.7849820 10.1016/S0140-3664(01)00339-5 |
| ContentType | Journal Article |
| Copyright | The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024. |
| Copyright_xml | – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024. |
| DBID | AAYXX CITATION 7XB 8FE 8FG ABJCF AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ L6V M2P M7S P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U |
| DOI | 10.1007/s10878-024-01125-x |
| DatabaseName | CrossRef ProQuest Central (purchase pre-March 2016) ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central ProQuest Technology Collection ProQuest One Community College ProQuest Central ProQuest Central Student SciTech Premium Collection ProQuest Engineering Collection Science Database Engineering Database (Proquest) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic |
| DatabaseTitle | CrossRef ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Engineering Database ProQuest Central Basic ProQuest Science Journals ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition Materials Science & Engineering Collection ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | ProQuest Central Student |
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics |
| EISSN | 1573-2886 |
| ExternalDocumentID | 10_1007_s10878_024_01125_x |
| GrantInformation_xml | – fundername: Agence Nationale de la Recherche grantid: ANR-17-CE25- 0006 funderid: http://dx.doi.org/10.13039/501100001665 |
| GroupedDBID | -5D -5G -BR -EM -Y2 -~C .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 203 29K 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BAPOH BDATZ BGNMA BSONS CAG COF CS3 CSCUP D-I DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ KDC KOV LAK LLZTM M4Y MA- N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9J OAM OVD P2P P9R PF0 PT4 PT5 QOS R89 R9I RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S27 S3B SAP SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TEORI TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7X Z83 Z88 ZMTXR AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION 7XB 8FE 8FG ABJCF AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ L6V M2P M7S P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U |
| ID | FETCH-LOGICAL-c270t-d171836209f3564a5f79151f82905c492472be0f330d101421aa70b5d8273deb3 |
| IEDL.DBID | BENPR |
| ISSN | 1382-6905 |
| IngestDate | Sat Sep 27 04:20:53 EDT 2025 Wed Oct 01 03:52:54 EDT 2025 Fri Feb 21 02:40:23 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | Network design Valid inequalities Branch-and-Cut-and-Price 5 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c270t-d171836209f3564a5f79151f82905c492472be0f330d101421aa70b5d8273deb3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-8032-087X |
| PQID | 3254699519 |
| PQPubID | 2043856 |
| ParticipantIDs | proquest_journals_3254699519 crossref_primary_10_1007_s10878_024_01125_x springer_journals_10_1007_s10878_024_01125_x |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 20240500 2024-05-00 20240501 |
| PublicationDateYYYYMMDD | 2024-05-01 |
| PublicationDate_xml | – month: 5 year: 2024 text: 20240500 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York – name: Dordrecht |
| PublicationTitle | Journal of combinatorial optimization |
| PublicationTitleAbbrev | J Comb Optim |
| PublicationYear | 2024 |
| Publisher | Springer US Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer Nature B.V |
| References | Jiang R, Feng M, Shen J (2017) An defragmentation scheme for extending the maximal unoccupied spectrum block in elastic optical networks. In: 16th international conference on optical communications and networks (ICOCN), pp 1–3 NemhauserGLWolseyLAInteger and combinatorial optimization1988HobokenWiley10.1002/9781118627372 Talebi S, Alam F , Katib I, Khamis M, Salama R, Rouskas GN (2014) Spectrum management techniques for elastic optical networks: a survey. In: Optical switching and networking, pp 34–48 Gurobi Optimization LLC (2021) Gurobi optimizer reference manual. https://www.gurobi.com Chouman H, Gravey A, Gravey P, Hadhbi Y, Kerivin H, Morvan M, Wagler A (2021) Impact of RSA optimization objectives on optical network state, pp 1–7. https://hal.uca.fr/hal-03155966 Christodoulopoulos K, Manousakis K, Varvarigos E (2010) Offline routing and wavelength assignment in transparent wdm networks. In: Networking, IEEE/ACM transactions, pp 1557–1570 Ding Z, Xu Z, Zeng X, Ma T, Yang F (2014) Hybrid routing and spectrum assignment algorithms based on distance-adaptation combined coevolution and heuristics in elastic optical networks. J Opt Eng 1–10 Salani M, Rottondi C, Tornatore M (2019) Routing and spectrum assignment integrating machine-learning-based QoT estimation in elastic optical networks. In: IEEE INFOCOM - IEEE Conference on Computer Communications, p 173846 Jaumard B, Daryalal M (2016) Scalable elastic optical path networking models. In: 18th international conference transparent optical networks (ICTON), pp 1–4 Cai A, Shen G, Peng L, Zukerman M (2013) Novel node-arc model and multiiteration heuristics for static routing and spectrum assignment in elastic optical networks. J Lightw Technol 3402–3413 Klinkowski M, Pioro M, Zotkiewicz M, Ruiz M, Velasco L (2014) Valid inequalities for the routing and spectrum allocation problem in elastic optical networks. In: 16th international conference on transparent optical networks (ICTON), pp 1–5 Ruiz M, Pioro M, Zotkiewicz M, Klinkowski M, Velasco L (2020) A hybrid meta-heuristic approach for optimization of routing and spectrum assignment in Elastic Optical Network (EON). J Enterprise Inform Syst 11–24 Nguyen DM, Ngoc LA, Huong PTV, Son NH, Hai DT (2019) An efficient column generation approach for solving the routing and spectrum assignment problem in elastic optical networks. In: the 6th NAFOSTED conference on information and computer science (NICS), Hanoi, Vietnam, pp 130–135 Chlamtac I, Ganz A, Karmi G (1992) Lightpath communications: an approach to high bandwidth optical WAN’s. IEEE Trans Commun 1171–1182 Dror M (1994) Note on the complexity of the shortest path models for column generation in VRPTW. J Oper Res 977–978 LezamaFMartinez-HerreraAFCastanonGDel-Valle-SotoCSarmientoAMMunoz de CoteASolving routing and spectrum allocation problems in flexgrid optical networks using pre-computing strategiesJ Photon Netw Commun202141173510.1007/s11107-020-00918-4 Chouman H, Luay A, Colares R, Gravey A Gravey P, Kerivin H, Morvan M, Wagler A (2021) Assessing the health of flexgrid optical networks, pp 1–7. https://hal.archives-ouvertes.fr/hal-03123302 Shiva-Kumar M, Sreenivasa-Kumar P (2002) Static lightpath establishment in wdm networksnew ilp formulations and heuristic algorithms. Comput Commun 109–114 Cplex II (2020) V12. 9: User’s manual for CPLEX. Int Bus Mach Corp 46(53):157 HaiDTMorvanMGraveyPCombining heuristic and exact approaches for solving the routing and spectrum assignment problemIET Optoelectron201712657210.1049/iet-opt.2017.0013 Colares R, Kerivin H, Wagler A (2021) An extended formulation for the Constraint Routing and Spectrum Assignment Problem in Elastic Optical Networks, pp 1–16. https://hal.uca.fr/hal-03156189 Skorin-Kapov N (2007) Routing and wavelength assignment in optical networks using bin packing based algorithms. Eur J Oper Res 1167–1179 Pedro H, Fernandes da Silva, Kerivin H, Nant JP, Wagler A (2022) A framework for routing and spectrum assignment in optical networks, driven by combinatorial properties. In: The international network optimization conference (INOC), pp 1–6 Ruiz M, Pioro M, Zotkiewicz M, Klinkowski M, Velasco L (2013) Column generation algorithm for RSA problems in flexgrid optical networks. Photon Netw Commun 53–64 Zotkiewicz M, Pioro M, Ruiz M, Klinkowski M, Velasco L (2013) Optimization models for flexgrid elastic optical networks. In: 15th international conference on transparent optical networks (ICTON), pp 1–4 Ramaswami R, Sivarajan K, Sasaki G (1993) Multiwavelength lightwave networks for computer communication. In: IEEE communications magazine, pp 78–88 Christodoulopoulos K, Tomkos I, Varvarigos EA (2011) Elastic bandwidth allocation in flexible OFDM-based optical networks. In: Lightwave technology, pp 1354–1366 Orlowski S, Pióro M, Tomaszewski A, Wessäly R (2007) SNDlib 1.0-survivable network design library. In: Proceedings of the 3rd international network optimization conference (INOC 2007), Spa, Belgium Chen X, Guo J, Zhu Z, Proietti R, Castro A, Yoo SJB (2018) Deep-RMSA: a deep-reinforcement-learning routing, modulation and spectrum assignment agent for elastic optical networks. In: Optical fiber communications conference and exposition (OFC), pp 1–3 Mesquita LAJ, Assis K, Santos AF, Alencar M, Almeida RC (2018) A routing and spectrum assignment heuristic for elastic optical networks under incremental traffic. In: SBFoton international optics and photonics conference (SBFoton IOPC), pp 1–5 Gamrath G, Anderson D, Bestuzheva K, Chen WK, Eifler L, Gasse M, Gemander P, Gleixner A, Gottwald L, Halbig K, Hendel G, Hojny C, Koch T, Bodic L, Maher PJ, Matter F, Miltenberger M, Mühmer E, Müller B, Pfetsch ME, Schlösser F, Serrano F, Shinano Y, Tawfik C, Vigerske S, Wegscheider F, Weninger D, Witzig J (March 2020) The SCIP Optimization Suite 7.0. http://www.optimization-online.org/DB_HTML/2020/03/7705.html Klinkowski M, Pedro J, Careglio D, Pioro M, Pires J, Monteiro P, Sole-Pareta J (2010) An overview of routing methods in optical burst switching networks. Opt Switch Network 41–53 Gu R, Yang Z, Ji Y (2020) Machine learning for intelligent optical networks: a comprehensive survey. J CoRR 1–42 CrowderHJohnsonELPadbergMWSolving large scale zero-one linear programming problemsOper Res19833180383410.1287/opre.31.5.803 Gong L, Zhou X, Lu W, Zhu Z (2012) A two-population based evolutionary approach for optimizing routing, modulation and spectrum assignments (RMSA) in O-OFDM networks. IEEE Commun Lett 1520–1523 Hai DH, Hoang KM (2017) An efficient genetic algorithm approach for solving routing and spectrum assignment problem. J Recent Adv Signal Process 187–192 Zhang Y, Xin J, Li X, Huang S (2020) Overview on routing and resource allocation based machine learning in optical networks. J Opt Fiber Technol 1–21 PadbergMWOn the facial structure of set packing polyhedraMath Program1973519921536874910.1007/BF01580121 Hadhbi Y, Kerivin H, Wagler A (2019) A novel integer linear programming model for routing and spectrum assignment in optical networks. In: Federated conference on computer science and information systems (FedCSIS) , pp 127–134 Klinkowski M, Pióro M, Żotkiewicz M, Walkowiak K, Ruiz M, Velasco L (2015) Spectrum allocation problem in elastic optical networks - A branch-and-price approach. In: 17th international conference on transparent optical networks (ICTON), pp 1–5 He S, Qiu Y, Xu J (2020) Invalid-resource-aware spectrum assignment for advanced-reservation traffic in elastic optical network. In: Sensors Karp RM (1972) Reducibility among combinatorial problems. In: Complexity of computer computations: proceedings of a symposium on the complexity of computer computations, held March 20–22, 1972, at the IBM Thomas J. Watson Research Center, pp 85–94 Lopez V, Velasco L (2016) Elastic optical networks: architectures, technologies, and control. Springer Publishing Company, Incorporated Hai DH, Morvan M, Gravey P (2017) Combining heuristic and exact approaches for solving the routing and spectrum assignment problem. J Iet Optoelectron 65–72 Grötschel M, Lovász L, Schrijver A (1988) Stable sets in graphs. In: Geometric algorithms and combinatorial optimization. algorithms and combinatorics, vol 2. Springer, Berlin, Heidelberg Klinkowski M, Pioro M, Zotkiewicz M, Ruiz M, Velasco L (2015) A simulated annealing heuristic for a branch and price-based routing and spectrum allocation algorithm in elastic optical networks. In: Intelligent data engineering and automated learning – IDEAL, Springer International Publishing, pp 290–299 Liu Z, Rouskas GN (2013) Link selection algorithms for link-based ilps and applications to rwa in mesh networks. In: Optical network design and modeling (ONDM), 17th international conference. IEEE, pp 59–64 Liu L, Yin S, Zhang Z, Chu Y, Huang S (2019) A Monte Carlo based routing and spectrum assignment agent for elastic optical networks. In: Asia communications and photonics conference (ACP), pp 1–3 Velasco L, Klinkowski M, Ruiz M, Comellas J (2012) Modeling the routing and spectrum allocation problem for flexgrid optical networks. Photon Network Commun 177–186 Zang H, Jue JP, Mukherjee B et al (2000) A review of routing and wavelength assignment approaches for wavelength-routed optical wdm networks. In: Optical networks magazine, pp 47–60 Dumitrescu I, Boland N (2001) Algorithms for the weight constrained shortest path problem. Int Trans Oper Res 15–29 AmarDPerformance assessment and modeling of flexible optical networks2016Institut National des TélécommunicationsThesis Rebennack S, Reinelt G, Pardalos PM (2012) A tutorial on branch and cut algorithms for the maximum stable set problem. J Int Trans Oper Res 161–199 Lohani V, Sharma A, Singh YN (2019) Routing, modulation and spectrum assignment using an AI based algorithm. In: 11th international conference on communication systems & networks (COMSNETS), pp 266–271 Bertero F, Bianchetti M, Marenco J (2018) Integer programming models for the routing and spectrum allocation problem. In: Official Journal of the Spanish Socie 1125_CR39 1125_CR38 EW Dijkstra (1125_CR15) 1959; 1 R Ramaswami (1125_CR53) 2009 GL Nemhauser (1125_CR48) 1988 DT Hai (1125_CR30) 2017; 12 1125_CR35 1125_CR34 1125_CR37 1125_CR36 1125_CR31 H Crowder (1125_CR13) 1983; 31 1125_CR33 1125_CR32 1125_CR28 1125_CR27 1125_CR29 1125_CR60 1125_CR62 1125_CR61 1125_CR24 1125_CR68 1125_CR23 1125_CR67 1125_CR26 1125_CR25 MW Padberg (1125_CR51) 1973; 5 1125_CR20 1125_CR64 1125_CR63 1125_CR22 1125_CR66 1125_CR21 1125_CR65 1125_CR17 1125_CR16 1125_CR19 1125_CR18 F Lezama (1125_CR41) 2021; 41 1125_CR2 1125_CR50 D Amar (1125_CR1) 2016 1125_CR7 1125_CR57 1125_CR8 1125_CR12 1125_CR56 1125_CR9 1125_CR59 1125_CR14 1125_CR58 1125_CR3 1125_CR4 1125_CR52 1125_CR5 1125_CR11 1125_CR55 1125_CR6 1125_CR10 1125_CR54 1125_CR49 1125_CR40 1125_CR46 1125_CR45 1125_CR47 1125_CR42 1125_CR44 1125_CR43 |
| References_xml | – reference: Chouman H, Gravey A, Gravey P, Hadhbi Y, Kerivin H, Morvan M, Wagler A (2021) Impact of RSA optimization objectives on optical network state, pp 1–7. https://hal.uca.fr/hal-03155966 – reference: Gu R, Yang Z, Ji Y (2020) Machine learning for intelligent optical networks: a comprehensive survey. J CoRR 1–42 – reference: He S, Qiu Y, Xu J (2020) Invalid-resource-aware spectrum assignment for advanced-reservation traffic in elastic optical network. In: Sensors – reference: Klinkowski M, Pióro M, Żotkiewicz M, Walkowiak K, Ruiz M, Velasco L (2015) Spectrum allocation problem in elastic optical networks - A branch-and-price approach. In: 17th international conference on transparent optical networks (ICTON), pp 1–5 – reference: Nguyen DM, Ngoc LA, Huong PTV, Son NH, Hai DT (2019) An efficient column generation approach for solving the routing and spectrum assignment problem in elastic optical networks. In: the 6th NAFOSTED conference on information and computer science (NICS), Hanoi, Vietnam, pp 130–135 – reference: Ramaswami R, Sivarajan K, Sasaki G (1993) Multiwavelength lightwave networks for computer communication. In: IEEE communications magazine, pp 78–88 – reference: Cai A, Shen G, Peng L, Zukerman M (2013) Novel node-arc model and multiiteration heuristics for static routing and spectrum assignment in elastic optical networks. J Lightw Technol 3402–3413 – reference: Skorin-Kapov N (2007) Routing and wavelength assignment in optical networks using bin packing based algorithms. Eur J Oper Res 1167–1179 – reference: HaiDTMorvanMGraveyPCombining heuristic and exact approaches for solving the routing and spectrum assignment problemIET Optoelectron201712657210.1049/iet-opt.2017.0013 – reference: Jiang R, Feng M, Shen J (2017) An defragmentation scheme for extending the maximal unoccupied spectrum block in elastic optical networks. In: 16th international conference on optical communications and networks (ICOCN), pp 1–3 – reference: Gamrath G, Anderson D, Bestuzheva K, Chen WK, Eifler L, Gasse M, Gemander P, Gleixner A, Gottwald L, Halbig K, Hendel G, Hojny C, Koch T, Bodic L, Maher PJ, Matter F, Miltenberger M, Mühmer E, Müller B, Pfetsch ME, Schlösser F, Serrano F, Shinano Y, Tawfik C, Vigerske S, Wegscheider F, Weninger D, Witzig J (March 2020) The SCIP Optimization Suite 7.0. http://www.optimization-online.org/DB_HTML/2020/03/7705.html – reference: Grötschel M, Lovász L, Schrijver A (1988) Stable sets in graphs. In: Geometric algorithms and combinatorial optimization. algorithms and combinatorics, vol 2. Springer, Berlin, Heidelberg – reference: Siregar H, Takagi H, Zhang Y (2003) Efficient routing and wavelength assignment in wavelength-routed optical networks. In: Proceedings of 7th Asia-Pacific Network Operations and Mgmt Symposium, pp 116–127 – reference: Christodoulopoulos K, Tomkos I, Varvarigos EA (2011) Elastic bandwidth allocation in flexible OFDM-based optical networks. In: Lightwave technology, pp 1354–1366 – reference: Bertero F, Bianchetti M, Marenco J (2018) Integer programming models for the routing and spectrum allocation problem. In: Official Journal of the Spanish Society of Statistics and Operations Research, pp 465–488 – reference: DijkstraEWA note on two problems in connexion with graphsNumer Math19591126927110760910.1007/BF01386390 – reference: Brun B, Baraketi S (2014) Routing and wavelength assignment in optical networks, pp 1–41. https://hal.archives-ouvertes.fr/hal-01062321 – reference: Ding Z, Xu Z, Zeng X, Ma T, Yang F (2014) Hybrid routing and spectrum assignment algorithms based on distance-adaptation combined coevolution and heuristics in elastic optical networks. J Opt Eng 1–10 – reference: Lopez V, Velasco L (2016) Elastic optical networks: architectures, technologies, and control. Springer Publishing Company, Incorporated – reference: Christodoulopoulos K, Manousakis K, Varvarigos E (2010) Offline routing and wavelength assignment in transparent wdm networks. In: Networking, IEEE/ACM transactions, pp 1557–1570 – reference: Diarrassouba I, Hadhbi Y (2022) The constrained-routing and spectrum assignment problem: valid inequalities and branch-and-cut algorithm. In: Ljubić I, Barahona F, Dey SS, Mahjoub AR (eds) Combinatorial optimization, ISCO, Lecture Notes in Computer Science, vol 13526 – reference: Dror M (1994) Note on the complexity of the shortest path models for column generation in VRPTW. J Oper Res 977–978 – reference: Hadhbi Y (2022) The constrained-routing and spectrum assignment problem: polyhedral analysis and algorithms. PhD thesis at Clermont Auvergne University – reference: Velasco L, Klinkowski M, Ruiz M, Comellas J (2012) Modeling the routing and spectrum allocation problem for flexgrid optical networks. Photon Network Commun 177–186 – reference: Hai DH, Hoang KM (2017) An efficient genetic algorithm approach for solving routing and spectrum assignment problem. J Recent Adv Signal Process 187–192 – reference: Nemhauser GL, Sigismondi G (1992) A strong cutting plane/branch-and-bound algorithm for node packing. J Oper Res Soc 443–457 – reference: Klinkowski M, Pioro M, Zotkiewicz M, Ruiz M, Velasco L (2015) A simulated annealing heuristic for a branch and price-based routing and spectrum allocation algorithm in elastic optical networks. In: Intelligent data engineering and automated learning – IDEAL, Springer International Publishing, pp 290–299 – reference: Klinkowski M, Walkowiak K (2011) Routing and spectrum assignment in spectrum sliced elastic optical path network. IEEE Commun Lett 884–886 – reference: Klinkowski M, Pedro J, Careglio D, Pioro M, Pires J, Monteiro P, Sole-Pareta J (2010) An overview of routing methods in optical burst switching networks. Opt Switch Network 41–53 – reference: Rebennack S, Reinelt G, Pardalos PM (2012) A tutorial on branch and cut algorithms for the maximum stable set problem. J Int Trans Oper Res 161–199 – reference: Liu L, Yin S, Zhang Z, Chu Y, Huang S (2019) A Monte Carlo based routing and spectrum assignment agent for elastic optical networks. In: Asia communications and photonics conference (ACP), pp 1–3 – reference: Pedro H, Fernandes da Silva, Kerivin H, Nant JP, Wagler A (2022) A framework for routing and spectrum assignment in optical networks, driven by combinatorial properties. In: The international network optimization conference (INOC), pp 1–6 – reference: Colares R, Kerivin H, Wagler A (2021) An extended formulation for the Constraint Routing and Spectrum Assignment Problem in Elastic Optical Networks, pp 1–16. https://hal.uca.fr/hal-03156189 – reference: CrowderHJohnsonELPadbergMWSolving large scale zero-one linear programming problemsOper Res19833180383410.1287/opre.31.5.803 – reference: Salani M, Rottondi C, Tornatore M (2019) Routing and spectrum assignment integrating machine-learning-based QoT estimation in elastic optical networks. In: IEEE INFOCOM - IEEE Conference on Computer Communications, p 173846 – reference: Shiva-Kumar M, Sreenivasa-Kumar P (2002) Static lightpath establishment in wdm networksnew ilp formulations and heuristic algorithms. Comput Commun 109–114 – reference: Klinkowski M, Pioro M, Zotkiewicz M, Ruiz M, Velasco L (2014) Valid inequalities for the routing and spectrum allocation problem in elastic optical networks. In: 16th international conference on transparent optical networks (ICTON), pp 1–5 – reference: Zotkiewicz M, Pioro M, Ruiz M, Klinkowski M, Velasco L (2013) Optimization models for flexgrid elastic optical networks. In: 15th international conference on transparent optical networks (ICTON), pp 1–4 – reference: Jaumard B, Daryalal M (2016) Scalable elastic optical path networking models. In: 18th international conference transparent optical networks (ICTON), pp 1–4 – reference: Shirazipourazad S, Zhou C, Derakhshandeh Z, Sen A (2013) On routing and spectrum allocation in spectrum-sliced optical networks. In: Proceedings IEEE INFOCOM, pp 385–389 – reference: Liu Z, Rouskas GN (2013) Link selection algorithms for link-based ilps and applications to rwa in mesh networks. In: Optical network design and modeling (ONDM), 17th international conference. IEEE, pp 59–64 – reference: Talebi S, Alam F , Katib I, Khamis M, Salama R, Rouskas GN (2014) Spectrum management techniques for elastic optical networks: a survey. In: Optical switching and networking, pp 34–48 – reference: Klabjan D, Nemhauser GL, Tovey C (1998) The complexity of cover inequality separation. Oper Res Lett 35–40 – reference: Lohani V, Sharma A, Singh YN (2019) Routing, modulation and spectrum assignment using an AI based algorithm. In: 11th international conference on communication systems & networks (COMSNETS), pp 266–271 – reference: NemhauserGLWolseyLAInteger and combinatorial optimization1988HobokenWiley10.1002/9781118627372 – reference: Goldberg AV, Tarjan RE (1986) A new approach to the maximum flow problem. In: Proceedings of the Eighteenth Annual Association for Computing Machinery Symposium on Theory of Computing, pp 136–146 – reference: Karp RM (1972) Reducibility among combinatorial problems. In: Complexity of computer computations: proceedings of a symposium on the complexity of computer computations, held March 20–22, 1972, at the IBM Thomas J. Watson Research Center, pp 85–94 – reference: RamaswamiROptical networks: a practical perspective20093Morgan Kaufmann Publishers Inc. – reference: Goscien R, Walkowiak K, Klinkowski M (2015) Tabu search algorithm, routing, modulation and spectrum allocation, anycast traffic, elastic optical networks. J Comput Netw 148–165 – reference: Orlowski S, Pióro M, Tomaszewski A, Wessäly R (2007) SNDlib 1.0-survivable network design library. In: Proceedings of the 3rd international network optimization conference (INOC 2007), Spa, Belgium – reference: Gong L, Zhou X, Lu W, Zhu Z (2012) A two-population based evolutionary approach for optimizing routing, modulation and spectrum assignments (RMSA) in O-OFDM networks. IEEE Commun Lett 1520–1523 – reference: PadbergMWOn the facial structure of set packing polyhedraMath Program1973519921536874910.1007/BF01580121 – reference: Chen X, Guo J, Zhu Z, Proietti R, Castro A, Yoo SJB (2018) Deep-RMSA: a deep-reinforcement-learning routing, modulation and spectrum assignment agent for elastic optical networks. In: Optical fiber communications conference and exposition (OFC), pp 1–3 – reference: AmarDPerformance assessment and modeling of flexible optical networks2016Institut National des TélécommunicationsThesis – reference: Hai DH, Morvan M, Gravey P (2017) Combining heuristic and exact approaches for solving the routing and spectrum assignment problem. J Iet Optoelectron 65–72 – reference: Gurobi Optimization LLC (2021) Gurobi optimizer reference manual. https://www.gurobi.com – reference: Hadhbi Y, Kerivin H, Wagler A (2019) A novel integer linear programming model for routing and spectrum assignment in optical networks. In: Federated conference on computer science and information systems (FedCSIS) , pp 127–134 – reference: Cplex II (2020) V12. 9: User’s manual for CPLEX. Int Bus Mach Corp 46(53):157 – reference: Ruiz M, Pioro M, Zotkiewicz M, Klinkowski M, Velasco L (2013) Column generation algorithm for RSA problems in flexgrid optical networks. Photon Netw Commun 53–64 – reference: Dumitrescu I, Boland N (2001) Algorithms for the weight constrained shortest path problem. Int Trans Oper Res 15–29 – reference: Mesquita LAJ, Assis K, Santos AF, Alencar M, Almeida RC (2018) A routing and spectrum assignment heuristic for elastic optical networks under incremental traffic. In: SBFoton international optics and photonics conference (SBFoton IOPC), pp 1–5 – reference: Chouman H, Luay A, Colares R, Gravey A Gravey P, Kerivin H, Morvan M, Wagler A (2021) Assessing the health of flexgrid optical networks, pp 1–7. https://hal.archives-ouvertes.fr/hal-03123302 – reference: LezamaFMartinez-HerreraAFCastanonGDel-Valle-SotoCSarmientoAMMunoz de CoteASolving routing and spectrum allocation problems in flexgrid optical networks using pre-computing strategiesJ Photon Netw Commun202141173510.1007/s11107-020-00918-4 – reference: Zang H, Jue JP, Mukherjee B et al (2000) A review of routing and wavelength assignment approaches for wavelength-routed optical wdm networks. In: Optical networks magazine, pp 47–60 – reference: Zhang Y, Xin J, Li X, Huang S (2020) Overview on routing and resource allocation based machine learning in optical networks. J Opt Fiber Technol 1–21 – reference: Chlamtac I, Ganz A, Karmi G (1992) Lightpath communications: an approach to high bandwidth optical WAN’s. IEEE Trans Commun 1171–1182 – reference: Simonis H (2011) Solving the static design routing and wavelength assignment problem. In: Recent advances in constraints. Springer, pp 59–75 – reference: Ruiz M, Pioro M, Zotkiewicz M, Klinkowski M, Velasco L (2020) A hybrid meta-heuristic approach for optimization of routing and spectrum assignment in Elastic Optical Network (EON). J Enterprise Inform Syst 11–24 – ident: 1125_CR50 – volume: 41 start-page: 17 year: 2021 ident: 1125_CR41 publication-title: J Photon Netw Commun doi: 10.1007/s11107-020-00918-4 – ident: 1125_CR46 doi: 10.1109/SBFoton-IOPC.2018.8610937 – volume-title: Integer and combinatorial optimization year: 1988 ident: 1125_CR48 doi: 10.1002/9781118627372 – volume-title: Optical networks: a practical perspective year: 2009 ident: 1125_CR53 – ident: 1125_CR17 doi: 10.1287/opre.42.5.977 – ident: 1125_CR44 doi: 10.1109/COMSNETS.2019.8711172 – ident: 1125_CR33 doi: 10.1109/ICOCN.2017.8121494 – ident: 1125_CR65 doi: 10.1007/s11107-012-0378-7 – ident: 1125_CR2 doi: 10.1007/s11750-018-0483-6 – ident: 1125_CR55 doi: 10.1111/j.1475-3995.2011.00805.x – volume: 1 start-page: 269 issue: 1 year: 1959 ident: 1125_CR15 publication-title: Numer Math doi: 10.1007/BF01386390 – ident: 1125_CR56 doi: 10.1007/s11107-013-0408-0 – ident: 1125_CR23 doi: 10.1007/978-3-642-97881-4 – volume: 5 start-page: 199 year: 1973 ident: 1125_CR51 publication-title: Math Program doi: 10.1007/BF01580121 – ident: 1125_CR34 doi: 10.1007/978-1-4684-2001-2_9 – ident: 1125_CR49 doi: 10.1109/NICS48868.2019.9023831 – ident: 1125_CR7 – ident: 1125_CR21 doi: 10.1109/LCOMM.2012.070512.120740 – ident: 1125_CR3 – ident: 1125_CR12 – ident: 1125_CR26 – ident: 1125_CR67 doi: 10.1016/j.yofte.2020.102355 – ident: 1125_CR43 – volume: 31 start-page: 803 year: 1983 ident: 1125_CR13 publication-title: Oper Res doi: 10.1287/opre.31.5.803 – ident: 1125_CR31 doi: 10.3390/s20154190 – ident: 1125_CR29 doi: 10.1049/iet-opt.2017.0013 – ident: 1125_CR19 – ident: 1125_CR57 – ident: 1125_CR11 – ident: 1125_CR8 – volume-title: Performance assessment and modeling of flexible optical networks year: 2016 ident: 1125_CR1 – ident: 1125_CR27 doi: 10.15439/2019F188 – ident: 1125_CR52 – ident: 1125_CR25 doi: 10.1016/j.jnca.2020.102576 – ident: 1125_CR35 doi: 10.1016/S0167-6377(98)00025-X – ident: 1125_CR14 doi: 10.1007/978-3-031-18530-4_3 – ident: 1125_CR42 – ident: 1125_CR38 doi: 10.1007/978-3-319-24834-9_35 – ident: 1125_CR61 doi: 10.1007/978-3-642-19486-3_4 – ident: 1125_CR62 – ident: 1125_CR9 doi: 10.1109/TNET.2010.2044585 – ident: 1125_CR59 doi: 10.1109/INFCOM.2013.6566800 – ident: 1125_CR66 – ident: 1125_CR37 doi: 10.1109/ICTON.2014.6876290 – ident: 1125_CR63 doi: 10.1016/j.ejor.2006.01.003 – volume: 12 start-page: 65 year: 2017 ident: 1125_CR30 publication-title: IET Optoelectron doi: 10.1049/iet-opt.2017.0013 – ident: 1125_CR22 doi: 10.1016/j.comnet.2014.12.004 – ident: 1125_CR58 doi: 10.1109/INFOCOM.2019.8737413 – ident: 1125_CR4 doi: 10.1109/JLT.2013.2282696 – ident: 1125_CR39 doi: 10.1109/ICTON.2015.7193482 – ident: 1125_CR64 doi: 10.1016/j.osn.2014.02.003 – ident: 1125_CR16 doi: 10.1117/1.OE.53.4.046105 – ident: 1125_CR18 doi: 10.1111/1475-3995.00003 – ident: 1125_CR40 doi: 10.1109/LCOMM.2011.060811.110281 – ident: 1125_CR36 doi: 10.1016/j.osn.2010.01.001 – ident: 1125_CR45 doi: 10.1007/978-3-319-30174-7 – ident: 1125_CR24 – ident: 1125_CR54 doi: 10.1109/35.186364 – ident: 1125_CR20 doi: 10.1145/12130.12144 – ident: 1125_CR68 doi: 10.1109/ICTON.2013.6602691 – ident: 1125_CR5 doi: 10.1364/OFC.2018.W4F.2 – ident: 1125_CR6 doi: 10.1109/26.153361 – ident: 1125_CR32 doi: 10.1109/ICTON.2016.7550385 – ident: 1125_CR47 doi: 10.1057/palgrave.jors.0430507 – ident: 1125_CR10 doi: 10.1109/JLT.2011.2125777 – ident: 1125_CR28 doi: 10.1109/SIGTELCOM.2017.7849820 – ident: 1125_CR60 doi: 10.1016/S0140-3664(01)00339-5 |
| SSID | ssj0009054 |
| Score | 2.336193 |
| Snippet | The Constrained-Routing and Spectrum Assignment (C-RSA) problem arises in the design of 5
G
telecommunication optical networks. Given an undirected, loopless,... The Constrained-Routing and Spectrum Assignment (C-RSA) problem arises in the design of 5G telecommunication optical networks. Given an undirected, loopless,... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 56 |
| SubjectTerms | Algorithms Artificial intelligence Combinatorics Constraints Convex and Discrete Geometry Heuristic Integer programming Linear programming Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization S.I. : New Challenges in Combinatorial Optimization Theory of Computation Wave division multiplexing |
| SummonAdditionalLinks | – databaseName: SpringerLink Journals (ICM) dbid: U2A link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA4yL3oQf-LmlBy8aaBNkyY9TnEMYZ4c7GRomnQbuG5sHfjn-5K1dooePJU2aQ5f0r7v8d77HkK3IrBAG2RChI4NYTGTRFtjiQ1zkeSMRYK7eufhSzwYsecxH1dFYes6270OSfo_9U6xm3RqsNRlTYBZJsAc97mT84JTPKK9Rmo34NtWtsAdwffjVanM72t8N0cNx_wRFvXWpn-MjiqaiHvbfT1Be7Y4RYc74oFwN_xSXF2fobcH1yFjStLCkGxT-uvSCQbh9H2yWM3K6RwDP8XwCs4cJ3StIawhq8XGJT5jmI991eVqM8dAqGcTnyaAq4Yz52jUf3p9HJCqdwLJqAhKYkIwOmCcgiSPeMxSDtCDcc9d3JRnDLwuQbUN8igKjGvXS8M0FYHmRgKfMeBhX6BWsSjsJcJJnsFTHeVCGsal0ak1NNLWyhC8n5S20V0NoVpuJTJUI4bsAFcAuPKAq4826tYoq-pzWavIqfInQPaSNrqvkW-G_16t87_pV-iA-s13CYtd1AJM7TWQilLf-DP0CQcbw8w priority: 102 providerName: Springer Nature |
| Title | Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem |
| URI | https://link.springer.com/article/10.1007/s10878-024-01125-x https://www.proquest.com/docview/3254699519 |
| Volume | 47 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVLSH databaseName: SpringerLink Journals customDbUrl: mediaType: online eissn: 1573-2886 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009054 issn: 1382-6905 databaseCode: AFBBN dateStart: 19970301 isFulltext: true providerName: Library Specific Holdings – providerCode: PRVAVX databaseName: SpringerLINK - Czech Republic Consortium customDbUrl: eissn: 1573-2886 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009054 issn: 1382-6905 databaseCode: AGYKE dateStart: 19970101 isFulltext: true titleUrlDefault: http://link.springer.com providerName: Springer Nature – providerCode: PRVAVX databaseName: SpringerLink Journals (ICM) customDbUrl: eissn: 1573-2886 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0009054 issn: 1382-6905 databaseCode: U2A dateStart: 19970301 isFulltext: true titleUrlDefault: http://www.springerlink.com/journals/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LS8NAEB76uOhBfGK1lj1408V0k83jINJKa1FaRCzUiyHJblrBPuwD-vOdSROjgp5CNg_ITLLzTXbm-wDOHUMjbHA97oS24pZtuTzUSnNdjx0vtizTkdTv3O3Znb51P5CDAvSyXhgqq8zmxGSiVtOI_pFfmUTc7iEe8G5mH5xUo2h1NZPQCFJpBXWdUIwVoSyIGasE5War9_iU0_AaciNzi7gS80KZttGkzXQusc0KqsrAsM_XP0NVjj9_LZkmkai9CzsphGSNjc_3oKAn-7D9jVgQ97pfbKyLA3htknrGiAcTxaPVMtnOiEyIBe9DfMblaMwQuzK8hEWEF0k2Qis-n66oKJrh-SzpyJyvxgzB9tswKSFgqRjNIfTbrefbDk91FXgkHGPJVR0DEgYuw4tNaVuBRLdg4I9pTVVGFmZkjgi1EZumoUjKV9SDwDFCqVzEOgqz7yMoTaYTfQzMiyMcDc3YcZUlXRUGWgkz1NqtY2YUiApcZCb0Zxv6DD8nSiaD-2hwPzG4v65ANbOyn35KCz93fAUuM8vnh_--28n_dzuFLZE4m4oXq1BCG-ozBBjLsAZFt31Xg3Lj7uWhVUvfIRzti8YnwZ7QXQ |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3JTsMwEB2xHIADYhWFAj7ACSxSx26SA0KsKksrhEDiREhiB5CgLbQV5ef4NmZShwAS3DhF2azoxbHfxDPvAax5jkHa4Afci6uay6r0eWy04aaSekEqpespqneuN6q1K3lyra6H4D2vhaG0ynxMzAZq3UroH_mWS8LtAfKBYKf9zMk1ilZXcwuNyFor6O1MYswWdpyat1cM4Trbxwf4vteFODq83K9x6zLAE-E5Xa4rODzjMO4EqauqMlL4kDgNprTCqBKJ8YknYuOkGPhrMrYVlSjynFhpH2d-jbEotjsMo9KVAQZ_o3uHjfOLQvbXUQNbXeSxGIcqW7Zji_d8UrcVlAWCNIP3v0-NBd_9sUSbzXxHUzBpKSvbHfSxaRgyzRmY-CJkiHv1T_XXzizc7JFbxz2PmponvW62bZN4EYse7xDT7v0TQ67M8BaWED8lmwqj-UurR0nYDK9nWQXoS--JIbl_uMtSFpg1v5mDq39BeB5Gmq2mWQAWpAkejd3U87VUvo4jo4UbG-NXMBKLRAk2cgjD9kCuIyyEmQnwEAEPM8DDfgnKOcqh_XQ7YdHRSrCZI1-c_r21xb9bW4Wx2mX9LDw7bpwuwbjIXjwlTpZhBPE0y0huuvGK7UEMbv-7034ARhYG_w |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELYQSAgGxFMUCnhgA6upY8fJWB5VebRioFInoiS220o0rdpU4udzdhJSEAxMURLHw-eL7jvd3XcIXQpHAW3wAyJiTxLmMZ_ESiqimloEmjFXcNPv3O15nT57HPDBShe_rXYvU5J5T4NRaUqzxkzqxkrjm2-UYampoAAXTYBFbjAjlAAW3aetSnbX4flYW-CREAfyom3m9z2-u6aKb_5IkVrP095FOwVlxK38jPfQmkr30faKkCDcdb_UVxcH6O3GTMsYkSiVJFlm9joz4kE4eh9O5-NsNMHAVTF8ghPDD82YCCXJfLo0RdAY1mPbgTlfTjCQ6_HQlgzgYvjMIeq3719vO6SYo0ASKpyMyCY4IHBUTqBd7rGIwzGAo9cmh8oTBhGYoLFytOs60ozupc0oEk7MpQ_cRkK0fYTW02mqjhEOdAJPY1cLXzLuyzhSkrqxUn4TIqGI1tBVCWE4y-UywkoY2QAeAuChBTz8qKF6iXJY_DqL0DUK_QEQv6CGrkvkq9d_73byv-UXaPPlrh0-P_SeTtEWtXZg6hjraB3gVWfANbL43JrTJxBeyvQ |
| 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=Branch-and-cut-and-price+algorithm+for+the+constrained-routing+and+spectrum+assignment+problem&rft.jtitle=Journal+of+combinatorial+optimization&rft.au=Diarrassouba%2C+Ibrahima&rft.au=Hadhbi%2C+Youssouf&rft.au=Mahjoub%2C+A.+Ridha&rft.date=2024-05-01&rft.pub=Springer+Nature+B.V&rft.issn=1382-6905&rft.eissn=1573-2886&rft.volume=47&rft.issue=4&rft.spage=56&rft_id=info:doi/10.1007%2Fs10878-024-01125-x |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1382-6905&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1382-6905&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1382-6905&client=summon |