A linear programming formulation of the Traveling Salesman Problem

被引：0
|
作者：
Diaby, Moustapha [1 ]
机构：
[1] Univ Connecticut, Operat & Informat Management, Storrs, CT 06268 USA
来源：
PROCEEDINGS OF THE 11TH WSEAS INTERNATIONAL CONFERENCE ON APPLIED MATHEMATICS (MATH '07) | 2007年
关键词：
linear programming; network optimization; integer programming; Traveling Salesman Problem; combinatorial optimization; scheduling; sequencing;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we present a network flow-based, polynomial-sized linear programming formulation of the Traveling Salesman Problem (TSP). Computational results are discussed.
引用
收藏
页码：97 / +
页数：2
相关论文
共 50 条
12345