| On single-source capacitated facility location with cost and fairness objectives | 0 | 0.34 | 2021 |
| An ILP-refined tabu search for the Directed Profitable Rural Postman Problem. | 10 | 0.54 | 2014 |
| Optimal solutions for routing problems with profits | 21 | 0.77 | 2013 |
| Reoptimizing the rural postman problem | 0 | 0.34 | 2013 |
| A column generation approach for the split delivery vehicle routing problem | 21 | 0.92 | 2011 |
| A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem | 85 | 3.31 | 2006 |
| Complexity and Reducibility of the Skip Delivery Problem | 18 | 1.84 | 2005 |
| Vehicle routing in the 1-skip collection problem | 19 | 1.19 | 2004 |
| The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks | 16 | 0.90 | 2004 |
| The application of a vehicle routing model to a waste-collection problem: two case studies | 24 | 1.53 | 2002 |
| A multidimensional knapsack model for asset-backed securitization | 9 | 0.67 | 2002 |
| On‐line approximation algorithms for scheduling tasks on identical machines withextendable working time | 4 | 0.77 | 1999 |
| An approximation result for a duo-processor task scheduling problem | 6 | 0.69 | 1997 |
| Efficiency and effectiveness of normal schedules on three dedicated processors | 13 | 1.19 | 1997 |
| Scheduling multiprocessor tasks on three dedicated processors | 48 | 4.22 | 1992 |
| The density function of the number of moves to complete the Towers of Hanoi puzzle | 0 | 0.34 | 1984 |
