Showing papers by "André Langevin published in 1990"
01 Oct 1990
TL;DR: A new two-commodity flow formulation for the traveling salesman problem, where each commodity corresponds to a resource that is either distributed or picked-up along the tour of all nodes.
Abstract: This paper presents a new two-commodity flow formulation for the traveling salesman problem. Each commodity corresponds to a resource that is either distributed or picked-up along the tour of all nodes. This formulation is particularly well-suited to handle time window constraints; the resource used is then the time. This formulation can be extended to the makespan problem. For a n-node proble, the linear relaxation of the formulation involves only O(n) constraints and O(n2) variables. Implementation issuesare discussed and numerical experimentations have been realized for problems of up to 40 nodes. (A)
95 citations
TL;DR: Several single-commodity, two-and multichannel flow formulations have been introduced for the traveling salesman problem as discussed by the authors, and some results are probably known by researchers in the area.
82 citations
01 Jan 1990
TL;DR: In this article, a two-commodity flow formulation for the traveling salesman problem is presented, where each commodity corresponds to a resource that is either distributed or picked up along the tour of all nodes.
Abstract: This paper presents a new two-commodity flow formulation for the traveling salesman problem. Each commodity corresponds to a resource that is either distributed or picked-up along the tour of all nodes. This formulation is particularly well-suited to handle time window constraints; the resource used is then the time. This formulation can be extended to the makespan problem. For a n-node proble, the linear relaxation of the formulation involves only O(n) constraints and O(n2) variables. Implementation issuesare discussed and numerical experimentations have been realized for problems of up to 40 nodes. (A)
1 citations