| Publication | Date of Publication | Type |
|---|
Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem
Computers & Operations Research | 2024-06-06 | Paper |
Aesthetic considerations for the min-max \(K\)-windy rural postman problem
Networks | 2024-05-03 | Paper |
The multi‐purpose K‐drones general routing problem
Networks | 2024-01-18 | Paper |
Arc routing problems: A review of the past, present, and future
Networks | 2023-12-11 | Paper |
Upgrading edges in the graphical TSP
Computers & Operations Research | 2023-09-13 | Paper |
Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem
Computational Optimization and Applications | 2022-08-08 | Paper |
The min-max close-enough arc routing problem
European Journal of Operational Research | 2022-03-18 | Paper |
The profitable close-enough arc routing problem
Computers & Operations Research | 2022-03-09 | Paper |
Solving the length constrained \(K\)-drones rural postman problem
European Journal of Operational Research | 2021-06-07 | Paper |
On the distance-constrained close enough arc routing problem
European Journal of Operational Research | 2021-06-04 | Paper |
A matheuristic for the distance-constrained close-enough arc routing problem
Top | 2019-07-11 | Paper |
Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
Discrete Applied Mathematics | 2019-05-17 | Paper |
The directed profitable rural postman problem with incompatibility constraints
European Journal of Operational Research | 2018-05-29 | Paper |
The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
European Journal of Operational Research | 2018-05-24 | Paper |
The stacker crane problem and the directed general routing problem
Networks | 2018-05-23 | Paper |
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
EURO Journal on Computational Optimization | 2018-03-28 | Paper |
| The rural postman problem on directed, mixed, and windy graphs | 2017-07-11 | Paper |
| Arc routing problems with min-max objectives | 2017-07-11 | Paper |
| scientific article; zbMATH DE number 6741961 (Why is no real title available?) | 2017-07-11 | Paper |
A branch-and-cut algorithm for the orienteering arc routing problem
Computers & Operations Research | 2016-11-17 | Paper |
A branch-and-cut algorithm for the profitable windy rural postman problem
European Journal of Operational Research | 2016-10-07 | Paper |
A matheuristic for the team orienteering arc routing problem
European Journal of Operational Research | 2016-10-06 | Paper |
A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
Networks | 2016-06-10 | Paper |
A branch-and-cut algorithm for the maximum benefit Chinese postman problem
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
An ILS-based metaheuristic for the Stacker Crane problem
Evolutionary Computation in Combinatorial Optimization | 2012-10-18 | Paper |
New results on the windy postman problem
Mathematical Programming. Series A. Series B | 2012-04-27 | Paper |
New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
Networks | 2012-01-18 | Paper |
Min-Max \(K\)-vehicles windy rural postman problem
Networks | 2010-11-24 | Paper |
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
A branch & cut algorithm for the windy general routing problem and special cases
Networks | 2007-07-30 | Paper |
Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems
Mathematical Programming. Series A. Series B | 2006-06-28 | Paper |
New heuristic algorithms for the windy rural postman problem
Computers & Operations Research | 2005-09-02 | Paper |
GRASP and path relinking for the matrix bandwidth minimization.
European Journal of Operational Research | 2004-01-05 | Paper |
