| Publication | Date of Publication | Type |
|---|
Optimal area polygonisation problems: mixed integer linear programming models
European Journal of Operational Research | 2026-02-26 | Paper |
Dual-driven path elimination for vehicle routing with idle times and arrival-time consistency
Computers & Operations Research | 2026-02-23 | Paper |
The capacitated vehicle routing problem with planned downtime
Computational Optimization and Applications | 2025-11-17 | Paper |
A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
Computers & Operations Research | 2023-11-15 | Paper |
An efficient multistart heuristic for the driver and vehicle routing problem
Computers & Operations Research | 2022-12-19 | Paper |
The single-vehicle two-echelon one-commodity pickup and delivery problem
Computers & Operations Research | 2021-05-21 | Paper |
The periodic vehicle routing problem with driver consistency
European Journal of Operational Research | 2018-11-19 | Paper |
The driver and vehicle routing problem
Computers & Operations Research | 2018-07-12 | Paper |
An exact algorithm for a vehicle-and-driver scheduling problem
Computers & Operations Research | 2018-07-11 | Paper |
The ring/\(\kappa\)-rings network design problem: model and branch-and-cut algorithm
Networks | 2018-05-23 | Paper |
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
Journal of Heuristics | 2017-06-27 | Paper |
A branch-and-cut algorithm for two-level survivable network design problems
Computers & Operations Research | 2016-11-17 | Paper |
A branch-and-cut algorithm for the hub location and routing problem
Computers & Operations Research | 2016-11-10 | Paper |
| Hierarchical survivable network design problems | 2016-10-18 | Paper |
A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
European Journal of Operational Research | 2016-10-07 | Paper |
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem: A matheuristic
Lecture Notes in Computer Science | 2011-09-09 | Paper |
A local branching heuristic for the capacitated fixed-charge network design problem
Computers & Operations Research | 2009-11-17 | Paper |
A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
Computers & Operations Research | 2008-12-17 | Paper |
Solving a capacitated hub location problem
European Journal of Operational Research | 2007-10-10 | Paper |
Locating a cycle in a transportation or a telecommunications network
Networks | 2007-07-20 | Paper |
A branch-and-cut algorithm for the plant-cycle location problem
The Journal of the Operational Research Society | 2005-04-04 | Paper |
Locating median cycles in networks
European Journal of Operational Research | 2004-11-22 | Paper |
The Ring Star Problem: Polyhedral analysis and exact algorithm
Networks | 2004-08-04 | Paper |
Variable neighborhood tabu search and its application to the median cycle problem.
European Journal of Operational Research | 2003-10-14 | Paper |
| scientific article; zbMATH DE number 1453000 (Why is no real title available?) | 2002-02-05 | Paper |
| scientific article; zbMATH DE number 1323024 (Why is no real title available?) | 1999-10-05 | Paper |
