Author of the publication

A Math-Heuristic for Network Slice Design

, , , and . 2021 33rd International Teletraffic Congress (ITC-33), page 1-9. Avignon, France, (August 2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Function Splitting, Isolation, and Placement Trade-Offs in Network Slicing., , , and . IEEE Trans. Netw. Serv. Manag., 19 (2): 1920-1936 (2022)Unsplittable Shortest Path Routing: Extended Model and Matheuristic., , and . CoDIT, page 926-931. IEEE, (2023)A Math-Heuristic for Network Slice Design., , , and . ITC, page 1-9. IEEE, (2021)A branch-and-cut algorithm for the availability-aware VNF placement problem in virtualized networks., , , and . INOC, page 1-6. OpenProceedings.org, (2022)Capacitated Network Design using Bin-Packing., , , and . Electron. Notes Discret. Math., (2013)Toward Scalable Algorithms for the Unsplittable Shortest Path Routing Problem., and . CoRR, (2020)Routing and Resource Assignment Problems in Future 5G Radio Access Networks., , and . INOC, page 89-94. OpenProceedings.org, (2019)Modeling the relationship between network operators and venue owners in public Wi-Fi deployment using non-cooperative game theory., , , , and . EURASIP J. Wireless Comm. and Networking, (2019)Network Function Mapping: From 3G Entities to 5G Service-Based Functions Decomposition., , , and . IEEE Commun. Stand. Mag., 4 (3): 46-52 (2020)Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut., , , and . Discret. Optim., (2020)