# The Swapping Problem on a Line

@article{Anily1999TheSP,
title={The Swapping Problem on a Line},
author={Shoshana Anily and M. Gendreau and G. Laporte},
journal={SIAM J. Comput.},
year={1999},
volume={29},
pages={327-335}
}
• Published 1999
• Computer Science, Mathematics
• 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 $a_v \in S \cup \{0\}$ and requires one unit of object-type $b_v \in S \cup \{0\}$. We assume that the total supply equals the total demand for each of the object-types separately. A… CONTINUE READING

#### References

##### Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES
The swapping problem
• Mathematics, Computer Science
• 1992
• 86
Preemptive Ensemble Motion Planning on a Tree
• Mathematics, Computer Science
• 1992
• 67
• PDF
Nonpreemptive Ensemble Motion Planning on a Tree
• Mathematics, Computer Science
• 1993
• 61
• PDF
Approximation Algorithms for Some Routing Problems
• Mathematics, Computer Science
• 1978
• 193
Optimum branchings
• 1967