Andréa C. Santos
According to our database^{1},
Andréa C. Santos
authored at least 36 papers
between 2008 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2020
Biobjective methods for road network problems with disruptions and connecting requirements.
J. Oper. Res. Soc., 2020
Int. Trans. Oper. Res., 2020
Modeling and solving the multiperiod disruptions scheduling problem on urban networks.
Ann. Oper. Res., 2020
2018
Proceedings of the Handbook of Heuristics., 2018
J. Oper. Res. Soc., 2018
Int. Trans. Oper. Res., 2018
Electron. Notes Discret. Math., 2018
Electron. Notes Discret. Math., 2018
Proceedings of the Combinatorial Optimization  5th International Symposium, 2018
2017
Optim. Lett., 2017
Erratum to: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem.
J. Glob. Optim., 2017
Electron. Notes Discret. Math., 2017
A linear programming based heuristic framework for minmax regret combinatorial optimization problems with interval costs.
Comput. Oper. Res., 2017
2016
Solving the biobjective Robust Vehicle Routing Problem with uncertain costs and demands.
RAIRO Oper. Res., 2016
Electron. Notes Discret. Math., 2016
EURO J. Comput. Optim., 2016
Eng. Appl. Artif. Intell., 2016
Connecting a population dynamic model with a multiperiod locationallocation problem for postdisaster relief operations.
Ann. Oper. Res., 2016
On the Finite Optimal Convergence of LogicBased Benders' Decomposition in Solving 01 MinMax Regret Optimization Problems with Interval Costs.
Proceedings of the Combinatorial Optimization  4th International Symposium, 2016
2015
An exact method for solving the biobjective Minimum DiameterCost Spanning Tree Problem.
RAIRO Oper. Res., 2015
RAIRO Oper. Res., 2015
Local search based metaheuristics for the robust vehicle routing problem with discrete scenarios.
Appl. Soft Comput., 2015
2014
Modeling and solving the biobjective minimum diametercost spanning tree problem.
J. Glob. Optim., 2014
An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem.
J. Glob. Optim., 2014
Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size.
Int. Trans. Oper. Res., 2014
Proceedings of the Combinatorial Optimization  Third International Symposium, 2014
Strategies to Optimize the Impact of Supplies Distribution in Postdisaster Operations.
Proceedings of the ICORES 2014, 2014
A Robust optimization approach for the Vehicle Routing problem with uncertain travel cost.
Proceedings of the International Conference on Control, 2014
2012
J. Heuristics, 2012
Comput. Oper. Res., 2012
2010
J. Glob. Optim., 2010
Solving diameterconstrained minimum spanning tree problems by constraint programming.
Int. Trans. Oper. Res., 2010
2009
J. Networks, 2009
2008
Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem.
Electron. Notes Discret. Math., 2008
Proceedings of the NTMS 2008, 2008
Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem.
Proceedings of the Modelling, 2008