A continuous variable representation of the traveling salesman problem |
| |
| Authors: | Joseph A. Svestka |
| |
| Affiliation: | (1) The University of Wisconsin-Milwaukee, Milwaukee, WI., USA |
| |
| Abstract: | The classic traveling salesman problem is characterized in terms of continuous flows on a specially constructed non-conservative network, in 2n – 1 linear constraints and a cardinality constraint. It is shown that every solution to the network problem is a hamiltonian circuit. |
| |
| Keywords: | Traveling Salesman Problem Cardinality Constraints Hamiltonian Circuits Network Flow Problems |
| 本文献已被 SpringerLink 等数据库收录！ |
