| Publication | Date of Publication | Type |
|---|
Solving the probabilistic drone routing problem: searching for victims in the aftermath of disasters
Networks | 2024-07-03 | Paper |
The strong network orientation problem
International Transactions in Operational Research | 2023-11-29 | Paper |
Model and methods to address urban road network problems with disruptions
International Transactions in Operational Research | 2023-11-17 | Paper |
Metaheuristics for the work‐troops scheduling problem
International Transactions in Operational Research | 2023-09-29 | Paper |
A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours
OR Spectrum | 2023-09-15 | Paper |
Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters
European Journal of Operational Research | 2022-12-19 | Paper |
Robust min-max regret covering problems
Computational Optimization and Applications | 2022-08-08 | Paper |
| A multigraph formulation for the generalized minimum spanning tree problem | 2018-08-17 | Paper |
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
Computers & Operations Research | 2018-07-11 | Paper |
| Formulation and algorithms for the robust maximal covering location problem | 2018-04-11 | Paper |
| Methods for solving road network problems with disruptions | 2018-04-11 | Paper |
| A column generation approach for the strong network orientation problem | 2018-04-09 | Paper |
A biased random-key genetic algorithm for the tree of hubs location problem
Optimization Letters | 2017-11-09 | Paper |
Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
Journal of Global Optimization | 2017-11-02 | Paper |
Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations
Annals of Operations Research | 2017-03-03 | Paper |
Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands
RAIRO - Operations Research | 2017-01-12 | Paper |
On the finite optimal convergence of logic-based Benders' decomposition in solving 0-1 min-max regret optimization problems with interval costs
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Road network emergency accessibility planning after a major earthquake
EURO Journal on Computational Optimization | 2016-11-11 | Paper |
Models and hybrid methods for the onshore wells maintenance problem
Computers & Operations Research | 2016-11-11 | Paper |
| Work-troop scheduling for road network accessibility after a major earthquake | 2016-10-18 | Paper |
Heuristic approaches for the robust vehicle routing problem
Lecture Notes in Computer Science | 2015-10-16 | Paper |
An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
RAIRO - Operations Research | 2015-04-27 | Paper |
Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
Journal of Global Optimization | 2015-01-15 | Paper |
An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
Journal of Global Optimization | 2015-01-15 | Paper |
Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
International Transactions in Operational Research | 2014-06-20 | Paper |
Solving diameter-constrained minimum spanning tree problems by constraint programming
International Transactions in Operational Research | 2011-05-20 | Paper |
A hybrid heuristic for the diameter constrained minimum spanning tree problem
Journal of Global Optimization | 2010-03-15 | Paper |
Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem
Communications in Computer and Information Science | 2009-05-13 | Paper |
Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
