
| Heuristic algorithm for a crew rostering problem arising in railway applications. |
| A heuristic algorithm for set covering problems arising in railway applications. |
| An Improved Bound for the Asymmetric Travelling Salesman Problem |
| Modelli ed algoritmi per problemi di scheduling in aziende di trasporto pubblico |
| A new Linear Storage, Polynomial Time Approximation Scheme for the Subsetsum Problem |
| Odd cut-sets, odd cycles, and 0-1/2 Chvatal-Gomory cuts. |
| On the facial structure of Steiner Arbonscence polytopes |
| Procedure di bounding e di dominanza per problemi di ottimizzazione combinatoria |