solve the asymmetric traveling salesman problem More...
Go to the source code of this file.
Namespaces | |
| atsp | |
Functions | |
| def | mcf (n, c) |
| def | mtz (n, c) |
| def | mtz_strong (n, c) |
| def | scf (n, c) |
| def | sequence (arcs) |
Variables | |
| list | arcs = [(i, j) for (i, j) in x if model.getVal(x[i, j]) > .5] |
| dictionary | c |
| def | cost = model.getObjVal() |
| f | |
| def | model = mtz(n, c) |
| int | n = 5 |
| list | sol = [i for (p, i) in sorted([(int(model.getVal(u[i]) + .5), i) for i in range(1, n + 1)])] |
| u | |
| x | |
solve the asymmetric traveling salesman problem
Definition in file atsp.py.