| Publication | Date of Publication | Type |
|---|
Meta partial Benders decomposition for the logistics service network design problem
European Journal of Operational Research | 2022-03-18 | Paper |
An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems
Computers & Operations Research | 2022-03-09 | Paper |
A Benders decomposition-based approach for logistics service network design
European Journal of Operational Research | 2020-05-27 | Paper |
Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
European Journal of Operational Research | 2020-02-11 | Paper |
Optimizing ground station networks for free space optical communications: maximizing the data transfer
Networks | 2019-03-19 | Paper |
Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective
EURO Journal on Computational Optimization | 2018-11-07 | Paper |
| An exact column generation-based algorithm for bi-objective vehicle routing problems | 2018-08-17 | Paper |
| Ground stations networks for free-space optical communications: maximizing the data transfer | 2018-04-11 | Paper |
Inventory routing with explicit energy consumption: a mass-flow formulation and first experimentation
Operations Research and Enterprise Systems | 2017-04-28 | Paper |
Approximation of the parallel machine scheduling problem with additional unit resources
Discrete Applied Mathematics | 2016-10-07 | Paper |
A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite
European Journal of Operational Research | 2016-10-06 | Paper |
A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
INFORMS Journal on Computing | 2016-06-29 | Paper |
Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems
RAIRO - Operations Research | 2015-08-14 | Paper |
| Column generation for bi-objective vehicle routing problems with a MIN-MAX objective | 2014-02-24 | Paper |
| An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives | 2013-11-08 | Paper |
A branch-and-price algorithm for the windy rural postman problem
RAIRO - Operations Research | 2012-04-18 | Paper |
A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
Computers & Operations Research | 2011-04-28 | Paper |
From single-objective to multi-objective vehicle routing problems: motivations, case studies, and methods
Operations Research/Computer Science Interfaces | 2010-06-02 | Paper |
An evolutionary algorithm for the vehicle routing problem with route balancing
European Journal of Operational Research | 2009-01-08 | Paper |
Multi-objective meta-heuristics for the traveling salesman problem with profits
JMMA. Journal of Mathematical Modelling and Algorithms | 2008-06-11 | Paper |
Multi-objective vehicle routing problems
European Journal of Operational Research | 2008-04-07 | Paper |
The bi-objective covering tour problem
Computers & Operations Research | 2007-02-19 | Paper |
