The Swapping Problem on a Line

  title={The Swapping Problem on a Line},
  author={Shoshana Anily and Michel Gendreau and Gilbert Laporte},
  journal={SIAM J. Comput.},
We consider the problem of optimally swapping objects between N workstations, which we refer to as nodes, located on a line. There are m types of objects, and the set of object-types is denoted by S = {1, . . . ,m}. Object-type 0 is a dummy type, the null object. Each node v contains one unit of a certain object-type av ∈ S ∪ {0} and requires one unit of object-type bv ∈ S ∪ {0}. We assume that the total supply equals the total demand for each of the object-types separately. A vehicle of unit… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 14 extracted citations

Polynomially solvable cases of the bipartite traveling salesman problem

European Journal of Operational Research • 2017
View 5 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-6 of 6 references

The Design and Analysis

S. Anily, R. Hassin
The swapping problem, • 1992
View 7 Excerpts
Highly Influenced

A note on the complexity of a simple transportation problem

D. J. Guan
SIAM J . Comput • 1993
View 1 Excerpt

with applications to minimizing robot arm travel

F. Bock
SIAM J. Comput., • 1971
View 2 Excerpts

Optimum branchings

J. Edmonds
J. Res. Nat. Bur. Standards Sect. B, • 1967
View 2 Excerpts

Similar Papers

Loading similar papers…