The m-Cost ATSP

@inproceedings{Helmberg1999TheMA,
  title={The m-Cost ATSP},
  author={Christoph Helmberg},
  booktitle={IPCO},
  year={1999}
}
Although the m-ATSP (or multi traveling salesman problem) is well known for its importance in scheduling and vehicle routing, it has, to the best of our knowledge, never been studied polyhedraly, i.e., it has always been transformed to the standard ATSP. This transformation is valid only if the cost of an arc from node i to node j is the same for all machines. In many practical applications this is not the case, machines produce with diierent speeds and require diierent (usually sequence… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Network Routing, volume 8 of Handbooks in Operations Research and Management Science

  • M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, editors
  • Elsevier Sci. B.V., Amsterdam,
  • 1995

A branch-and-cut algorithm for the generalized travelling salesman problem

  • M. Fischetti, J. Salazar Gonz alez, P. Toth
  • 1994
1 Excerpt

Similar Papers

Loading similar papers…