Rosa Figueiredo

According to our database1, Rosa Figueiredo authored at least 28 papers between 1997 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 





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

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

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

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

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

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

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

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

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

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

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

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

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