default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmal Benhamiche
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c10]Amal Benhamiche, Morgan Chopin, Sébastien Martin
:
Unsplittable Shortest Path Routing: Extended Model and Matheuristic. CoDIT 2023: 926-931- 2022
- [j6]Wesley da Silva Coelho, Amal Benhamiche, Nancy Perrot, Stefano Secci:
Function Splitting, Isolation, and Placement Trade-Offs in Network Slicing. IEEE Trans. Netw. Serv. Manag. 19(2): 1920-1936 (2022) - [c9]Guilherme Iecker Ricardo, Amal Benhamiche, Nancy Perrot, Yannick Carlinet:
Latency-Constrained Task Distribution in Multi-Access Edge Computing Systems. CloudNet 2022: 150-158 - [c8]Guilherme Iecker Ricardo, Amal Benhamiche, Nancy Perrot, Yannick Carlinet:
Heuristic Distribution of Latency-Sensitive Tasks in Multi-Access Edge Computing Systems. GLOBECOM (Workshops) 2022: 680-685 - [c7]Rafael Colares, Amal Benhamiche, Yannick Carlinet, Nancy Perrot:
A branch-and-cut algorithm for the availability-aware VNF placement problem in virtualized networks. INOC 2022: 1-6 - [c6]Paolo Zappalà, Amal Benhamiche, Matthieu Chardy, Francesco De Pellegrini, Rosa Figueiredo:
A timing game approach for the roll-out of new mobile technologies. WiOpt 2022: 217-224 - 2021
- [c5]Wesley da Silva Coelho, Amal Benhamiche, Nancy Perrot, Stefano Secci:
A Math-Heuristic for Network Slice Design. ITC 2021: 1-9 - 2020
- [j5]Wesley da Silva Coelho, Amal Benhamiche, Nancy Perrot, Stefano Secci:
Network Function Mapping: From 3G Entities to 5G Service-Based Functions Decomposition. IEEE Commun. Stand. Mag. 4(3): 46-52 (2020) - [j4]Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa:
Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut. Discret. Optim. 35: 100555 (2020) - [c4]Wesley da Silva Coelho, Amal Benhamiche, Nancy Perrot, Stefano Secci:
On the impact of novel function mappings, sharing policies, and split settings in network slice design. CNSM 2020: 1-9 - [i2]Amal Benhamiche, Morgan Chopin:
Toward Scalable Algorithms for the Unsplittable Shortest Path Routing Problem. CoRR abs/2006.04324 (2020)
2010 – 2019
- 2019
- [j3]Jonathan Spruytte, Amal Benhamiche, Matthieu Chardy, Sofie Verbrugge, Didier Colle:
Modeling the relationship between network operators and venue owners in public Wi-Fi deployment using non-cooperative game theory. EURASIP J. Wirel. Commun. Netw. 2019: 243 (2019) - [c3]Amal Benhamiche, Wesley da Silva Coelho, Nancy Perrot:
Routing and Resource Assignment Problems in Future 5G Radio Access Networks. INOC 2019: 89-94 - 2018
- [c2]Nesrine Ben Khalifa, Amal Benhamiche, Alain Simonian, Marc Bouillon:
Profit and Strategic Analysis for MNO-MVNO Partnership. Networking 2018: 225-333 - [i1]Nesrine Ben Khalifa, Amal Benhamiche, Alain Simonian, Marc Bouillon:
Profit and Strategic Analysis for MNO-MVNO Partnership. CoRR abs/1812.05413 (2018) - 2016
- [j2]Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa:
Unsplittable non-additive capacitated network design using set functions polyhedra. Comput. Oper. Res. 66: 105-115 (2016) - 2013
- [j1]Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa:
Capacitated Network Design using Bin-Packing. Electron. Notes Discret. Math. 41: 479-486 (2013) - 2011
- [c1]Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot:
On the Design of Optical OFDM-Based Networks. INOC 2011: 1-6
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
