# 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} }

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

#### Topics from this paper.

28 Citations

Static repositioning in a bike-sharing system: models and solution approaches

- Computer Science, Engineering
- 2013

- 335
- PDF

Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem

- Mathematics, Computer Science
- 2004

- 122

A branch-and-cut algorithm for the preemptive swapping problem

- Computer Science, Mathematics
- 2012

- 19
- PDF

A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem

- Mathematics, Computer Science
- 2010

- 23

The multi-commodity one-to-one pickup-and-delivery traveling salesman problem

- Mathematics, Computer Science
- 2009

- 61
- Highly Influenced
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-8 OF 8 REFERENCES

Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel

- Mathematics, Computer Science
- 1988

- 93
- PDF

Optimum branchings

- 1967