Integer linear programming formulations of multiple salesman problems and its variations

@article{Kara2006IntegerLP,
  title={Integer linear programming formulations of multiple salesman problems and its variations},
  author={Imdat Kara and Tolga Bektas},
  journal={European Journal of Operational Research},
  year={2006},
  volume={174},
  pages={1449-1458}
}
In this paper, we extend the classical multiple traveling salesman problem (mTSP) by imposing a minimal number of nodes that a traveler must visit as a side condition. We consider single and multidepot cases and propose integer linear programming formulations for both, with new bounding and subtour elimination constraints. We show that several variations of the multiple salesman problem can be modeled in a similar manner. Computational analysis shows that the solution of the multidepot mTSP… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 75 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 48 extracted citations

76 Citations

051015'07'10'13'16
Citations per Year
Semantic Scholar estimates that this publication has 76 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Improvements and extensions to the Miller–Tucker–Zemlin subtour elimination constraints

  • M. Desrochers, G. Laporte
  • Operations Research Letters 10
  • 1991
Highly Influential
6 Excerpts

Integer programming formulations of vehicle routing problems

  • R. V. Kulkarni, P. R. Bhave
  • European Journal of Operational Research 20
  • 1985
Highly Influential
7 Excerpts

Integer programming formulations for the multi-depot vehicle routing problem

  • G. Laporte
  • European Journal of Operational Research 38
  • 1989
Highly Influential
6 Excerpts

Gezgin satici ve arac turu belirleme problemleri icin yeni alt tur engelleme kisitlari (New subtour elimination constraints for the traveling salesman and vehicle routing problems) (in Turkish)

  • A. Sipahioglu
  • Unpublished PhD Dissertation
  • 1996
1 Excerpt

A new multiperiod multiple traveling salesman problem with heuristic and application to a scheduling problem

  • K. C. Gilbert, R. B. Hofstra
  • Decision Sciences 23
  • 1992
1 Excerpt

A cutting planes algorithm for the m-salesmen problem

  • G. Laporte, Y. Nobert
  • Journal of the Operational Research Society 31
  • 1980
2 Excerpts

Similar Papers

Loading similar papers…