default search action
Serigne Gueye
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Francesco De Pellegrini, Vaibhav Kumar Gupta, Rachid El Azouzi, Serigne Gueye, Cédric Richier, Jeremie Leguay:
Fair Coflow Scheduling via Controlled Slowdown. IEEE Trans. Parallel Distributed Syst. 35(12): 2347-2360 (2024) - 2022
- [i5]Francesco De Pellegrini, Vaibhav Kumar Gupta, Rachid El Azouzi, Serigne Gueye, Cédric Richier, Jeremie Leguay:
Fair Coflow Scheduling via Controlled Slowdown. CoRR abs/2208.06513 (2022) - 2021
- [j15]Mouhamadou A. M. T. Baldé
, Serigne Gueye, Babacar Mbaye Ndiaye
A greedy evolutionary hybridization algorithm for the optimal network and quadratic assignment problem. Oper. Res. 21(3): 1663-1690 (2021) - 2020
- [j14]Thays A. Oliveira
Mobility, Citizens, Innovation and Technology in Digital and Smart Cities. Future Internet 12(2): 22 (2020)
2010 – 2019
- 2019
- [j13]Thiago Gouveia da Silva
A polyhedral approach to the generalized minimum labeling spanning tree problem. EURO J. Comput. Optim. 7(1): 47-77 (2019) - [j12]Thiago Gouveia da Silva
A hybrid metaheuristic for the minimum labeling spanning tree problem. Eur. J. Oper. Res. 274(1): 22-34 (2019) - [j11]Xavier Bost
Remembering winter was coming - Character-oriented video summaries of TV series. Multim. Tools Appl. 78(24): 35373-35399 (2019) - [i4]Thiago Gouveia da Silva, Gilberto Farias de Sousa Filho, Luiz Satoru Ochi, Philippe Michelon, Serigne Gueye, Lucídio A. F. Cabral:
Solving the minimum labeling global cut problem by mathematical programming. CoRR abs/1903.04319 (2019) - [i3]Xavier Bost, Serigne Gueye, Vincent Labatut, Martha A. Larson, Georges Linarès, Damien Malinas, Raphaël Roth
Remembering winter was coming. CoRR abs/1909.02423 (2019) - 2018
- [j10]Micheli Knechtel, Philippe Michelon
A Neighborhood Exploration Approach with Multi-start for Extend Generalized Block-modeling. Electron. Notes Discret. Math. 66: 63-70 (2018) - [p1]Xavier Bost, Vincent Labatut
Extraction and Analysis of Dynamic Conversational Networks from TV Series. Social Network Based Big Data Analysis and Applications 2018: 55-84 - [i2]Xavier Bost, Vincent Labatut, Serigne Gueye, Georges Linarès:
Extraction and Analysis of Dynamic Conversational Networks from TV Series. CoRR abs/1805.06782 (2018) - [i1]Xavier Bost, Georges Linarès, Serigne Gueye:
Audiovisual speaker diarization of TV series. CoRR abs/1812.07205 (2018) - 2016
- [c6]Xavier Bost, Vincent Labatut
Narrative smoothing: Dynamic conversational network for the analysis of TV series plots. ASONAM 2016: 1111-1118 - 2015
- [j9]Serigne Gueye, Philippe Michelon
A linear formulation with O(n2) variables for quadratic assignment problems with Manhattan distance matrices. EURO J. Comput. Optim. 3(2): 79-110 (2015) - [j8]Serigne Gueye
General asymptotic and submodular results for the Median Problem with Unreliable Facilities. Oper. Res. Lett. 43(5): 519-521 (2015) - [c5]Xavier Bost, Georges Linarès, Serigne Gueye:
Audiovisual speaker diarization of TV series. ICASSP 2015: 4799-4803 - 2014
- [c4]Mahdi Moeini, Serigne Gueye, Sophie Michel Loyal:
A New Mathematical Model For the Minimum Linear Arrangement Problem. ICORES 2014: 57-62 - [c3]Serigne Gueye, Sophie Michel Loyal, Mahdi Moeini
Adjacency Variables Formulation for the Minimum Linear Arrangement Problem. ICORES (Selected Papers) 2014: 95-107 - 2012
- [j7]Carlos Diego Rodrigues, Dominique Quadri, Philippe Michelon
0-1 Quadratic Knapsack Problems: An Exact Approach Based on a t-Linearization. SIAM J. Optim. 22(4): 1449-1468 (2012) - 2011
- [j6]Rodrigo Acuna-Agost, Philippe Michelon, Dominique Feillet
SAPI: Statistical Analysis of Propagation of Incidents. A new approach for rescheduling trains after disruptions. Eur. J. Oper. Res. 215(1): 227-243 (2011) - [j5]Rodrigo Acuna-Agost, Philippe Michelon
A MIP-based local search method for the railway rescheduling problem. Networks 57(1): 69-86 (2011) - 2010
- [j4]Madiagne Diallo, Serigne Gueye, Pascal Berthomé:
Sensitivity analysis on the all pairs q-route flows in a network. Int. Trans. Oper. Res. 17(1): 103-117 (2010)
2000 – 2009
- 2009
- [j3]Serigne Gueye, Philippe Michelon
A linearization framework for unconstrained quadratic (0-1) problems. Discret. Appl. Math. 157(6): 1255-1266 (2009) - [j2]Madiagne Diallo, Serigne Gueye, Pascal Berthomé:
Impact of a varying capacity on the all pairs 2-route network flows. Electron. Notes Discret. Math. 35: 59-64 (2009) - [c2]Rodrigo Acuna-Agost, Philippe Michelon
Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations. CPAIOR 2009: 312-313 - 2008
- [c1]Mohamed Lemrabott, Serigne Gueye, Adnan Yassine, Yves Rakotondratsimba:
Portfolio Selection under Piecewise Affine Transaction Costs: An Integer Quadratic Formulation. MCO 2008: 190-196 - 2005
- [j1]Serigne Gueye, Philippe Michelon
"Miniaturized" Linearizations for Quadratic 0/1 Problems. Ann. Oper. Res. 140(1): 235-261 (2005)
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 2024-10-22 21:18 CEST 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: