Rosa Figueiredo

Orcid: 0000-0002-0344-2686

Affiliations:
  • Avignon University, France


According to our database1, Rosa Figueiredo authored at least 45 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Efficient solutions to the m-machine robust flow shop under budgeted uncertainty.
Ann. Oper. Res., July, 2024

Correlation Clustering Problem Under Mediation.
INFORMS J. Comput., 2024

2023
Joint Traffic Offloading and Aging Control in 5G IoT Networks.
IEEE Trans. Mob. Comput., August, 2023

Efficient enumeration of the optimal solutions to the correlation clustering problem.
J. Glob. Optim., June, 2023

Robust permutation flow shop total weighted completion time problem: Solution and application to the oil and gas industry.
Comput. Oper. Res., 2023

Pattern Mining for Anomaly Detection in Graphs: Application to Fraud in Public Procurement.
Proceedings of the Machine Learning and Knowledge Discovery in Databases: Applied Data Science and Demo Track, 2023

Extraction de motifs pour la détection d'anomalies dans des graphes : application à la fraude dans les marchés publics.
Proceedings of the Extraction et Gestion des Connaissances, 2023

2022
Robust microgrid energy trading and scheduling under budgeted uncertainty.
Expert Syst. Appl., October, 2022

Exact solutions for the two-machine robust flow shop with budgeted uncertainty.
Eur. J. Oper. Res., 2022

Optimizing subscriber migrations for a telecommunication operator in uncertain context.
Eur. J. Oper. Res., 2022

A timing game approach for the roll-out of new mobile technologies.
Proceedings of the 20th International Symposium on Modeling and Optimization in Mobile, 2022

2021
Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator.
Networks, 2021

Integer programming formulations and efficient local search for relaxed correlation clustering.
J. Glob. Optim., 2021

Multiplicity and diversity: analysing the optimal solution space of the correlation clustering problem on complete signed graphs.
J. Complex Networks, 2021

Characterizing and Comparing External Measures for the Assessment of Cluster Analysis and Community Detection.
IEEE Access, 2021

2020
Multiple partitioning of multiplex signed networks: Application to European parliament votes.
Soc. Networks, 2020

Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach.
Optim. Lett., 2020

Heuristics for a vehicle routing problem with information collection in wireless networks.
J. Heuristics, 2020

Mixed integer formulations for a routing problem with information collection in wireless networks.
Eur. J. Oper. Res., 2020

Multiplicity and Diversity: Analyzing the Optimal Solution Space of the Correlation Clustering Problem on Complete Signed Graphs.
CoRR, 2020

Characterizing measures for the assessment of cluster analysis and community detection (extended abstract).
Proceedings of MARAMI 2020 - Modèles & Analyse des Réseaux : Approches Mathématiques & Informatiques, 2020

2019
A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph.
Discret. Appl. Math., 2019

On two new formulations for the fixed charge network design problem with shortest path constraints.
Comput. Oper. Res., 2019

Vehicle Routing Problem for Information Collection in Wireless Networks.
Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 2019

2018
Analysis of Roll-Calls in the European Parliament by Multiple Partitioning of Multiplex Signed Networks.
CoRR, 2018

2017
Feasibility check for the distance geometry problem: an application to molecular conformations.
Int. Trans. Oper. Res., 2017

Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems.
EURO J. Comput. Optim., 2017

Evaluating balancing on social networks through the efficient solution of correlation clustering problems.
EURO J. Comput. Optim., 2017

Signed Graph Analysis for the Interpretation of Voting Behavior.
CoRR, 2017

2015
An ILS algorithm to evaluate structural balance in signed social networks.
Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015

Relevance of Negative Links in Graph Partitioning: A Case Study Using Votes from the European Parliament.
Proceedings of the 2015 Second European Network Intelligence Conference, 2015

2014
The maximum balanced subgraph of a signed graph: Applications and solution approaches.
Eur. J. Oper. Res., 2014

2013
Mixed integer programming formulations for clustering problems related to structural balance.
Soc. Networks, 2013

An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph.
CoRR, 2013

The robust vehicle routing problem with time windows.
Comput. Oper. Res., 2013

Efficient Solution of the Correlation Clustering Problem: An Application to Structural Balance.
Proceedings of the On the Move to Meaningful Internet Systems: OTM 2013 Workshops, 2013

Solution of the Maximum $$k$$ k -Balanced Subgraph Problem.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

2012
Layered Formulation for the Robust Vehicle Routing Problem with Time Windows.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Transmission Expansion Planning with Re-design - A Greedy Randomized Adaptive Search Procedure.
Proceedings of the ICORES 2012, 2012

2011
Scheduling with sequence-dependent batch setup times: planning tests for a pharmaceutic industry.
Int. J. Math. Model. Numer. Optimisation, 2011

An exact approach to the problem of extracting an embedded network matrix.
Comput. Oper. Res., 2011

2008
Acyclic Orientations with Path Constraints.
RAIRO Oper. Res., 2008

2005
An experience with an enriched task model for educational software.
Proceedings of the Extended Abstracts Proceedings of the 2005 Conference on Human Factors in Computing Systems, 2005

1998
A New Self-Organizing Strategy Based on Elastic Networks for Solving the Euclidean Traveling Salesman Problem.
Proceedings of the Tasks and Methods in Applied Artificial Intelligence, 1998

1997
Design and implementation of a parallel genetic algorithm for the travelling purchaser problem.
Proceedings of the 1997 ACM symposium on Applied Computing, 1997


  Loading...