Serigne Gueye

Orcid: 0000-0001-7217-8543

According to our database1, Serigne Gueye authored at least 26 papers between 2005 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Fair Coflow Scheduling via Controlled Slowdown.
CoRR, 2022

2021
A greedy evolutionary hybridization algorithm for the optimal network and quadratic assignment problem.
Oper. Res., 2021

2020
Mobility, Citizens, Innovation and Technology in Digital and Smart Cities.
Future Internet, 2020

2019
Remembering winter was coming - Character-oriented video summaries of TV series.
Multim. Tools Appl., 2019

A hybrid metaheuristic for the minimum labeling spanning tree problem.
Eur. J. Oper. Res., 2019

A polyhedral approach to the generalized minimum labeling spanning tree problem.
EURO J. Comput. Optim., 2019

Remembering winter was coming.
CoRR, 2019

Solving the minimum labeling global cut problem by mathematical programming.
CoRR, 2019

2018
Extraction and Analysis of Dynamic Conversational Networks from TV Series.
Proceedings of the Social Network Based Big Data Analysis and Applications, 2018

A Neighborhood Exploration Approach with Multi-start for Extend Generalized Block-modeling.
Electron. Notes Discret. Math., 2018

Extraction and Analysis of Dynamic Conversational Networks from TV Series.
CoRR, 2018

2016
Narrative smoothing: Dynamic conversational network for the analysis of TV series plots.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015
General asymptotic and submodular results for the Median Problem with Unreliable Facilities.
Oper. Res. Lett., 2015

A linear formulation with O(n<sup>2</sup>) variables for quadratic assignment problems with Manhattan distance matrices.
EURO J. Comput. Optim., 2015

Audiovisual speaker diarization of TV series.
Proceedings of the 2015 IEEE International Conference on Acoustics, 2015

2014
A New Mathematical Model For the Minimum Linear Arrangement Problem.
Proceedings of the ICORES 2014, 2014

Adjacency Variables Formulation for the Minimum Linear Arrangement Problem.
Proceedings of the Operations Research and Enterprise Systems, 2014

2012
0-1 Quadratic Knapsack Problems: An Exact Approach Based on a t-Linearization.
SIAM J. Optim., 2012

2011
A MIP-based local search method for the railway rescheduling problem.
Networks, 2011

SAPI: Statistical Analysis of Propagation of Incidents. A new approach for rescheduling trains after disruptions.
Eur. J. Oper. Res., 2011

2010
Sensitivity analysis on the all pairs <i>q</i>-route flows in a network.
Int. Trans. Oper. Res., 2010

2009
Impact of a varying capacity on the all pairs 2-route network flows.
Electron. Notes Discret. Math., 2009

A linearization framework for unconstrained quadratic (0-1) problems.
Discret. Appl. Math., 2009

Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009

2008
Portfolio Selection under Piecewise Affine Transaction Costs: An Integer Quadratic Formulation.
Proceedings of the Modelling, 2008

2005
"Miniaturized" Linearizations for Quadratic 0/1 Problems.
Ann. Oper. Res., 2005


  Loading...