| Publication | Date of Publication | Type |
|---|
Solving the probabilistic drone routing problem: searching for victims in the aftermath of disasters
Networks | 2024-07-03 | Paper |
Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
RAIRO - Operations Research | 2024-02-02 | 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 |
A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
International Transactions in Operational Research | 2023-09-29 | Paper |
| A min-max regret approach for the Steiner Tree Problem with Interval Costs | 2021-01-09 | Paper |
A min-max regret approach for the Steiner Tree Problem with Interval Costs
(available as arXiv preprint) | 2021-01-01 | 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 |
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 |
Models and hybrid methods for the onshore wells maintenance problem
Computers & Operations Research | 2016-11-11 | Paper |
Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem
4OR | 2016-06-14 | Paper |
Variable neighborhood descent with iterated local search for routing and wavelength assignment
Computers & Operations Research | 2012-11-15 | Paper |
Models and heuristics for the \(k\)-degree constrained minimum spanning tree problem with node-degree costs
Networks | 2012-11-15 | Paper |
Efficient frameworks for greedy split and new depth first search split procedures for routing problems
Computers & Operations Research | 2010-12-20 | Paper |
A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
Computers & Operations Research | 2010-12-01 | Paper |
K-splittable delay constrained routing problem: A branch-and-price approach
Networks | 2010-11-24 | Paper |
A GRASP\(\times \)ELS approach for the capacitated location-routing problem
Computers & Operations Research | 2010-06-11 | Paper |
Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem
Communications in Computer and Information Science | 2009-05-13 | Paper |
Aggregation approach for the minimum binary cost tension problem
European Journal of Operational Research | 2009-04-30 | Paper |
A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
Discrete Optimization | 2008-08-15 | Paper |
Models and heuristics for a minimum arborescence problem
Networks | 2008-01-08 | Paper |
Multicommodity flow problems with a bounded number of paths: A flow deviation approach
Networks | 2007-02-02 | Paper |
A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
Transportation Science | 1997-11-25 | Paper |
