View in: Documentation
Use binary integer programming to solve the classic traveling salesman problem. This problem involves finding the shortest closed tour (path) through a set of stops (cities). In this case
Solve an assignment problem by binary integer programming using the optimization problem approach. For the solver-based approach, see
Run the command by entering it in the MATLAB Command Window. Web browsers do not support MATLAB commands.
You clicked a link that corresponds to this MATLAB command:
Run the command by entering it in the MATLAB Command Window.
Web browsers do not support MATLAB commands.
Choose your country to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a location from the following list:
See all countries