Note—A Note on “The Formulation of the M-Salesman Traveling Salesman Problem”

DOI10.1287/MNSC.22.6.704MaRDI QIDQ4083207zbMATH OpenOpenAlexFDO

Authors Bezalel Gavish

Publication date 1976

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.22.6.704

Mathematics Subject Classification ID

Integer programming (90C10)

Cited in

(6)

• An approximation-based approach for chance-constrained vehicle routing and air traffic control problems
• Integer linear programming formulations of multiple salesman problems and its variations
• An approach for solving a class of transportation scheduling problems
• An algorithm for the traveling salesman problem with pickup and delivery customers
• Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations
• Exact solutions of some optimization problems of transport logistics

This page was built for publication: Note—A Note on “The Formulation of the M-Salesman Traveling Salesman Problem”

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4083207)