Andréa C. Santos

According to our database1, Andréa C. Santos authored at least 36 papers between 2008 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Bi-objective methods for road network problems with disruptions and connecting requirements.
J. Oper. Res. Soc., 2020

Model and methods to address urban road network problems with disruptions.
Int. Trans. Oper. Res., 2020

Modeling and solving the multi-period disruptions scheduling problem on urban networks.
Ann. Oper. Res., 2020

2018
Trees and Forests.
Proceedings of the Handbook of Heuristics., 2018

Vehicle routing problems for last mile distribution after major disaster.
J. Oper. Res. Soc., 2018

Special issue on "Developments in Optimization for Smart Cities".
Int. Trans. Oper. Res., 2018

Methods for solving road network problems with disruptions.
Electron. Notes Discret. Math., 2018

Formulation and algorithms for the robust maximal covering location problem.
Electron. Notes Discret. Math., 2018

A Multigraph Formulation for the Generalized Minimum Spanning Tree Problem.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017
A biased random-key genetic algorithm for the tree of hubs location problem.
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

A column generation approach for the strong network orientation problem.
Electron. Notes Discret. Math., 2017

A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs.
Comput. Oper. Res., 2017

2016
Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands.
RAIRO Oper. Res., 2016

Work-troop scheduling for road network accessibility after a major earthquake.
Electron. Notes Discret. Math., 2016

Road network emergency accessibility planning after a major earthquake.
EURO J. Comput. Optim., 2016

Heuristics for designing multi-sink clustered WSN topologies.
Eng. Appl. Artif. Intell., 2016

Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations.
Ann. Oper. Res., 2016

On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-Max Regret Optimization Problems with Interval Costs.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem.
RAIRO Oper. Res., 2015

Preface.
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 bi-objective minimum diameter-cost 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

Heuristic Approaches for the Robust Vehicle Routing Problem.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Strategies to Optimize the Impact of Supplies Distribution in Post-disaster 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
Strategies for designing energy-efficient clusters-based WSN topologies.
J. Heuristics, 2012

Models and hybrid methods for the onshore wells maintenance problem.
Comput. Oper. Res., 2012

2010
A hybrid heuristic for the diameter constrained minimum spanning tree problem.
J. Glob. Optim., 2010

Solving diameter-constrained minimum spanning tree problems by constraint programming.
Int. Trans. Oper. Res., 2010

2009
Heuristics for Designing Energy-efficient Wireless Sensor Network Topologies.
J. Networks, 2009

2008
Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem.
Electron. Notes Discret. Math., 2008

An Optimization Approach for Designing Wireless Sensor Networks.
Proceedings of the NTMS 2008, 2008

Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem.
Proceedings of the Modelling, 2008


  Loading...