| Article ID: | iaor20072326 |
| Country: | United Kingdom |
| Volume: | 33 |
| Issue: | 12 |
| Start Page Number: | 3384 |
| End Page Number: | 3402 |
| Publication Date: | Dec 2006 |
| Journal: | Computers and Operations Research |
| Authors: | Corbern Angel, Sanchis Jos M., Mota Enrique |
| Keywords: | programming: integer, networks: flow |
Arc routing problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing its traversal in the corresponding direction. In this paper, and using the mixed general routing problem as an example, we compare theoretical and computationally both formulations as well as the lower bounds obtained from them using Linear Programming based methods. Extensive computational experiments, including some big and newly generated random instances, are presented.